Introducing Elitist Black-Box Models: When Does Elitist Behavior Weaken the Performance of Evolutionary Algorithms?

@article{Doerr2017IntroducingEB,
  title={Introducing Elitist Black-Box Models: When Does Elitist Behavior Weaken the Performance of Evolutionary Algorithms?},
  author={Carola Doerr and Johannes Lengler},
  journal={Evolutionary Computation},
  year={2017},
  volume={25},
  pages={587-606}
}
Black-box complexity theory provides lower bounds for the runtime of black-box optimizers like evolutionary algorithms and other search heuristics and serves as an inspiration for the design of new genetic algorithms. Several black-box models covering different classes of algorithms exist, each highlighting a different aspect of the algorithms under considerations. In this work we add to the existing black-box notions a new elitist black-box model, in which algorithms are required to base all… Expand
Choosing the Right Algorithm With Hints From Complexity Theory
TLDR
This work argues that the purely academic question of what could be the best possible algorithm in a certain broad class of black-box optimizers can give fruitful indications in which direction to search for good established optimization heuristics and shows a remarkably good performance of the Metropolis algorithm. Expand
Parallel Black-Box Complexity With Tail Bounds
TLDR
The main result is a general performance limit: it is proved that on every function, the typical optimization time on unimodal and multimodal problems, for the time to find any local optimum, and for the times to even get close to any optimum are reduced. Expand
Complexity Theory for Discrete Black-Box Optimization Heuristics
TLDR
Running-time analysis is aimed at understanding the performance of a given heuristic on a given problem by bounding the number of function evaluations that are needed by the heuristic to identify a solution of a desired quality. Expand
Analyzing randomized search heuristics via stochastic domination
TLDR
This work argues that stochastic domination is a notion that should be used more frequently in this area, and proves a variant of the fitness level theorem which shows that the runtime of the search heuristic is dominated by a sum of independent geometric random variables. Expand
Better Runtime Guarantees via Stochastic Domination
TLDR
This work argues that stochastic domination is a notion that should be used more frequently in this area of runtime analysis, and proves a fitness level theorem which shows that the runtime is dominated by a sum of independent geometric random variables. Expand
Theory of Iterative Optimization Heuristics: From Black-Box Complexity over Algorithm Design to Parameter Control
TLDR
Improved bounds for the black-box complexity of the two best known benchmark problems in the theory of IOHs, OneMax and LeadingOnes are derived, and it is demonstrated how insights obtained from such black- box complexity studies can inspire the design of efficient optimization techniques. Expand
Maximizing Drift is Not Optimal for Solving OneMax
TLDR
This work proves that drift maximization is not optimal, and shows that for most fitness levels between n/2 and 2n/3 the optimal mutation strengths are larger than the drift-maximizing ones. Expand
Blending Dynamic Programming with Monte Carlo Simulation for Bounding the Running Time of Evolutionary Algorithms
TLDR
The hybrid Monte Carlo dynamic programming approach is applied to a concatenated jump function and it is demonstrated how the obtained bounds can be used to gain a deeper understanding into parameter control schemes. Expand
A General Dichotomy of Evolutionary Algorithms on Monotone Functions
TLDR
All considered mutation-based algorithms show a similar dichotomy for HotTopic functions, or even for all monotone functions, and the range of efficient parameters is not affected by either population size $\mu$ nor by the offspring population size $lambda$. Expand
Parallel Problem Solving from Nature – PPSN XV
TLDR
It is proved that all considered mutation-based algorithms show a similar dichotomy for HotTopic functions, or even for all monotone functions, including (1 + (λ, λ))-GA. Expand
...
1
2
...

References

SHOWING 1-10 OF 39 REFERENCES
Elitist Black-Box Models: Analyzing the Impact of Elitist Selection on the Performance of Evolutionary Algorithms
TLDR
This work proposes a new elitist black-box model, in which algorithms are required to base all decisions solely on (a fixed number of) the best search points sampled so far, and introduces the concept of $p-Monte Carlo black- box complexity, which measures the time it takes to optimize a problem with failure probability at most p. Expand
From black-box complexity to designing new genetic algorithms
TLDR
This work designs a new crossover-based genetic algorithm that uses mutation with a higher-than-usual mutation probability to increase the exploration speed and crossover with the parent to repair losses incurred by the more aggressive mutation. Expand
OneMax in Black-Box Models with Several Restrictions
TLDR
This work shows that the (1+1) memory-restricted ranking-based black-box complexity of OneMax is linear, and provides improved lower bounds for the complexity of the OneMax in the regarded models. Expand
Ranking-Based Black-Box Complexity
TLDR
A ranking-based black-box algorithm is presented that has a runtime of Θ(n/logn), which shows that the OneMax problem does not become harder with the additional ranking- basedness restriction. Expand
Black-Box Search by Unbiased Variation
TLDR
This paper introduces a more restricted black-box model for optimisation of pseudo-Boolean functions which it is claimed captures the working principles of many randomised search heuristics including simulated annealing, evolutionary algorithms, randomised local search, and others. Expand
A New Framework for the Valuation of Algorithms for Black-Box Optimization
TLDR
It can be concluded that randomized search heuristics whose (worst-case) expected optimization time for some problem is close to the black-box complexity of the problem are provably efficient (in theblack-box scenario). Expand
On the Black-Box Complexity of Example Functions: The Real Jump Function
  • T. Jansen
  • Computer Science, Mathematics
  • FOGA
  • 2015
TLDR
It is argued that the problem is not with the notion of black-box complexity but with the extension to a function class and it is shown that for this extension there is a much better agreement even between the performance of an extremely simple evolutionary algorithm and the most general notion ofBlackbox complexity. Expand
Too fast unbiased black-box algorithms
TLDR
This work gives mutation-only unbiased black-box algorithms having complexity O(n log n) for the classical JumpK test function class and for a subclass of the well-known Partition problem. Expand
Unbiased Black-Box Complexity of Parallel Search
TLDR
A new black-box complexity model for search algorithms evaluating λ search points in parallel that captures the inertia caused by offspring populations in evolutionary algorithms and the total computational effort in parallel metaheuristics is proposed. Expand
Black-box search by elimination of fitness functions
TLDR
Though in its early stages, it is believed that there is utility in search methods based on ideas from the elimination of functions method, and that the viewpoint provides promise and new insight about black-box optimization. Expand
...
1
2
3
4
...