A Crossover That Matches Diverse Parents Together in Evolutionary Algorithms

• URL: http://arxiv.org/abs/2105.03680v1
• Date: Sat, 8 May 2021 11:43:26 GMT
• Title: A Crossover That Matches Diverse Parents Together in Evolutionary Algorithms
• Authors: Maciej \'Swiechowski
• Abstract summary: The problem of choice is evolutionary decision tree construction. We propose a new method of performing the crossover phase. One variant emerges clearly as the best approach, whereas the remaining ones are below the baseline.
• Score: 0.228438857884398
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Crossover and mutation are the two main operators that lead to new solutions in evolutionary approaches. In this article, a new method of performing the crossover phase is presented. The problem of choice is evolutionary decision tree construction. The method aims at finding such individuals that together complement each other. Hence we say that they are diversely specialized. We propose the way of calculating the so-called complementary fitness. In several empirical experiments, we evaluate the efficacy of the method proposed in four variants and compare it to a fitness-rank-based approach. One variant emerges clearly as the best approach, whereas the remaining ones are below the baseline.

Related papers

• Diversity-Preserving Exploitation of Crossover [0.0]
  We introduce a new paradigm for utilizing crossover that reduces this antagonism, which we call diversity-preserving exploitation of crossover (DiPEC)<n>The resulting Diversity Exploitation Genetic Algorithm (DEGA) is able to still exploit the benefits of crossover, but preserves a much higher diversity than conventional approaches.
  arXiv  Detail & Related papers  (2025-07-02T09:28:06Z)
• Enhanced Multi-Scale Cross-Attention for Person Image Generation [140.90068397518655]
  We propose a novel cross-attention-based generative adversarial network (GAN) for the challenging person image generation task. Cross-attention is a novel and intuitive multi-modal fusion method in which an attention/correlation matrix is calculated between two feature maps of different modalities. We introduce a novel densely connected co-attention module to fuse appearance and shape features at different stages effectively.
  arXiv  Detail & Related papers  (2025-01-15T16:08:25Z)
• Adaptive Differential Evolution with Diversification: Addressing Optimization Challenges [0.0]
  ADED distinguishes itself with its adaptive diverse approach, which includes adaptive mutation and Z-rates, diverse mutation tactics, diversification mechanisms, and monitoring scenarios.
  arXiv  Detail & Related papers  (2023-12-22T06:33:56Z)
• Plan, Verify and Switch: Integrated Reasoning with Diverse X-of-Thoughts [65.15322403136238]
  We propose XoT, an integrated problem solving framework by prompting LLMs with diverse reasoning thoughts. For each question, XoT always begins with selecting the most suitable method then executes each method iteratively. Within each iteration, XoT actively checks the validity of the generated answer and incorporates the feedback from external executors.
  arXiv  Detail & Related papers  (2023-10-23T07:02:20Z)
• Directed differential equation discovery using modified mutation and cross-over operators [77.34726150561087]
  We introduce the modifications that can be introduced into the evolutionary operators of the equation discovery algorithm. The resulting approach, dubbed directed equation discovery, demonstrates a greater ability to converge towards accurate solutions.
  arXiv  Detail & Related papers  (2023-08-09T14:50:02Z)
• Phylogeny-informed fitness estimation [58.720142291102135]
  We propose phylogeny-informed fitness estimation, which exploits a population's phylogeny to estimate fitness evaluations. Our results indicate that phylogeny-informed fitness estimation can mitigate the drawbacks of down-sampled lexicase. This work serves as an initial step toward improving evolutionary algorithms by exploiting runtime phylogenetic analysis.
  arXiv  Detail & Related papers  (2023-06-06T19:05:01Z)
• Langevin Diffusion Variational Inference [38.73307745906571]
  We give a single analysis that unifies and generalizes existing techniques. The main idea is to augment the target and variational by numerically simulating the underdamped Langevin diffusion process. We propose a new method that combines the strengths of previously existing algorithms.
  arXiv  Detail & Related papers  (2022-08-16T13:33:19Z)
• Multivariate feature ranking of gene expression data [62.997667081978825]
  We propose two new multivariate feature ranking methods based on pairwise correlation and pairwise consistency. We statistically prove that the proposed methods outperform the state of the art feature ranking methods Clustering Variation, Chi Squared, Correlation, Information Gain, ReliefF and Significance.
  arXiv  Detail & Related papers  (2021-11-03T17:19:53Z)
• cMLSGA: A Co-Evolutionary Multi-Level Selection Genetic Algorithm for Multi-Objective Optimization [0.0]
  Multi-Level Selection Genetic Algorithm (MLSGA) already shows good performance on range of problems. This paper proposes a distinct set of co-evolutionary mechanisms, which defines co-evolution as competition between collectives rather than individuals.
  arXiv  Detail & Related papers  (2021-04-22T13:52:21Z)
• UnitedQA: A Hybrid Approach for Open Domain Question Answering [70.54286377610953]
  We apply novel techniques to enhance both extractive and generative readers built upon recent pretrained neural language models. Our approach outperforms previous state-of-the-art models by 3.3 and 2.7 points in exact match on NaturalQuestions and TriviaQA respectively.
  arXiv  Detail & Related papers  (2021-01-01T06:36:16Z)
• Evaluating the impact of different types of crossover and selection methods on the convergence of 0/1 Knapsack using Genetic Algorithm [0.0]
  Genetic Algorithm is an evolutionary algorithm and a metaheuristic that was introduced to overcome the failure of gradient based method in solving the optimization and search problems. Our results indicate that convergence rate of combination of one point crossover with tournament selection, with respect to 0/1 knapsack problem that we considered, is the highest and thereby most efficient in solving 0/1 knapsack.
  arXiv  Detail & Related papers  (2020-10-07T15:36:33Z)
• There and Back Again: Revisiting Backpropagation Saliency Methods [87.40330595283969]
  Saliency methods seek to explain the predictions of a model by producing an importance map across each input sample. A popular class of such methods is based on backpropagating a signal and analyzing the resulting gradient. We propose a single framework under which several such methods can be unified.
  arXiv  Detail & Related papers  (2020-04-06T17:58:08Z)
• Differential Evolution with Reversible Linear Transformations [8.873449722727026]
  We propose to generate new candidate solutions by utilizing reversible linear transformation applied to a triplet of solutions from the population. In other words, the population is enlarged by using newly generated individuals without evaluating their fitness.
  arXiv  Detail & Related papers  (2020-02-07T16:05:54Z)

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.