Dominated Novelty Search: Rethinking Local Competition in Quality-Diversity
Preprint
Abstract
Quality-Diversity is a family of evolutionary algorithms that generate diverse, high-performing solutions through local competition principles inspired by natural evolution. While research has focused on improving specific aspects of Quality-Diversity algorithms, surprisingly little attention has been paid to investigating alternative formulations of local competition itself -- the core mechanism distinguishing Quality-Diversity from traditional evolutionary algorithms. Most approaches implement local competition through explicit collection mechanisms like fixed grids or unstructured archives, imposing artificial constraints that require predefined bounds or hard-to-tune parameters. We show that Quality-Diversity methods can be reformulated as Genetic Algorithms where local competition occurs through fitness transformations rather than explicit collection mechanisms. Building on this insight, we introduce Dominated Novelty Search, a Quality-Diversity algorithm that implements local competition through dynamic fitness transformations, eliminating the need for predefined bounds or parameters. Our experiments show that Dominated Novelty Search significantly outperforms existing approaches across standard Quality-Diversity benchmarks, while maintaining its advantage in challenging scenarios like high-dimensional and unsupervised spaces.Keywords
All Related Versions
This publication has 17 references indexed in Scilit:
- Uncertain Quality-Diversity: Evaluation Methodology and New Methods for Quality-Diversity in Uncertain DomainsIEEE Transactions on Evolutionary Computation, 2023
- Unsupervised Behavior Discovery With Quality-Diversity OptimizationIEEE Transactions on Evolutionary Computation, 2022
- Autonomous skill discovery with quality-diversity and unsupervised descriptors2019
- Using Centroidal Voronoi Tessellations to Scale Up the Multidimensional Archive of Phenotypic Elites AlgorithmIEEE Transactions on Evolutionary Computation, 2017
- A comparison of illumination algorithms in unbounded spaces2017
- Quality and Diversity Optimization: A Unifying Modular FrameworkIEEE Transactions on Evolutionary Computation, 2017
- Solving Uncompromising Problems With Lexicase SelectionIEEE Transactions on Evolutionary Computation, 2014
- Evolving a diversity of virtual creatures through novelty search and local competition2011
- ALPS2006
- A fast and elitist multiobjective genetic algorithm: NSGA-IIIEEE Transactions on Evolutionary Computation, 2002