Self-adjusting mutation rates with provably optimal success rules

DOI10.1007/s00453-021-00854-3OpenAlexW3197417694MaRDI QIDQ2240130

Carola Doerr, Benjamin Doerr, Johannes Lengler

Publication date: 5 November 2021

Published in: Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

evolutionary computationruntime analysisrandomized search heuristicsparameter control

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Related Items (5)

Self-adjusting population sizes for the (1,\( \lambda )\)-EA on monotone functions ⋮ First Steps Towards a Runtime Analysis of Neuroevolution ⋮ OneMax is not the easiest function for fitness improvements ⋮ More precise runtime analyses of non-elitist evolutionary algorithms in uncertain environments ⋮ Self-adjusting population sizes for non-elitist evolutionary algorithms: why success rates matter

Cites Work

• Unnamed Item
• Analyzing bandit-based adaptive operator selection mechanisms
• Optimal static and self-adjusting parameter choices for the \((1+(\lambda ,\lambda ))\) genetic algorithm
• Learning probability distributions in continuous evolutionary algorithms -- a comparative review
• Multiplicative drift analysis
• Black-box search by unbiased variation
• Analyzing randomized search heuristics via stochastic domination
• Runtime analysis for self-adaptive mutation rates
• Theory of Evolutionary Computation
• Adaptive population models for offspring populations and parallel evolutionary algorithms

This page was built for publication: Self-adjusting mutation rates with provably optimal success rules