Quality-diversity optimization: a novel branch of stochastic optimization
File(s)2012.04322v2.pdf (3.46 MB)
Accepted version
Author(s)
Chatzilygeroudis, Konstantinos
Cully, Antoine
Vassiliades, Vassilis
Mouret, Jean-Baptiste
Type
Chapter
Abstract
Traditional optimization algorithms search for a single global optimum that maximizes (or minimizes) the objective function. Multimodal optimization algorithms search for the highest peaks in the search space that can be more than one. Quality-Diversity algorithms are a recent addition to the evolutionary computation toolbox that do not only search for a single set of local optima, but instead try to illuminate the search space. In effect, they provide a holistic view of how high-performing solutions are distributed throughout a search space. The main differences with multimodal optimization algorithms are that (1) Quality-Diversity typically works in the behavioral space (or feature space), and not in the genotypic (or parameter) space, and (2) Quality-Diversity attempts to fill the whole behavior space, even if the niche is not a peak in the fitness landscape. In this chapter, we provide a gentle introduction to Quality-Diversity optimization, discuss the main representative algorithms, and the main current topics under consideration in the community. Throughout the chapter, we also discuss several successful applications of Quality-Diversity algorithms, including deep learning, robotics, and reinforcement learning.
Editor(s)
Pardalos, Panos
Rasskazova, Varvara
Vrahatis, Michael
Date Issued
2021-01-04
Citation
Black Box Optimization, Machine Learning, and No-Free Lunch Theorems, 2021, pp.109-135
ISBN
978-3-030-66515-9
Publisher
Springer International Publishing
Start Page
109
End Page
135
Journal / Book Title
Black Box Optimization, Machine Learning, and No-Free Lunch Theorems
Copyright Statement
© 2021 Springer Nature Switzerland AG. The final publication is available at Springer via https://doi.org/10.1007/978-3-030-66515-9_4
Identifier
https://link.springer.com/chapter/10.1007/978-3-030-66515-9_4
Subjects
cs.NE
cs.NE
cs.LG
math.OC
stat.ML
Publication Status
Published
Date Publish Online
2021-01-04