Self-adjusting population sizes for the (1,\( \lambda )\)-EA on monotone functions

DOI10.1016/j.tcs.2023.114181arXiv2204.00531OpenAlexW4386865336MaRDI QIDQ6057833

Maxime Larcher, Xun Zou, Marc Kaufmann, Johannes Lengler

Publication date: 26 October 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2204.00531

zbMATH Keywords

evolutionary algorithmmonotone functionsdynamic environmentsparameter controlself-adaption\((1, \lambda)\)-EAone-fifth rule

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items

Self-adjusting population sizes for the (1,\( \lambda )\)-EA on monotone functions ⋮ OneMax is not the easiest function for fitness improvements ⋮ Self-adjusting population sizes for non-elitist evolutionary algorithms: why success rates matter

Cites Work

• Concentration of first hitting times under additive drift
• Optimizing linear functions with the \((1 + \lambda)\) evolutionary algorithm -- different asymptotic runtimes for different instances
• From black-box complexity to designing new genetic algorithms
• Improved time complexity analysis of the simple genetic algorithm
• The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate
• Optimal static and self-adjusting parameter choices for the \((1+(\lambda ,\lambda ))\) genetic algorithm
• Static and self-adjusting mutation strengths for multi-valued decision variables
• Learning probability distributions in continuous evolutionary algorithms -- a comparative review
• Multiplicative drift analysis
• Black-box search by unbiased variation
• Optimal parameter choices via precise black-box analysis
• Exponential slowdown for larger populations: the \(( \mu + 1)\)-EA on monotone functions
• Runtime analysis of the \((\mu + 1)\)-EA on the dynamic BinVal function
• Self-adjusting mutation rates with provably optimal success rules
• The choice of the offspring population size in the \((1,\lambda)\) evolutionary algorithm
• Runtime analysis for self-adaptive mutation rates
• Drift Analysis and Evolutionary Algorithms Revisited
• Percolation
• When Does Hillclimbing Fail on Monotone Functions: An entropy compression argument
• Adaptive population models for offspring populations and parallel evolutionary algorithms
• On the Brittleness of Evolutionary Algorithms
• Self-adjusting population sizes for the (1,\( \lambda )\)-EA on monotone functions