A tight runtime analysis for the ( + ) EA
From MaRDI portal
Publication:2661996
Recommendations
- A tight runtime analysis for the (1+(,)) GA on LeadingOnes
- Optimizing linear functions with the \((1 + \lambda)\) evolutionary algorithm -- different asymptotic runtimes for different instances
- On the analysis of the \((1+1)\) evolutionary algorithm
- The choice of the offspring population size in the \((1,\lambda)\) evolutionary algorithm
- Optimal mutation rates for the (1+) EA on OneMax through asymptotically tight drift analysis
Cites work
- A computational view of population genetics
- A Remark on Stirling's Formula
- A study of drift analysis for estimating computation time of evolutionary algorithms
- Adaptive drift analysis
- An elementary analysis of the probability that a binomial random variable exceeds its expectation
- Black-box search by unbiased variation
- Crossover can provably be useful in evolutionary computation
- Drift analysis and average time complexity of evolutionary algorithms
- From black-box complexity to designing new genetic algorithms
- scientific article; zbMATH DE number 1754585 (Why is no real title available?)
- Multiplicative drift analysis
- On benefits and drawbacks of aging strategies for randomized search heuristics
- On the analysis of the \((1+1)\) evolutionary algorithm
- Optimal parameter choices via precise black-box analysis
- Optimal static and self-adjusting parameter choices for the (1+( , )) genetic algorithm
- Optimizing linear functions with the \((1 + \lambda)\) evolutionary algorithm -- different asymptotic runtimes for different instances
- Population size versus runtime of a simple evolutionary algorithm
- Robustness of populations in stochastic environments
- Runtime analysis of non-elitist populations: from classical optimisation to partial information
- The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate
- The choice of the offspring population size in the \((1,\lambda)\) evolutionary algorithm
- The impact of parametrization in memetic evolutionary algorithms
- The interplay of population size and mutation probability in the (1+ ) EA on OneMax
- Theory of evolutionary computation. Recent developments in discrete optimization
- Tight bounds on the optimization time of a randomized search heuristic on linear functions
- Tight lower bound on the probability of a binomial exceeding its expectation
Cited in
(15)- A rigorous runtime analysis of the \((1 + (\lambda, \lambda))\) GA on jump functions
- Tight bounds on the expected runtime of a standard steady state genetic algorithm
- Does comma selection help to cope with local optima?
- Runtime analysis of evolutionary algorithms via symmetry arguments
- Runtime analysis of the ( + 1)-EA on the dynamic BinVal function
- On the runtime analysis of the simple genetic algorithm
- The choice of the offspring population size in the \((1,\lambda)\) evolutionary algorithm
- Runtime analysis of \((1+1)\) evolutionary algorithm controlled with Q-learning using greedy exploration strategy on \textsc{OneMax+ZeroMax} problem
- Sharp bounds on the runtime of the (1+1) EA via drift analysis and analytic combinatorial tools
- A tight runtime analysis for the (1+(,)) GA on LeadingOnes
- Choosing the right algorithm with hints from complexity theory
- Lazy parameter tuning and control: choosing all parameters randomly from a power-law distribution
- Runtime analysis of evolutionary neural architecture search for binary classification
- Improved time complexity analysis of the simple genetic algorithm
- Runtime analysis of the (1+1) EA on computing unique input output sequences
This page was built for publication: A tight runtime analysis for the \((\mu + \lambda)\) EA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2661996)
