A tight runtime analysis for the \((\mu + \lambda)\) EA
From MaRDI portal
Publication:2661996
DOI10.1007/s00453-020-00731-5OpenAlexW3038003360MaRDI QIDQ2661996
Publication date: 8 April 2021
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.11061
Related Items (3)
A rigorous runtime analysis of the \((1 + (\lambda, \lambda))\) GA on jump functions ⋮ Choosing the right algorithm with hints from complexity theory ⋮ Lazy parameter tuning and control: choosing all parameters randomly from a power-law distribution
Cites Work
- Unnamed Item
- Runtime analysis of non-elitist populations: from classical optimisation to partial information
- Robustness of populations in stochastic environments
- Crossover can provably be useful in evolutionary computation
- Optimizing linear functions with the \((1 + \lambda)\) evolutionary algorithm -- different asymptotic runtimes for different instances
- From black-box complexity to designing new genetic algorithms
- On benefits and drawbacks of aging strategies for randomized search heuristics
- The impact of parametrization in memetic evolutionary algorithms
- On the analysis of the \((1+1)\) evolutionary algorithm
- An elementary analysis of the probability that a binomial random variable exceeds its expectation
- The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate
- Optimal static and self-adjusting parameter choices for the \((1+(\lambda ,\lambda ))\) genetic algorithm
- A study of drift analysis for estimating computation time of evolutionary algorithms
- Adaptive drift analysis
- Multiplicative drift analysis
- Black-box search by unbiased variation
- Optimal parameter choices via precise black-box analysis
- The choice of the offspring population size in the \((1,\lambda)\) evolutionary algorithm
- The interplay of population size and mutation probability in the \((1+\lambda )\) EA on OneMax
- Analyzing randomized search heuristics via stochastic domination
- Tight lower bound on the probability of a binomial exceeding its expectation
- Population size versus runtime of a simple evolutionary algorithm
- A Remark on Stirling's Formula
- A computational view of population genetics
- Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions
- Theory of Evolutionary Computation
- Drift analysis and average time complexity of evolutionary algorithms
This page was built for publication: A tight runtime analysis for the \((\mu + \lambda)\) EA
