How Population Diversity Influences the Efficiency of Crossover
Abstract: Our theoretical understanding of crossover is limited by our ability to analyze how population diversity evolves. In this study, we provide one of the first rigorous analyses of population diversity and optimization time in a setting where large diversity and large population sizes are required to speed up progress. We give a formal and general criterion which amount of diversity is necessary and sufficient to speed up the $(\mu+1)$ Genetic Algorithm on LeadingOnes. We show that the naturally evolving diversity falls short of giving a substantial speed-up for any $\mu=O(\sqrt{n}/\log2 n)$. On the other hand, we show that even for $\mu=2$, if we simply break ties in favor of diversity then this increases diversity so much that optimization is accelerated by a constant factor.
- Doerr, C.: Complexity theory for discrete black-box optimization heuristics. Theory of Evolutionary Computation: Recent Developments in Discrete Optimization pp. 133–212 (2020)
- Rudolph, G.: Convergence Properties of Evolutionary Algorithms. Verlag Dr. Kovǎc (1997)
- Sudholt, D.: The benefits of population diversity in evolutionary algorithms: a survey of rigorous runtime analyses. Theory of evolutionary computation: Recent developments in discrete optimization pp. 359–404 (2020)
- Whitley, D.: Next generation genetic algorithms: a user’s guide and tutorial. Handbook of metaheuristics pp. 245–274 (2019)
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.