TL;DR
This paper introduces a unifying framework for Quality-Diversity optimization algorithms, proposes a novel selection mechanism, and presents a new collection management method, all supported by extensive experiments.
Contribution
It unifies existing algorithms, introduces a superior selection mechanism, and overcomes collection erosion issues in Quality-Diversity optimization.
Findings
The new framework encompasses main Quality-Diversity algorithms.
The proposed selection mechanism outperforms existing methods.
The new collection management prevents erosion in unstructured collections.
Abstract
The optimization of functions to find the best solution according to one or several objectives has a central role in many engineering and research fields. Recently, a new family of optimization algorithms, named Quality-Diversity optimization, has been introduced, and contrasts with classic algorithms. Instead of searching for a single solution, Quality-Diversity algorithms are searching for a large collection of both diverse and high-performing solutions. The role of this collection is to cover the range of possible solution types as much as possible, and to contain the best solution for each type. The contribution of this paper is threefold. Firstly, we present a unifying framework of Quality-Diversity optimization algorithms that covers the two main algorithms of this family (Multi-dimensional Archive of Phenotypic Elites and the Novelty Search with Local Competition), and that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
