Discrete Gene Crossover Accelerates Solution Discovery in Quality-Diversity Algorithms

• URL: http://arxiv.org/abs/2602.13730v1
• Date: Sat, 14 Feb 2026 11:44:21 GMT
• Title: Discrete Gene Crossover Accelerates Solution Discovery in Quality-Diversity Algorithms
• Authors: Joshua Hutchinson, J. Michael Herrmann, Simón C. Smith,
• Abstract summary: Quality-Diversity algorithms aim to discover diverse, high-performing solutions across behavioral niches.<n>Existing mutation operators rely on gradual variation to solutions.<n>We propose a mutation operator which augments variation-based operators with discrete, gene-level crossover.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• Evolutionary Router Feature Generation for Zero-Shot Graph Anomaly Detection with Mixture-of-Experts [60.60414602796664]
  We propose a novel MoE framework with evolutionary router feature generation (EvoFG) for zero-shot GAD.<n>EvoFG consistently outperforms state-of-the-art baselines, achieving strong and stable zero-shot GAD performance.
  arXiv  Detail & Related papers  (2026-02-12T06:16:51Z)
• Beyond Independent Genes: Learning Module-Inductive Representations for Gene Perturbation Prediction [48.80217316452559]
  scBIG is a module-inductive prediction framework that explicitly models coordinated gene programs.<n> scBIG consistently outperforms state-of-the-art methods, particularly on unseen and perturbation settings.
  arXiv  Detail & Related papers  (2026-02-03T16:43:40Z)
• TOPSIS-like metaheuristic for LABS problem [70.49434432747293]
  We introduce socio-cognitive mutation mechanisms that integrate strategies of following the best solutions and avoiding the worst.<n>By guiding search agents to imitate high-performing solutions and avoid poor ones, these operators enhance both solution diversity and convergence efficiency.
  arXiv  Detail & Related papers  (2025-11-08T00:47:37Z)
• Enhancing Retrieval Augmentation via Adversarial Collaboration [50.117273835877334]
  We propose the Adrial Collaboration RAG (AC-RAG) framework to address "Retrieval Hallucinations"<n>AC-RAG employs two heterogeneous agents: a generalist Detector that identifies knowledge gaps, and a domain-specialized Resolver that provides precise solutions.<n>Experiments show that AC-RAG significantly improves retrieval accuracy and outperforms state-of-the-art RAG methods across various vertical domains.
  arXiv  Detail & Related papers  (2025-09-18T08:54:20Z)
• The Pitfalls and Potentials of Adding Gene-invariance to Optimal Mixing [0.0]
  Optimal Mixing (OM) is a variation operator that integrates local search with genetic recombination.<n>We propose a solution inspired by the Gene Invariant Genetic Algorithm (GIGA), which preserves gene frequencies in the population throughout the process.<n>This technique is tailored to and integrated with the Gene-pool Optimal Mixing Evolutionary Algorithm (GOMEA), resulting in GI-GOMEA.
  arXiv  Detail & Related papers  (2025-06-18T08:06:44Z)
• Adversarial Coevolutionary Illumination with Generational Adversarial MAP-Elites [3.4524024382493774]
  Quality-Diversity (QD) algorithms seek to discover diverse, high-performing solutions across a behavior space.<n>We present Generational Adversarial MAP-Elites (GAME), a coevolutionary QD algorithm that evolves both sides by alternating which side is evolved at each generation.
  arXiv  Detail & Related papers  (2025-05-10T12:00:48Z)
• Accelerating Evolution: Integrating PSO Principles into Real-Coded Genetic Algorithm Crossover [2.854482269849925]
  This study introduces an innovative crossover operator named Particle Swarm Optimization-inspired Crossover (PSOX)<n>PSOX uniquely incorporates guidance from both the current global best solution and historical optimal solutions across multiple generations.<n>This novel mechanism enables the algorithm to maintain population diversity while simultaneously accelerating convergence toward promising regions of the search space.
  arXiv  Detail & Related papers  (2025-05-06T06:17:57Z)
• UniGenX: a unified generative foundation model that couples sequence, structure and function to accelerate scientific design across proteins, molecules and materials [62.72989417755985]
  We present UniGenX, a unified generative model for function in natural systems.<n>UniGenX represents heterogeneous inputs as a mixed stream of symbolic and numeric tokens.<n>It achieves state-of-the-art or competitive performance for the function-aware generation across domains.
  arXiv  Detail & Related papers  (2025-03-09T16:43:07Z)
• Predicting Genetic Mutation from Whole Slide Images via Biomedical-Linguistic Knowledge Enhanced Multi-label Classification [119.13058298388101]
  We develop a Biological-knowledge enhanced PathGenomic multi-label Transformer to improve genetic mutation prediction performances. BPGT first establishes a novel gene encoder that constructs gene priors by two carefully designed modules. BPGT then designs a label decoder that finally performs genetic mutation prediction by two tailored modules.
  arXiv  Detail & Related papers  (2024-06-05T06:42:27Z)
• IE-GAN: An Improved Evolutionary Generative Adversarial Network Using a New Fitness Function and a Generic Crossover Operator [20.100388977505002]
  We propose an improved E-GAN framework called IE-GAN, which introduces a new fitness function and a generic crossover operator. In particular, the proposed fitness function can model the evolutionary process of individuals more accurately. The crossover operator, which has been commonly adopted in evolutionary algorithms, can enable offspring to imitate the superior gene expression of their parents.
  arXiv  Detail & Related papers  (2021-07-25T13:55:07Z)
• Analysis of Evolutionary Diversity Optimisation for Permutation Problems [17.268191781480745]
  Investigation on evolutionary diversity optimization for three of the most well-studied permutation problems. Results show many mutation operators for these problems guarantee convergence to maximally diverse populations. Experiments are carried out on QAPLIB and synthetic instances in unconstrained and constrained settings.
  arXiv  Detail & Related papers  (2021-02-23T03:13:26Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.