D ISCOVERING E VOLUTION S TRATEGIES VIA M ETA -B LACK -B OX O PTIMIZATION
Yutian Chen Zahavy
DeepMind Flennerhag DeepMind
A BSTRACT
Optimizing functions without access to gradients is the remit of black-box methods such as evolution strategies.
While highly general, their learning dynamics are often times heuristic and inflexible — exactly the limitations that meta-learning can address.
Hence, we propose to discover effective update rules for evolution strategies via meta-learning.
Concretely, our approach employs a search strategy parametrized by a self-attention-based architecture, which guarantees the update rule is invariant to the ordering of the candidate solutions.
We show that metaevolving this system on a small set of representative low-dimensional analytic optimization problems is sufficient to discover new evolution strategies capable of generalizing to unseen optimization problems, population sizes and optimization horizons.
Furthermore, the same learned evolution strategy can outperform established neuroevolution baselines on supervised and continuous control tasks.
As additional contributions, we ablate the individual neural network components of our method; reverse engineer the learned strategy into an explicit heuristic form, which remains highly competitive; and show that it is possible to self-referentially train an evolution strategy from scratch, with the learned update rule used to drive the outer meta-learning loop
I NTRODUCTION
Black-box optimization (BBO) methods are those general enough for the optimization of functions without access to gradient evaluations.
Recently, BBO methods have shown competitive performance to gradient-based optimization, namely of control policies (Salimans et al., 2017; Such et al., 2017; Lee et al., 2022).
Evolution Strategies (ES) are a class of BBO that iteratively refines the sufficient statistics of a (typically Gaussian) sampling distribution, based on the function evaluations (or fitness) of sampled candidates (population members).
Their update rule is traditionally formalized by equations based on first principles (Wierstra et al., 2014; Ollivier et al., 2017), but the resulting specification is inflexible.
On the other hand, the evolutionary algorithms community has proposed numerous variants of BBO, derived from very different metaphors, some of which have been shown to be equivalent (Weyland, 2010).
One way to attain flexibility without having to hand-craft heuristics is to learn the update rules of BBO algorithms from data, in a way that makes them more adaptive and scalable.
This is the approach we take: We meta-learn a neural network parametrization of a BBO update rule, on a set of representative task families, while leveraging evaluation parallelism of different BBO instances on modern accelerators, building on recent developments in learned optimization (e.g. Metz et al., 2022).
This procedure discovers novel black-box optimization methods via meta-black-box optimization, and is abbreviated by MetaBBO .
Here, we investigate one particular instance of MetaBBO and leverage it to discover a learned evolution strategy (LES).
The concrete LES architecture can be viewed as a minimal Set Transformer (Lee et al., 2019), which naturally enforces an update rule that is invariant to the ordering of candidate solutions within a batch of black-box evaluations.
After meta-training, LES has learned to flexibly interpolate between copying the best-performing candidate solution (hill-climbing) and successive moving average updating (finite difference gradients).
Our contributions are summarized as follows: averaged
More training details can be found in Section and in supplementary (SI 2 and A.10, Figure 14)
We propose a novel self-attention-based ES parametrization and demonstrate that it is possible to meta-learn black-box optimization algorithms that outperform existing handcrafted ES algorithms on neuroevolution tasks (Figure 1, right).
The learned strategy generalizes across optimization problems, compute resources and search space dimensions.
We investigate the importance of the meta-task distribution and meta-training protocol.
We find that in order to meta-evolve a well-performing ES, only a handful of core optimization classes are needed at meta-training time.
These include separable, multi-modal and high conditioning functions (Section 5).
We reverse-engineer the learned search strategy.
More specifically, we ablate the black-box components recovering an interpretable strategy and show that all neural network components have a positive effect on the early performance of the search strategy (Section 6).
The discovered evolution strategy provides a simple to implement yet very competitive new ES.
We demonstrate how to generate a new LES starting from a blank-slate LES:
A randomly initialized LES can bootstrap its own learning progress and self-referentially meta-learn its own weights (Section 7).
R ELATED W ORK
Evolution Strategies & Neuroevolution .
Unlike gradient-based optimization, ES (Rechenberg, 1973; Schwefel, 1977; Beyer & Schwefel, 2002) rely only on black-box function evaluations without the necessity of access to gradient evaluations.
Instead, they iterate between the sampling of candidate solutions, their evaluation and the updating of the sampling distribution.
ES can be grouped into estimation of distribution algorithms, which refine the sufficient statistics of a sampling distribution in order to increase the likelihood of high fitness solutions (Hansen & Ostermeier, 2001) and finite-difference gradient-based methods (Wierstra et al., 2014; Nesterov & Spokoiny, 2017).
They can address non-differentiable problem settings and yield competitive wall-clock times on neural network tasks due to parallel fitness evaluation (Salimans et al., 2017; Such et al., 2017).
Discovering Algorithm Components from Data .
The history of machine learning has been characterized by the successive replacement of manually designed components by modules that are informed by data.
This includes the use of convolutional neural networks that learn filters (Fukushima, 1975; LeCun et al., 1998), neural architecture search (Elsken et al., 2019) or initilization schemes (Dauphin & Schoenholz, 2019).
Recently, these efforts have been extended to the end-to-end discovery of objective functions in Reinforcement Learning (Kirsch et al., 2019;
Oh et al., 2020; Xu et al., 2020; Lu et al., 2022), the online refinement of hyperparameter schedules (Xu et al., 2018;
Zahavy et al., 2020; Flennerhag et al., 2021; Parker-Holder et al., 2022) and the meta-learning of entire learning algorithms (Wang et al., 2016; Kirsch & Schmidhuber, 2021; Kirsch et al., 2022).
Meta-Learned Gradient-Based Optimization .
An exciting direction aims to meta-learn gradient descent-based learning rules (Bengio et al., 1992; Andrychowicz et al., 2016; Metz et al., 2019) to update the weights of a neural network.
Unlike our proposed method, these approaches require access to gradient calculations using the backpropagation algorithm implemented by automatic differentiation software.
The gradient and several summary statistics are processed by a small neural network, whose weights have been meta-learned on a distribution of tasks (Metz et al., 2020).
The resulting outputs are calculated on a per-parameter basis and used to characterize the magnitude and direction of the weight change.
It has been shown that this approach can extract useful inductive biases for domain-specific gradient-based optimization (Merchant et al., 2021;
Metz et al., 2022) but can struggle to broadly generalize to task domains beyond the meta-training distribution.
Meta-Learned Black-Box Optimization .
Shala et al.
(2020) meta-learn a policy that controls the scalar search scale of CMA-ES (Hansen & Ostermeier, 2001).
Chen et al.
(2017); TV et al.
; Gomes et al.
explored meta-learning entire algorithms for low-dimensional BBO.
They parametrize the algorithm by a recurrent network processing the raw solution vectors and/or their associated fitness.
Their applicability is constrained to narrow optimization domains, fixed population sizes or search dimensions.
The proposed LES, on the other hand, learns to recombine solution candidates by leveraging the invariance properties of dot-product self-attention (Lee et al., 2019; Tang & Ha, 2021).
After meta-training the learned ES generalizes to unseen populations and a large number of dimensions ( > 5000 ).
To the best of our knowledge we are the first to demonstrate that a meta-learned ES generalizes to neuroevolution tasks.
Our meta-evolution approach does not rely on access to a teacher ES (Shala et al., 2020) or knowledge of task optima (TV et al., 2019).
Self-Referential Meta-Learning .
Our current learning systems are not capable of flexibly refining their own learning behavior.
Schmidhuber (1987) first articulated the vision of self-referentially updating a genetic algorithm to improve its own performance.
Kirsch & Schmidhuber (2022) further formulated a simple heuristic to allocate compute resources for population-based self-referential learning.
Metz et al.
(2021a) showed that the recursive meta-training of gradient-based optimizers is feasible using an improvement mechanism based on population-based training (Jaderberg et al., 2017).
Here, we introduce a simple self-referential MetaBBO loop, which successfully meta-evolves a LES capable of generalization to continuous control tasks.
P RELIMINARIES : G AUSSIAN E VOLUTION S TRATEGIES
Many common ES use Gaussian search distributions, with the most scalable ones using isotropic or diagonal (axis-aligned)
Gaussian approximations.
They have shown to effectively scale to large search space dimensions, specifically in the context of neuroevolution (Salimans et al., 2017), and can outperform full covariance search methods (Ros & Hansen, 2008).
We therefore chose them as the starting point for our attention-based LES architecture, and use four common ones as baselines:
OpenES (Salimans et al., 2017), sep-CMA-ES (Ros & Hansen, 2008), PGPE (Sehnke et al., 2010) and SNES (Schaul et al., 2011).
We also compare with ASEBO (Choromanski et al., 2019), which dynamically adapts to the fitness geometry based on the iterative estimation of gradient subspaces.
Diagonal ES maintain mean m ∈ R D and standard deviation vectors σ ∈ R D , where D denotes the number of search space dimensions.
At each generation one samples a population of candidate solutions x j ∈ R D ∼ N ( m , σ 1 D ) for all j = 1 , ..., N population members.
Each solution vector is evaluated, producing fitness estimates f j ∈ R , which are used to construct recombination weights w j .
These weights define how to update the search distribution (mean and standard deviations).
Most often, the weights are assigned based on the rank of the fitness rank( j ) ∈ [1 , N ] among the current population, for example:
[Equation]
where w rank( j ) denotes the weight assigned to the rank of member j , and E denotes the number of high-fitness candidates that contribute to the update.
The search distribution is then updated using an exponentially moving fitness-weighted average:
[Equation]
which can be interpreted as a finite-difference gradient update on the expected fitness.
Both the learning rates α m , α σ and the weighting scheme w t , highlighted in red, are commonly fixed across the update generations t
= 1 , ..., T , which is an obvious restriction to the flexibility of the ES.
The main aim of our proposed meta-learned neural network parametrization is to overcome the implied limitations by meta-learning these.
M ETA -E VOLVING E VOLUTION S TRATEGIES
In this section, we first introduce the learned evolution strategy architecture (Figure 1, middle), a self-attention-based generalization of the diagonal Gaussian ES in equations 2 and 3.
Section 4.
then outlines the MetaBBO procedure (Figure 1, left) used to meta-evolve the weights of LES.
4. Learned Evolution Strategies ( LES ) : P OPULATION O RDER -I NVARIANCE VIA A TTENTION
A fundamental property that any (learned) ES has to fulfill is invariance in the ordering of population members within a generation.
Intuitively, the order of the population members is arbitrary and should therefore not affect the search distribution update.
A natural inductive bias for an appropriate neural network-based parametrization is given by the dot-product self-attention mechanism.
Our proposed learned evolution strategy processes a matrix F t of population member-specific tokens (Figure 1, middle).
F t ∈ R N × 3 consists of (1) the z -scored population fitness scores, (2) a centered rank transformation (lying within [ − 0 .
5 , 0 . 5] ), and (3) a Boolean indicating whether the fitness score exceeds the previously best score.
This fitness matrix is embedded into queries ( Q ∈ R N × D K ), keys ( K ∈ R N × D K ) and values ( V ∈ R N × 1 ) using learned linear transforms with weights W K , W Q , W V .
Recombination weights are computed as attention scores over the members:
[Equation]
The resulting recombination weights are shared across the search space dimensions, but vary across the generations t .
Instead of using a set of fixed learning rates, we additionally modulate α m,t , α σ,t ∈ R D by a MLP parametrized by ϕ and shared across D .
It processes a timestamp embedding and parameter-specific information provided by momentum-like statistics (see SI A.1).
The chosen parametrization can in principle smoothly interpolate between integrating information from many population members and copying over a single best performing solution by setting a single recombination weight and α m,t to one for all dimensions.
The set of LES parameters are given by θ = { W k , W q , W v , ϕ } , whose total number is usually small ( < 500) given a sufficient key embedding size ( D K = 8 ).
The complexity of the proposed LES scales quadratically in the population size, which for common application budgets ( N < 10 , 000 ) introduces a negligible runtime cost.
4. MetaBBO : M ETA -B LACK -B OX O PTIMIZATION OF B LACK -B OX O PTIMIZERS
How do we learn the LES parameters θ , so that they provide useful inductive biases for blackbox optimization?
Meta-learning via evolutionary optimization has previously proven successful in the context of learned gradient-based optimization (Vicol et al., 2021) and RL objective discovery (Lu et al., 2022).
It avoids exploding meta-gradients (Metz et al., 2021b), myopic meta-solutions (Flennerhag et al., 2021; Lange & Sprekeler, 2022), and allows to optimize θ through long inner loop
ES executions involving stochastic sampling.
We adopt this meta-evolution approach in MetaBBO and iterate the following steps (Figure 1, left; SI Algorithm 1):
Meta-sampling .
At each meta-generation we sample a population of LES network parametrizations θ i for i = 1 , . . .
, M meta-population members using a standard off-theshelf ES algorithm with meta-mean µ and covariance Σ .
Inner loop search .
Next, we estimate the performance of different LES parametrizations on a set of tasks.
We sample a set of inner loop optimization problems.
For each task we initialize a mean m 0 ∈ R D , standard deviation σ 0 ∈ R D .
Each LES instance is then executed on a batch of inner loop tasks (in parallel) with N population members and for a fixed set of inner-loop generations t = 1 , . .
, T .
Meta-normalize .
In order to ensure stable meta-optimization with optimization problems that can exhibit very different fitness scales, we normalize ( z -score) the fitness scores within tasks and across meta-population members.
We average the scores over inner-loop tasks, and maximize over inner-loop population members and over generations.
Meta-updating .
Given the meta-performance estimate for the different LES parametrizations, we update the meta-ES search distribution µ ′ , Σ ′ and iterate.
The choice of the meta-task distribution is crucial to ensure generalization of the meta-learned evolution strategy.
We select a small set of classic black-box optimization functions, to characterize a space of representative optimization problems.
The problem space includes smooth functions with and without high curvature and multi-modal surfaces with global and local structure.
Furthermore, we apply Gaussian additive noise to the fitness evaluations to mimic unreliable estimation and sample optima offsets.
MetaBBO differs from standard meta-learning in a couple aspects: First, we use
BBO in both the inner and outer loop.
This allows for flexible LES design, stochastic sampling and long inner loop ES execution.
We also share the same task parameters, m 0 and fixed randomness for all meta-population members θ i .
The fixed stochasticity and task-based normalization enhances stable meta-optimization (‘Pegasus-trick’, Ng & Jordan, 2000).
E XPERIMENTS
In this section we discuss the results of meta-learning LES parameters via MetaBBO.
We answer the following questions: Does MetaBBO discover an ES capable of generalization beyond the metatraining distribution and can the LES meta-trained only on a limited set of functions even generalize to unseen neural network tasks with different fitness functions & network architectures?
5. M ETA -T RAINING ON THE B LACK -B OX O PTIMIZATION B ENCHMARK
Throughout, we meta-train on functions from the BBOB (Hansen et al., 2010) benchmark, which comprise a set of challenging functions for optimization (Table 1).
From BBOB, we construct a small , medium , and large meta-training set (detailed in Section 5.2).
To create a task instance, we randomly sample: (1) a function f from the meta-training set, (2) a dimensionality
D ∼ U { 2 , 3 , . .
. , 10 } for f : R D
→ R , (3) a noise-level Ξ ∼ U [0 , 0 . 1] , and (4) an optimum offset z ∼ U [ − 5 , 5] D , which together creates a stochastic objective ˆ f ( x ) ∼ f
( x + z )
+Ξ N (0 , 1) .
Finally, (5) we sample an initialization m 0 ∼ [ − 5 , 5] D and starting generation counter t 0 ∈ [0 , 2000] .
In the MetaBBO outer loop we optimize θ using CMA-ES (Hansen & Ostermeier, 2001) formeta-generations with a meta-population size of M = 256 .
We sample 128 tasks and train each sampled LES on each task independently.
Each LES is unrolled for T
=
50 generations, with
N = 16 population members in each iteration.
Each LES-task pair is assigned a raw fitness score according to the highest fitness (lowest loss) obtained in the rollout.
These raw scores are metanormalized per task before we aggregate them into a meta-fitness score for each sampled LES.
During MetaBBO training, we find average meta-training improves rapidly (Figure 2, top left) and is invariant to the choice of the meta-ES optimizer.
We assess the performance of LES obtained through the MetaBBO outer loop, on the BBOB functions (Figure 2, right).
LES generalizes well to larger dimensions and larger evaluation budgets on both meta-training and meta-testing function classes.
While the task complexity increases with D and performance drops for a fixed population size, LES is capable of making use of the additional evaluations provided by an increased population.
5. M ETA -G ENERALIZATION OF LES TO U NSEEN N EUROEVOLUTION T ASKS
Our results on BBOB suggests that LES have strong generalizing properties, thus prompting the question, what are the limits of LES’ generalization capabilities?
In this section, we evaluate an LES trained on BBOB on a set of CNN-based classification tasks and continuous control tasks (Figure 3) using MLP policies.
This requires LES to generalize beyond the 10 -dimensional problems it was trained on to thousands of dimensions.
Not only that, but also to completely different loss surfaces, and even learning paradigms (in the case of continuous control).
Figure 3 shows that LES is indeed capable of successfully evolving CNN classifiers on different
MNIST variants.
We also find that it is capable of evolving 4-layer MLP policies for robotics tasks (Freeman et al., 2021).
We consider three budgets for test-time optimisation (that vary in inner loop length T and population size N , see Figure 3).
LES generally outperforms ES baselines 3 across testtime budgets.
It enjoys a substantial advantage in small budgets, where it outperforms baselines on 5 out of 7 tasks.
LES still performs best on the majority of tasks for the medium and large adaptation budgets, which requires it to generalize to larger populations and longer unroll lengths.
Next, we evaluate the impact of the meta-training distribution on the generalization of LES.
The small metatraining set consists of 1 BBOB function and restricts dimenionality to D = 2 with inner loop length T = 25 .
medium is restricted to 5 functions.
, with D ∈ { 1 , 2 , . . .
, 5 } and T = 25 ; large is given by 10 functions, D ∈ { 1 , 2 , . . .
, 10 } and T = 50 .
Figure 4 shows that training on broader meta-training distributions has a positive effect on the generalization capability of the trained LES, as measured on continuous control tasks.
In particular, we find that meta-training with larger populations in the inner loop especially benefits from scaling up the meta-training set.
R EVERSE E NGINEERING L EARNED E VOLUTION S TRATEGIES
In order to investigate which algorithmic components are discovered by the MetaBBO procedure we start by ablating the different metalearned neural network modules.
Fixing both recombination weights and the learning rate modulation, as per the simple Gaussian ES in
Section 3 degrades performance significantly (Figure 5, top left).
Fixing the recombination weights (as in equation 1, E = 0 .
5 N ) also decreases performance, but fixing the learning rates to α m = 1 , α σ = 0 .
1 does not hurt performance significantly.
We observed that the learning rates are flexibly adapted early in training, but settle quickly to constant values (Figure 5, right).
Next, we visualized the recombination weights for a LES run on the Walker2D
Brax task (Figure 5, top middle).
LES performs a variable amount of selection and either applies hill-climbing or integrates information from multiple well-performing solutions.
We plot the weights as a function of the centered rank (for N = 256 ) for sampled Gaussian fitness scores (Figure 5, bottom middle).
The recombination weights can be well approximated by a softmax parametrization of the centered ranks: w t,j = softmax (
[Equation]
with a temperature parameter β ≈ 12 . 5 .
Intuitively, the temperature regulates the amount of selection pressure applied by the recombination weights.
Based on these insights, we implement an interpretable ES that uses the discovered recombination weight approximation.
We call the resulting algorithm Discovered Evolution Strategy (DES, SI Algorithm 2).
DES ( β = 12 . 5) performs similarly to LES on the Brax benchmark tasks and can be further improved by tuning the temperature parameter (Figure 5, bottom left).
This result highlights that MetaBBO can be used not only to discover black-box ES strategies, but also to discover new interpretable inductive biases.
S ELF -R EFERENTIAL M ETA -E VOLUTION OF LES
Given a choice of meta-ES, MetaBBO can discover LES that performs competitively with baseline
ES.
It is therefore natural to ask, can we use an LES to discover a new LES?
And can this be a purely self-referential loop, starting from a random initialization?
To address this question we consider a two-step self-referential metaBBO paradigm, which starts from a random θ meta (Figure 6, left): 1.
We evaluate a set of candidate LES parametrizations θ i ∼ N ( µ, Σ) with Σ = σ 1 .
After obtaining the meta-fitness scores f ( θ i ) , we update the strategy statistics using the metaLES update rule µ ′ , Σ ′ ← LES ( { θ i , f i } Mi =1 | µ, Σ , θ meta ) .
If the meta-fitness has improved, we replace θ meta ← arg max θ i f
( θ i ) using a hillclimbing step that copies the best performing inner-loop mean µ ′ ← θ meta .
Additionally, we reset the meta-search variance to induce additional exploration around the newly improved meta-search mean: Σ ← σ 0 1 D meta .
Note that this procedure starts out as simple random search with hill-climbing selection.
As the meta-parameters are updated, the meta-search is improved by the newly learned inductive biases.
Thereby, LES is capable of improving its own optimization behavior.
Figure 6 compares different meta-training procedures for LES, including the usage of CMA-ES, a previously meta-trained and fixed LES instance, and our proposed self-referential training paradigm.
We find it is indeed feasible to effectively self-evolve LES starting from a random initialization.
While the meta-fitness is the by frozen improved fastest by the pre-trained LES instance, we observe that the resulting meta-trained LES does not generalize well to the downstream Brax evaluation (Figure 6, bottom right).
Both the
CMA-ES optimizer and self-referential meta-training procedure, on the other hand, are capable of meta-evolving stable and performant LES, that do not overfit to the meta-training task distribution.
We speculate that self-referential meta-training performs implicit regularization: LES is forced to simultaneously perform well on the inner loop tasks and to progress its own continual improvement.
C ONCLUSION & D ISCUSSION
Summary.
We introduced a self-attention-based ES architecture and a procedure to effectively meta-learn its parametrization.
The resulting learned evolution strategy is flexible and outperforms established baseline strategies on both vision and continuous control tasks.
We reverse engineered the discovered search update rule into a simple and competitive DES.
Finally, we showed that it is possible to successfully self-referentially evolve a LES starting from a random initialization of itself.
Limitations.
The LES considered in this paper only applies to diagonal covariance strategies.
This limits its effectiveness on non-separable problems.
We observed that the learning rate module can struggle to generalize to long time horizons indicating a degree of temporal meta-overfitting.
Finally, the self-attention mechanism scales quadratically in the number of population members.
This may be addressed by improvements in Transformer efficiency (Wang et al., 2020; Jaegle et al., 2021).
Future work.
Our LES architecture meta-learns to modulate the search distribution update solely based on fitness transformations.
One potential extension is to provide additional information (agent trajectory or multiple evaluations) to the attention module.
Thereby, the MetaBBO could discover behavioural descriptors in the context of quality-diversity optimization (Pugh et al., 2016; Cully &
Demiris, 2017) or application-specific denoising procedures.
Furthermore, one may want to attend over an archive of well-performing solutions (e.g. as in genetic algorithms) using cross-attention that implements a cross-over operation.
Finally, our experiments indicate the potential of further scaling of the MetaBBO procedure to broader meta-training task distributions. A CKNOWLEDGEMENTS
Work funded by DeepMind.
We thank Nemanja Raki´cevi´c for valuable feedback on a first draft of this manuscript.
Furthermore, the authors are grateful to Antonio Orvieto, Denizalp Goktas, Evgenii
Nikishin, Junhyok Oh, Greg Farquhar, Alexander Neitz, Himanshu Sahni, Ted Moskovitz and other colleagues on the Discovery team and at DeepMind for stimulating discussions over the course of the project.
A. D ISCOVERED E VOLUTION S TRATEGY
1: Inputs: Population members N , search dimensions D , generations T , Initial scale σ 0 ∈ R D ,
Mean and std learning rates α m = 1 , α σ = 0 .
1 , temperature parameter β ≈ 16 .
2: Initialize the search mean m 0 =
D ∈ R D 3: for t = 0 , ..., T − 1 do 4:
Sample candidates: x j ∼ N ( m t , σ t 1 D ) 5:
Evaluate all candidates: f j , ∀ j = 1 , ..., N 6:
Compute weights using: w t,j = softmax (20 × sigmoid ( β × (rank( j ) /N − 0 . 5))) , ∀ j = 1 , ..., N 7:
Update mean using equation (2) → m t + 8:
Update std using equation (3) → σ t + 9: end for
A. H YPERPARAMETER S ETTINGS A.
M ETA BBO
H YPERPARAMETERS
MetaBBO
Hyperparameters for LES Discovery
Hyperparameter
Value
Hyperparameter
Value
Meta-Generations
Meta-Population
Meta-Tasks
Meta-ES
CMA-ES
CMA-ES σ0.
Inner-Population
Inner-Generations m 0 range [-5, 5]
Timestamp Range [0, 2000] σ 0 range [1, 1]
D k Attention keys
MLP Hidden dim.
For the self-referential meta-training results (Section 7 we replace the meta-LES parameters every 5 meta-generations if we observe an improvement in the meta-objective by one of the inner LES candidates.
Furthermore, we reset the meta-variance Σ =
σ 0 I = 0 .
1 I .
A.
N EUROEVOLUTION E VALUATION H YPERPARAMETERS
Brax Task Evaluation Hyperparameters
Hyperparameter
Value
Hyperparameter
Value
Generations
Population
MC Evaluations
MLP Layers
Hidden Units
Activation
Tanh
The Brax experiments all used observation normalization.
MNIST Task Evaluation Hyperparameters
Hyperparameter
Value
Hyperparameter
Value
Generations
Population
MC Evaluations
CNN Layers
Batchsize
Activation
ReLU
MinAtar Task Evaluation Hyperparameters
Hyperparameter
Value
Hyperparameter
Value
Generations
Population
MC Evaluations
CNN Layers
Linear Layers
Activation
ReLU
Hidden Units
Episode Steps
The MinAtar experiments do not use observation normalization.
A. B ASELINE S ETTINGS & T UNING
Throughout the Brax control neuroevolution experiments, we consider the following baselines:
OpenES (Salimans et al., 2017) using Adam and centered rank fitness transformation.
PGPE (Sehnke et al., 2010) using Adam and centered rank fitness transformation.
ASEBO (Choromanski et al., 2019) using Adam and z-scored fitness transformation.
SNES (Wierstra et al., 2014) using the default rank-based fitness transformation.
sep-CMA-ES (Ros & Hansen, 2008) using an elite ratio of 0.5.
We tuned the initial search scale σ 0 for all baselines and LES by running a grid search over σ 0 ∈ [0 . 05 , 0 . 2] .
We repeat this exercise for all individual environments.
Furthermore, we tuned the learning rate for OpenES (0.05), PGPE (0.02) and ASEBO (0.01) on the Brax ant environment and using a population size of 256.
For OpenES we exponentially decay σ to a minimal value of 0.
using a decay constant of 0.999.
For ASEBO the decay rate is set to γ = 0 .
99 , l = 150 and for better comparability we sample full populations instead of a dynamically adjusting the population size.
For PGPE the learning rate for σ is set to 0.1 and maximal relative change of σ is constrained to 20 percent.
For the computer vision tasks we again tune the initial scale by running a grid search over σ 0 ∈ [0 . 05 , 0 . 2] for each task.
The learning rates are fixed as follows: PGPE (0.01), OpenES (0.01),
ASEBO (0.01).
Finally, for the MinAtar experiments (Figure 19) we only consider PGPE and
OpenES as baselines and tune both their learning rate ( α ∈ [0 . 005 , 0 . 0075 , 0 . 01 , 0 . 02 , 0 .
03 , 0 . 04] ) and initial scale ( σ 0 ∈ [0 .
125 , 0 . 15] ) by running a grid search.
Note that LES only has a single hyperparameter σ 0 and is fairly robust to its choice (see SI A.10.4).
A. S OFTWARE
This project has been made possible by the usage of freely available Open Source software.
This includes the following:
• NumPy: Harris et al.
(2020) • Matplotlib: Hunter (2007) • Seaborn: Waskom (2021) • JAX: Bradbury et al.
• Evosax: Lange (2022a)
• Gymnax: Lange (2022b)
• Evojax: Tang et al.
Brax: Freeman et al.
A.
C OMPUTE R EQUIREMENTS
All experiments (both meta-training and evaluation on Brax) were implemented using JAX for parallel rollout evaluations.
The simulations were run on individual NVIDIA V100 GPUs.
Each
MetaBBO meta-training run for 1500 meta-generations takes ca.
1 hour.
The Brax evaluations require between 30 minutes (hopper, reacher, walker, fetch, ur5e) and 2 hours (ant, humanoid, halfcheetah).
The computer vision evaluation experiments take ca.
10 minutes and the MinAtar experiments last for ca.
35 minutes on a V100.
[Figure]
[Figure] [Figure]
[Figure]
S
[Figure]
OBUSTNESS
[Figure]
[Figure] [Figure]