Optimal mutation rates for the \((1+\lambda)\) EA on OneMax through asymptotically tight drift analysis

DOI10.1007/s00453-017-0360-yzbMath1390.68596OpenAlexW2745977891WikidataQ57200545 ScholiaQ57200545MaRDI QIDQ1750363

Carsten Witt, Christian Gießen

Publication date: 18 May 2018

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://orbit.dtu.dk/en/publications/d2b4e53f-fcb5-43d7-91d7-668e3160e07a

zbMATH Keywords

mutationruntime analysispopulations

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)

Related Items (5)

Tail bounds on hitting times of randomized search heuristics using variable drift analysis ⋮ Lower bounds from fitness levels made easy ⋮ Island models meet rumor spreading ⋮ Optimal mutation rates for the \((1+\lambda)\) EA on OneMax through asymptotically tight drift analysis ⋮ Optimal parameter choices via precise black-box analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Optimizing linear functions with the \((1 + \lambda)\) evolutionary algorithm -- different asymptotic runtimes for different instances
• Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
• Analyzing evolutionary algorithms. The computer science perspective.
• A bound on the Poisson-binomial relative error
• On the analysis of the \((1+1)\) evolutionary algorithm
• Optimal mutation rates for the \((1+\lambda)\) EA on OneMax through asymptotically tight drift analysis
• Adaptive drift analysis
• Optimal parameter choices via precise black-box analysis
• The choice of the offspring population size in the \((1,\lambda)\) evolutionary algorithm
• Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift
• Black-box Complexity of Parallel Search with Distributed Populations
• Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links
• Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions
• The Frequency Distribution of the Difference Between Two Poisson Variates Belonging to Different Populations

This page was built for publication: Optimal mutation rates for the \((1+\lambda)\) EA on OneMax through asymptotically tight drift analysis