paper-with-me

Papers

Discrete Gene Crossover Accelerates Solution Discovery in Quality-Diversity Algorithms

2026-02-14 · Joshua Hutchinson, J. Michael Herrmann, Simón C. Smith arxiv

Quality-Diversity (QD) algorithms aim to discover diverse, high-performing solutions across behavioral niches. However, QD search often stagnates as incremental variation operators struggle to propagate building blocks across large populations. Existing mutation operators rely on gradual variation to solutions, limiting their ability to efficiently explore regions of the search space distant from parent solutions or to spread beneficial genetic material through the population. We propose a mutation operator which augments variation-based operators with discrete, gene-level crossover, enabling rapid recombination of elite genetic material. This crossover mechanism mirrors the biological principle of meiosis and facilitates both the direct transfer of genetic material and the exploration of novel genotype configurations beyond the existing elite hypervolume. We evaluate operators on three locomotion environments, demonstrating improvements in QD score, coverage, and max fitness, with particularly strong performance in later stages of optimization once building blocks have been established in the archive. These results show that the addition of a discrete crossover mutation provides a complementary exploration mechanism that sustains quality-diversity growth beyond the performance demonstrated by existing operators.

📄 PDF Abstract BibTeX arXiv:2602.13730

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Tip the Balance: Improving Exploration of Balanced Crossover Operators by Adaptive Bias

2020-04-23 · Luca Manzoni, Luca Mariot, Eva Tuba

The use of balanced crossover operators in Genetic Algorithms (GA) ensures that the binary strings generated as offsprings have the same Hamming weight of the parents, a constraint which is sought in certain discrete opt…

Improved discrete particle swarm optimization using Bee Algorithm and multi-parent crossover method (Case study: Allocation problem and benchmark functions)

2024-03-15 · Hamed Zibaei, Mohammad Saadi Mesgari

Compared to other techniques, particle swarm optimization is more frequently utilized because of its ease of use and low variability. However, it is complicated to find the best possible solution in the search space in l…

Efficient Evolutionary Search Over Chemical Space with Large Language Models

2024-06-23 · Haorui Wang, Marta Skreta, Cher-Tian Ser, Wenhao Gao 외

Molecular discovery, when formulated as an optimization problem, presents significant computational challenges because optimization objectives can be non-differentiable. Evolutionary Algorithms (EAs), often used to optim…

Drug DesignEvolutionary Algorithms

Digenes: genetic algorithms to discover conjectures about directed and undirected graphs

2013-04-30 · Romain Absil, Hadrien Mélot

We present Digenes, a new discovery system that aims to help researchers in graph theory. While its main task is to find extremal graphs for a given (function of) invariants, it also provides some basic support in proof …

Math

MoCo-EA: Exploiting Adversarial Mode Connectivity for Efficient Evolutionary Attacks

2026-05-18 · Hyo Seo Kim, Gang Luo, Can Chen, Binghui Wang 외 arxiv

Evolutionary algorithms for adversarial attacks leverage population-based search to discover perturbations without gradient information, but suffer from inefficient crossover operations that destroy adversarial propertie…