IP Library Patent Application 18475859
Patent Application
App. No. 18/475,859

META-LEARNED EVOLUTIONARY STRATEGIES OPTIMIZER

Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US None
App. No.
18/475,859
Abstract

There is provided a computer-implemented method for updating a search distribution of an evolutionary strategies optimizer using an optimizer neural network comprising one or more attention blocks. The method comprises receiving a plurality of candidate solutions, one or more parameters defining the search distribution that the plurality of candidate solutions are sampled from, and fitness score data indicating a fitness of each respective candidate solution of the plurality of candidate solutions. The method further comprises processing, by the one or more attention neural network blocks, the fitness score data using an attention mechanism to generate respective recombination weights corresponding to each respective candidate solution. The method further comprises updating the one or more parameters defining the search distribution based upon the recombination weights applied to the plurality of candidate solutions.

Claims (59)

1 . A computer-implemented method for updating a search distribution of an evolutionary strategies optimizer using an optimizer neural network comprising one or more attention blocks, the method comprising:

receiving a plurality of candidate solutions, one or more parameters defining the search distribution that the plurality of candidate solutions are sampled from, and fitness score data indicating a fitness of each respective candidate solution of the plurality of candidate solutions;

processing, by the one or more attention neural network blocks, the fitness score data using an attention mechanism to generate respective recombination weights corresponding to each respective candidate solution; and

updating the one or more parameters defining the search distribution based upon the recombination weights applied to the plurality of candidate solutions.

2 . The method of claim 1 , wherein processing, by the one or more attention neural network blocks, the fitness score data using an attention mechanism to generate respective recombination weights corresponding to each respective candidate solution comprises:

processing, by a query embedding neural network, the fitness score data to generate a query embedding for each respective candidate solution;

processing, by a key embedding neural network, the fitness score data to generate a key embedding for each respective candidate solution;

processing, by a value embedding neural network, the fitness score data to generate a value embedding for each respective candidate solution;

generating attention weights based upon a dot product attention mechanism between the query embedding and key embedding for each respective candidate solution; and

generating the recombination weights corresponding to each respective candidate solution based upon applying the attention weights to the value embedding for each respective candidate solution.

3 . The method of claims 1 , wherein the fitness score data comprises one or more of the following: a fitness score for a respective candidate solution, a ranking of the respective candidate solution, and an indication of whether the fitness score of the respective candidate solution exceeds a previous best fitness score.

4 . The method of claim 1 , wherein updating the one or more parameters defining the search distribution based upon the recombination weights applied to the plurality of candidate solutions comprises:

aggregating the values of the recombination weights applied to the plurality of candidate solutions and applying at least one learning rate parameter to the aggregated values to generate an update value; and

updating the one or more parameters based upon the at least one update value.

5 . The method of claim 4 , wherein the optimizer neural network further comprises a learning rate update unit configured to process an input based upon the recombination weights and a current value of the at least one learning rate parameter, to generate an updated value for the at least one learning rate parameter.

6 . The method of claim 5 , wherein the learning rate update unit is further configured to process a timestamp embedding to generate the updated value for the at least one learning rate parameter.

7 . The method of claim 1 , wherein the search distribution is a diagonal Gaussian distribution and the one or more parameters comprises a mean vector and a standard deviation vector.

8 . The method of claim 1 , further comprising: generating a solution using the updated search distribution and outputting the generated solution.

9 . The method of claim 1 , wherein the evolutionary strategies optimizer is configured to output a neural network for performing a task and each respective candidate solution represents a candidate neural network for performing the task.

10 . The method of claim 9 , in which the task is one of the group consisting of:

from one or more images, or features extracted from one or more images, obtaining for each of a set of multiple categories, an estimated likelihood that the one or more images contain an image of an object which is in the category;

an image segmentation task;

an image keypoint detection task;

recognition of what action is being performed in a video segment;

processing a text input to the neural network in one language to generate an estimate that a piece of text in another language is a proper translation of the input text into the other language;

processing a sequence representing a spoken utterance, to generate a score for each of a set of pieces of text, each score representing an estimated likelihood that the piece of text is the correct transcript for the utterance; or

a task of controlling an agent to perform a manipulation and/or navigation within a real-world environment based on observations of the environment made using one or more sensors.

11 . A system comprising:

one or more computers; and

one or more storage devices communicatively coupled to the one or more computers, wherein the one or more storage devices store instructions that, when executed by the one or more computers, cause the one or more computers to perform operations for updating a search distribution of an evolutionary strategies optimizer using an optimizer neural network comprising one or more attention blocks, the operations comprising:

receiving a plurality of candidate solutions, one or more parameters defining the search distribution that the plurality of candidate solutions are sampled from, and fitness score data indicating a fitness of each respective candidate solution of the plurality of candidate solutions;

processing, by the one or more attention neural network blocks, the fitness score data using an attention mechanism to generate respective recombination weights corresponding to each respective candidate solution; and

updating the one or more parameters defining the search distribution based upon the recombination weights applied to the plurality of candidate solutions.

12 . The system of claim 11 , wherein processing, by the one or more attention neural network blocks, the fitness score data using an attention mechanism to generate respective recombination weights corresponding to each respective candidate solution comprises:

processing, by a query embedding neural network, the fitness score data to generate a query embedding for each respective candidate solution;

processing, by a key embedding neural network, the fitness score data to generate a key embedding for each respective candidate solution;

