Optimal parameter choices via precise black-box analysis
From MaRDI portal
Publication:2007714
DOI10.1016/j.tcs.2019.06.014zbMath1436.68408arXiv1807.03403OpenAlexW2955805227WikidataQ127581054 ScholiaQ127581054MaRDI QIDQ2007714
Jing Yang, Benjamin Doerr, Carola Doerr
Publication date: 22 November 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.03403
Analysis of algorithms (68W40) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50)
Related Items
Tail bounds on hitting times of randomized search heuristics using variable drift analysis ⋮ Fixed-target runtime analysis ⋮ Runtime analysis for self-adaptive mutation rates ⋮ A tight runtime analysis for the \((\mu + \lambda)\) EA ⋮ On the impact of the performance metric on efficient algorithm configuration ⋮ Automated Reinforcement Learning (AutoRL): A Survey and Open Problems ⋮ Analyzing randomized search heuristics via stochastic domination ⋮ Self-adjusting population sizes for the (1,\( \lambda )\)-EA on monotone functions ⋮ A new taxonomy of global optimization algorithms ⋮ OneMax is not the easiest function for fitness improvements ⋮ Choosing the right algorithm with hints from complexity theory ⋮ Lower bounds from fitness levels made easy ⋮ Self-adjusting population sizes for non-elitist evolutionary algorithms: why success rates matter ⋮ On the benefits of populations for the exploitation speed of standard steady-state genetic algorithms ⋮ 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 ⋮ Static and self-adjusting mutation strengths for multi-valued decision variables
Cites Work
- The impact of random initialization on the runtime of randomized search heuristics
- From black-box complexity to designing new genetic algorithms
- Ranking-based black-box complexity
- Lower bounds for comparison based evolution strategies using VC-dimension and sign patterns
- Memory-restricted black-box complexity of OneMax
- On the analysis of the \((1+1)\) evolutionary algorithm
- 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
- A study of drift analysis for estimating computation time of evolutionary algorithms
- Black-box complexities of combinatorial problems
- Multiplicative drift analysis
- Black-box search by unbiased variation
- Performance analysis of randomised search heuristics operating with a fixed budget
- The interplay of population size and mutation probability in the \((1+\lambda )\) EA on OneMax
- Analyzing randomized search heuristics via stochastic domination
- Upper and lower bounds for randomized search heuristics in black-box optimization
- Weighted sums of certain dependent random variables
- Drift Analysis and Evolutionary Algorithms Revisited
- 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
- Computing single source shortest paths using single-objective fitness
- Probability Inequalities for Sums of Bounded Random Variables
This page was built for publication: Optimal parameter choices via precise black-box analysis
