Runtime analysis for self-adaptive mutation rates
From MaRDI portal
Publication:2661995
DOI10.1007/S00453-020-00726-2OpenAlexW3034476226MaRDI QIDQ2661995FDOQ2661995
Authors: Benjamin Doerr, Carsten Witt, Jing Yang 
Publication date: 8 April 2021
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.12824
Recommendations
- The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate
- Optimal mutation rates for the \((1+\lambda)\) EA on OneMax through asymptotically tight drift analysis
- Mutation rate control in the \((1+\lambda)\) evolutionary algorithm with a self-adjusting lower bound
- Adaptive drift analysis
- Self-adjusting mutation rates with provably optimal success rules
Cites Work
- A Remark on Stirling's Formula
- Title not available (Why is that?)
- Tuning metaheuristics. A machine learning Perspective
- Adaptive drift analysis
- Multiplicative drift analysis
- The choice of the offspring population size in the \((1,\lambda)\) evolutionary algorithm
- Concentrated hitting times of randomized search heuristics with variable drift
- Runtime analysis of non-elitist populations: from classical optimisation to partial information
- Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links
- Hitting-time and occupation-time bounds implied by drift analysis with applications
- Tight bounds on the optimization time of a randomized search heuristic on linear functions
- Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
- Analyzing evolutionary algorithms. The computer science perspective.
- Adaptive population models for offspring populations and parallel evolutionary algorithms
- On the analysis of the \((1+1)\) evolutionary algorithm
- Automata, Languages and Programming
- Optimizing linear functions with the \((1 + \lambda)\) evolutionary algorithm -- different asymptotic runtimes for different instances
- Combining Markov-chain analysis and drift analysis. The \((1+1)\) evolutionary algorithm on linear functions reloaded
- On the analysis of a dynamic evolutionary algorithm
- Sharp bounds on the runtime of the (1+1) EA via drift analysis and analytic combinatorial tools
- An elementary analysis of the probability that a binomial random variable exceeds its expectation
- Linear multi-objective drift analysis
- The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate
- Optimal static and self-adjusting parameter choices for the \((1+(\lambda ,\lambda ))\) genetic algorithm
- Optimal parameter choices via precise black-box analysis
- The interplay of population size and mutation probability in the \((1+\lambda )\) EA on OneMax
- Black-box Complexity of Parallel Search with Distributed Populations
- (1+1) EA on Generalized Dynamic OneMax
- Static and self-adjusting mutation strengths for multi-valued decision variables
- Theory of evolutionary computation. Recent developments in discrete optimization
Cited In (25)
- Adaptive population models for offspring populations and parallel evolutionary algorithms
- The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate
- Optimal static and self-adjusting parameter choices for the \((1+(\lambda ,\lambda ))\) genetic algorithm
- Optimal mutation rates for the \((1+\lambda)\) EA on OneMax through asymptotically tight drift analysis
- Optimal parameter choices via precise black-box analysis
- OneMax is not the easiest function for fitness improvements
- A tight runtime analysis for the \((1+(\lambda,\lambda))\) GA on LeadingOnes
- The interplay of population size and mutation probability in the \((1+\lambda )\) EA on OneMax
- Towards a runtime comparison of natural and artificial evolution
- Self-adjusting mutation rates with provably optimal success rules
- Static and self-adjusting mutation strengths for multi-valued decision variables
- Does comma selection help to cope with local optima?
- Choosing the right algorithm with hints from complexity theory
- Self-adjusting population sizes for the (1,\( \lambda )\)-EA on monotone functions
- Lazy parameter tuning and control: choosing all parameters randomly from a power-law distribution
- Self-adjusting population sizes for non-elitist evolutionary algorithms: why success rates matter
- Mutation rate control in the \((1+\lambda)\) evolutionary algorithm with a self-adjusting lower bound
- Self-adjusting evolutionary algorithms for multimodal optimization
- Self-adjusting offspring population sizes outperform fixed parameters on the Cliff function
- Mutative Self-adaptation on the Sharp and Parabolic Ridge
- Stagnation detection meets fast mutation
- Runtime analysis of the \((\mu + 1)\)-EA on the dynamic BinVal function
- Self-adaptation Can Improve the Noise-tolerance of Evolutionary Algorithms
- On the impact of the mutation-selection balance on the runtime of evolutionary algorithms
- The linear hidden subset problem for the \((1 + 1)\) EA with scheduled and adaptive mutation rates
This page was built for publication: Runtime analysis for self-adaptive mutation rates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2661995)