processing, by a value embedding neural network, the fitness score data to generate a value embedding for each respective candidate solution;

generating attention weights based upon a dot product attention mechanism between the query embedding and key embedding for each respective candidate solution; and

generating the recombination weights corresponding to each respective candidate solution based upon applying the attention weights to the value embedding for each respective candidate solution.

13 . The system of claim 11 , wherein the fitness score data comprises one or more of the following: a fitness score for a respective candidate solution, a ranking of the respective candidate solution, and an indication of whether the fitness score of the respective candidate solution exceeds a previous best fitness score.

14 . The system of claim 11 , wherein updating the one or more parameters defining the search distribution based upon the recombination weights applied to the plurality of candidate solutions comprises:

aggregating the values of the recombination weights applied to the plurality of candidate solutions and applying at least one learning rate parameter to the aggregated values to generate an update value; and

updating the one or more parameters based upon the at least one update value.

15 . The system of claim 14 , wherein the optimizer neural network further comprises a learning rate update unit configured to process an input based upon the recombination weights and a current value of the at least one learning rate parameter, to generate an updated value for the at least one learning rate parameter.

16 . One or more non-transitory computer storage media storing instructions that when executed by one or more computers cause the one or more computers to perform operations for updating a search distribution of an evolutionary strategies optimizer using an optimizer neural network comprising one or more attention blocks, the operations comprising:

receiving a plurality of candidate solutions, one or more parameters defining the search distribution that the plurality of candidate solutions are sampled from, and fitness score data indicating a fitness of each respective candidate solution of the plurality of candidate solutions;

processing, by the one or more attention neural network blocks, the fitness score data using an attention mechanism to generate respective recombination weights corresponding to each respective candidate solution; and

updating the one or more parameters defining the search distribution based upon the recombination weights applied to the plurality of candidate solutions.

17 . The non-transitory computer storage media of claim 16 , wherein processing, by the one or more attention neural network blocks, the fitness score data using an attention mechanism to generate respective recombination weights corresponding to each respective candidate solution comprises:

processing, by a query embedding neural network, the fitness score data to generate a query embedding for each respective candidate solution;

processing, by a key embedding neural network, the fitness score data to generate a key embedding for each respective candidate solution;

processing, by a value embedding neural network, the fitness score data to generate a value embedding for each respective candidate solution;

generating attention weights based upon a dot product attention mechanism between the query embedding and key embedding for each respective candidate solution; and

generating the recombination weights corresponding to each respective candidate solution based upon applying the attention weights to the value embedding for each respective candidate solution.

18 . The non-transitory computer storage media of claim 16 , wherein the fitness score data comprises one or more of the following: a fitness score for a respective candidate solution, a ranking of the respective candidate solution, and an indication of whether the fitness score of the respective candidate solution exceeds a previous best fitness score.

19 . The non-transitory computer storage media of claim 16 , wherein updating the one or more parameters defining the search distribution based upon the recombination weights applied to the plurality of candidate solutions comprises:

aggregating the values of the recombination weights applied to the plurality of candidate solutions and applying at least one learning rate parameter to the aggregated values to generate an update value; and

updating the one or more parameters based upon the at least one update value.

20 . The non-transitory computer storage media of claim 19 , wherein the optimizer neural network further comprises a learning rate update unit configured to process an input based upon the recombination weights and a current value of the at least one learning rate parameter, to generate an updated value for the at least one learning rate parameter.

Assignments (4)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 6, 2025
From: DEEPMIND TECHNOLOGIES LIMITED
To: GDM HOLDING LLC
Reel/Frame 071498/0210 →
CORRECTIVE ASSIGNMENT TO CORRECT THE PREVIOUSLY ATTACHED DDOCUMENT TO REPLACE WITH CORRECTED DOCUMENT & RECEIVING PARTY POSTAL CODE FROM EC4A 3WT TO EC4A 3TW PREVIOUSLY RECORDED ON REEL 065399 FRAME 0506. ASSIGNOR(S) HEREBY CONFIRMS THE ASSIGNMENT. Recorded Dec 25, 2023
From: LANGE, ROBERT TJARKO; SCHAUL, TOM; CHEN, YUTIAN; ZAHAVY, TOM BEN ZION; DALIBARD, VALENTIN CLEMENT; LU, CHRISTOPHER YENCHUAN; BAVEJA, SATINDER SINGH; FLENNERHAG, JOHAN SEBASTIAN
To: DEEPMIND TECHNOLOGIES LIMITED
Reel/Frame 066130/0213 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 31, 2023
From: LANGE, ROBERT TJARKO; SCHAUL, TOM; CHEN, YUTIAN; ZAHAVY, TOM BEN ZION; DALIBARD, VALENTIN CLEMENT; LU, CHRISTOPHER YENCHUAN; BAVEJA, SATINDER SINGH; FLENNERHAG, JOHAN SEBASTIAN
To: DEEPMIND TECHNOLOGIES LIMITED
Reel/Frame 065399/0506 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 29, 2023
From: LANGE, ROBERT TJARKO; SCHAUL, TOM; CHEN, YUTIAN; ZAHAVY, TOM BEN ZION; DALIBARD, VALENTIN CLEMENT; LU, CHRISTOPHER YENCHUAN; BAVEJA, SATINDER SINGH; FLENNERHAG, JOHAN SEBASTIAN
To: DEEPMIND TECHNOLOGIES LIMITED
Reel/Frame 065072/0117 →