Proceedings of the 2020 Genetic and Evolutionary Computation Conference 2020
DOI: 10.1145/3377930.3390232
|View full text |Cite
|
Sign up to set email alerts
|

Covariance matrix adaptation for the rapid illumination of behavior space

Abstract: Quality Diversity (QD) algorithms like Novelty Search with Local Competition (NSLC) and MAP-Elites are a new class of populationbased stochastic algorithms designed to generate a diverse collection of quality solutions. Meanwhile, variants of the Covariance Matrix Adaptation Evolution Strategy (CMA-ES) are among the best-performing derivative-free optimizers in single-objective continuous domains. This paper proposes a new QD algorithm called Covariance Matrix Adaptation MAP-Elites (CMA-ME). Our new algorithm … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

3
85
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 86 publications
(88 citation statements)
references
References 49 publications
3
85
0
Order By: Relevance
“…This divergent search methodology may cause inefficiencies or failure to learn. Even in problems where only a few parameters are optimized, the GA variation causes a slow convergence [20]. In problems that require behaviors to be encoded by DNNs with a large number of parameters, MAP-Elites with a GA variation typically fails to find the locally optimal behaviors due to a lack of directed search power [7].…”
Section: Map-elites Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…This divergent search methodology may cause inefficiencies or failure to learn. Even in problems where only a few parameters are optimized, the GA variation causes a slow convergence [20]. In problems that require behaviors to be encoded by DNNs with a large number of parameters, MAP-Elites with a GA variation typically fails to find the locally optimal behaviors due to a lack of directed search power [7].…”
Section: Map-elites Algorithmmentioning
confidence: 99%
“…Typically the number of optimized parameters is kept below 100 [13,15,40]. GAs are also inefficient [12,20] and prone to finding unstable solutions located on narrow peaks in the optimization landscape that are not repeatable in stochastic environments [14,19,25].…”
mentioning
confidence: 99%
“…Most interestingly, this approach avoids the need to encode all the requirements in the fitness function, which is required when using traditional optimization algorithms. So far, promising results have been published for designing three-dimensional shapes of aerodynamic bikes (Gaier et al, 2018) ( Figure 2C), to generate content for different games (Fontaine et al, 2020;Gravina et al, 2019), to design molecules (Verhellen and Van den Abeele, 2020), to solve workforce scheduling and routing problems (Urquhart and Hart, 2018), and to find adversarial examples for deep neural networks (Nguyen et al, 2015) or malware (Babaagba et al, 2020).…”
Section: Ll Open Accessmentioning
confidence: 99%
“…Thus, some MAP-Elites variation skip the grid architecture and focus on reducing the amount of feature dimensions or enabling the use of higher dimensions such as Centroidal Voronoi Tessellation-MAP-Elites [98] or Cluster-Elites [99]. Further, the Covariance Matrix Adaptation MAP-Elites algorithm combines the effective adaptive search of Covariance Matrix Adaptation Evolution Strategy with a map of elites, yielding large improvements for real-valued representations in terms of both objective value and number of elites discovered [100]. The work by Fontaine et al was expanded into the Multi-Emitter MAP-Elites, improving the quality, diversity, and convergence speed of MAP-Elites in general [101].…”
Section: One Major Challenge With Map-elites Is the Curse Of Dimensiomentioning
confidence: 99%
“…However, their distinction is mainly on the individuals' encoding, i.e., how each individual or solution is internally represented, which also limits what variant operators can be applied. For instance, Genetic Algorithms use genes encoded as finite strings, while Evolution Strategies' individuals are represented as real-valued vectors where approaches such as Covariance Matrix Adaptation could be applied [100]. Genetic algorithms are used for the work presented in this thesis.…”
Section: Evolutionary Computationmentioning
confidence: 99%