Ranking-Based Black-Box Complexity

@article{Doerr2012RankingBasedBC,
  title={Ranking-Based Black-Box Complexity},
  author={Benjamin Doerr and Carola Doerr},
  journal={Algorithmica},
  year={2012},
  volume={68},
  pages={571-609}
}
Randomized search heuristics such as evolutionary algorithms, simulated annealing, and ant colony optimization are a broadly used class of general-purpose algorithms. Analyzing them via classical methods of theoretical computer science is a growing field. While several strong runtime analysis results have appeared in the last 20 years, a powerful complexity theory for such algorithms is yet to be developed. We enrich the existing notions of black-box complexity by the additional restriction… 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
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
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
Introducing Elitist Black-Box Models: When Does Elitist Behavior Weaken the Performance of Evolutionary Algorithms?
TLDR
The elitist model is added, in which algorithms are required to base all decisions solely on (the relative performance of) a fixed number of the best search points sampled so far, and the concept of p-Monte Carlo black-box complexity is introduced, which measures the time it takes to optimize a problem with failure probability at most p. Expand
Optimal parameter choices via precise black-box analysis
TLDR
This work proves that the unary unbiased black-box complexity of the OneMax benchmark function class is n ln ⁡ ( n ) − c n ± o ( n) for a constant c which is between 0.2539 and 0.2665. 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
The $$(1+1)$$(1+1) Elitist Black-Box Complexity of LeadingOnes
TLDR
The permutation- and bit-invariant version of LeadingOnes is regarded and it is proved that its(1+1) elitist black-box complexity is VarOmega (n^2)Ω(n2), a bound that is matched by(1-1)-type evolutionary algorithms, a bound which shows that for LeadingOns the memory-restriction, together with the selection requirement, has a substantial impact on the best possible performance. Expand
OneMax in Black-Box Models with Several Restrictions
TLDR
This work shows that the (μ+λ) elitist memory-restricted ranking-based black-box complexity of OneMax is as small as (an advanced version of) the information-theoretic lower bound, and enlivens the quest for natural evolutionary algorithms optimizing OneMax in o(n log n) iterations. Expand
The unbiased black-box complexity of partition is polynomial
TLDR
For two different formulations of an NP-hard subclass of the well-known PARTITION problem, it is shown that also the unary unbiased black-box complexity does not give a complete picture of the true difficulty of this problem for randomized search heuristics. Expand
The (1+1) Elitist Black-Box Complexity of LeadingOnes
TLDR
The permutation- and bit-invariant version of LeadingOnes is regarded and it is proved that its (1+1) elitist black-box complexity is Ω(n2), a bound that is matched by (1-1)-type evolutionary algorithms. Expand
...
1
2
3
4
...

References

SHOWING 1-10 OF 31 REFERENCES
Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity
TLDR
This work enrichs the two existing black-box complexity notions due to Wegener and other authors by the restrictions that not actual objective values, but only the relative quality of the previously evaluated solutions may be taken into account by the algorithm. 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
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
Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization
TLDR
Lower bounds on the black-box complexity of problems are derived without complexity theoretical assumptions and are compared with upper bounds in this scenario. 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
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
General Lower Bounds for Evolutionary Algorithms
TLDR
It is proved that, at least in some particular cases, using the full ranking information can improve these lower bounds, and ultimately provide superlinear convergence results. Expand
Algorithmics for hard problems - introduction to combinatorial optimization, randomization, approximation, and heuristics
TLDR
This book discusses thoroughly all of the above approaches to attack hard problems in an absolutely fascinating way that can serve as a pattern for theory textbooks with a high level of generality. Expand
New upper and lower bounds for randomized and quantum local search
  • S. Zhang
  • Mathematics, Computer Science
  • STOC '06
  • 2006
TLDR
A new quantum algorithm using O(☂n(log log n)<sup>1.5</sup>) queries is given, which improves the previous best known upper bound of O(n<sup>(n/3) (Aaronson, [2]), and implies that Local Search on grids exhibits different properties in low dimensions. Expand
Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem
TLDR
It is shown that randomized search heuristics find minimum spanning trees in expected polynomial time without employing the global technique of greedy algorithms. Expand
...
1
2
3
4
...