Papers › Dominated Novelty Search: Rethinking Local Competition in Quality-Diversity

Dominated Novelty Search: Rethinking Local Competition in Quality-Diversity

1 Feb 2025arXiv:2502.00593archive 2025-07-28

Ryan Bahlous-Boldi, Maxence Faldor, Luca Grillotti, Hannah Janmohamed, Lisa Coiffard, Lee Spector, Antoine Cully

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.

PaperPDFCodeCode Syntology ran

In Syntology View this paper on Syntology: its repositories, every harvested function with whether it ran, its licence and the call to fetch it.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2502.00593")

Code

Syntology Ran 8 of 11 code samples harvested from 1 repository linked to this paper; 3 have no recorded run. Of those that ran: 1 ran · our draft was wrong; 7 ran with no contract checked.

By repository: official repository: 11 samples from 1 repository, 8 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

11 samples harvested; 8 ran; 0 honoured the contract we drafted; 3 have no recorded run. Read from Syntology's graph 2026-09-25; that is when this build read the record, not when the samples ran.

1ran · our draft was wrong
7ran
3unverified

Licence: 0 of the 11 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from adaptive-intelligent-robotics/dominated-novelty-search. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

customize_axis adaptive-intelligent-robotics/dominated-novelty-search/analysis/kheperax_plot.py official repository ran · our draft was wrong MIT (permissive) · 8481ec92f78f7ef9 · report
get_config adaptive-intelligent-robotics/dominated-novelty-search/utils.py official repository ran MIT (permissive) · a8a13ebef20b5baf · report
get_latest_run_for_env_and_pop adaptive-intelligent-robotics/dominated-novelty-search/analysis/plot_scatter.py official repository ran MIT (permissive) · 80c7020f5674e152 · report
get_metrics adaptive-intelligent-robotics/dominated-novelty-search/utils.py official repository ran MIT (permissive) · 895137189de3e4c2 · report
plot_kheperax_maze adaptive-intelligent-robotics/dominated-novelty-search/scatter_plots.py official repository ran MIT (permissive) · e6234ac401c7184b · report
plot_kheperax_maze_arrows adaptive-intelligent-robotics/dominated-novelty-search/scatter_plots.py official repository ran MIT (permissive) · 19a35aabdb3929a9 · report
pretty_env_name adaptive-intelligent-robotics/dominated-novelty-search/analysis/kheperax_plot.py official repository ran fingerprinted MIT (permissive) · 6c79c29340ddec69 · report
pretty_env_name adaptive-intelligent-robotics/dominated-novelty-search/analysis/plot_main.py official repository ran fingerprinted MIT (permissive) · c80cb839cb866e91 · report
get_latest_run_for_env adaptive-intelligent-robotics/dominated-novelty-search/analysis/plot_scatter.py official repository unverified MIT (permissive) · 2d52368b785ffc79 · report
load_data adaptive-intelligent-robotics/dominated-novelty-search/analysis/kheperax_plot.py official repository unverified MIT (permissive) · 6f9be66b0fdc3295 · report
load_data adaptive-intelligent-robotics/dominated-novelty-search/analysis/plot_main.py official repository unverified MIT (permissive) · 99b6de3648e49549 · report

Tasks

DiversityEvolutionary Algorithms

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

AttentionSoftmax

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections