Analysis and Optimization of Probabilities of Beneficial Mutation and Crossover Recombination in a Hamming Space
Roman V. Belavkin

TL;DR
This paper analyzes the probabilities of beneficial mutations and crossover recombination in a Hamming space, deriving optimal parameters and highlighting their different roles in evolutionary search processes.
Contribution
It provides closed-form expressions for transition probabilities and optimality conditions for mutation and crossover in a Hamming space, advancing understanding of their roles in evolution.
Findings
Optimal mutation radius decreases near the optimum.
Crossover probabilities are balanced and invariant, complementing mutation.
Mutation slows down near the optimum, while crossover can boost evolution.
Abstract
Inspired by Fisher's geometric approach to study beneficial mutations, we analyse probabilities of beneficial mutation and crossover recombination of strings in a general Hamming space with arbitrary finite alphabet. Mutations and recombinations that reduce the distance to an optimum are considered as beneficial. Geometric and combinatorial analysis is used to derive closed-form expressions for transition probabilities between spheres around an optimum giving a complete description of Markov evolution of distances from an optimum over multiple generations. This paves the way for optimization of parameters of mutation and recombination operators. Here we derive optimality conditions for mutation and recombination radii maximizing the probabilities of mutation and crossover into the optimum. The analysis highlights important differences between these evolutionary operators. While mutation…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDNA and Biological Computing
