# OneMax in Black-Box Models with Several Restrictions

@article{Doerr2015OneMaxIB, title={OneMax in Black-Box Models with Several Restrictions}, author={Carola Doerr and Johannes Lengler}, journal={Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation}, year={2015} }

As in classical runtime analysis the OneMax problem is the most prominent test problem also in black-box complexity theory. It is known that the unrestricted, the memory-restricted, and the ranking-based black-box complexities of this problem are all of order n/log n, where n denotes the length of the bit strings. The combined memory-restricted ranking-based black-box complexity of OneMax, however, was not known. We show in this work that it is Θ(n) for the smallest possible size bound, that is… Expand

#### Tables and Topics from this paper

#### 5 Citations

OneMax in Black-Box Models with Several Restrictions

- Mathematics, Computer Science
- Algorithmica
- 2016

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

On the Choice of the Update Strength in Estimation-of-Distribution Algorithms and Ant Colony Optimization

- Computer Science, Mathematics
- Algorithmica
- 2018

A rigorous runtime analysis concerning the update strength, a vital parameter in PMBGAs such as the step size 1 / K in the so-called compact Genetic Algorithm and the evaporation factor $$\rho $$ρ in ant colony optimizers (ACO). Expand

Theory of estimation-of-distribution algorithms

- Computer Science
- GECCO
- 2018

An up-to-date overview of the most commonly analyzed EDAs and the most recent theoretical results in this area is provided, with emphasis put on the runtime analysis of simple univariate EDAs. Expand

#### References

SHOWING 1-10 OF 18 REFERENCES

OneMax in Black-Box Models with Several Restrictions

- Mathematics, Computer Science
- Algorithmica
- 2016

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

Reducing the arity in unbiased black-box complexity

- Computer Science, Mathematics
- Theor. Comput. Sci.
- 2014

Abstract We show that for all 1 k ≤ log n the k-ary unbiased black-box complexity of the n-dimensional OneMax function class is O ( n / k ) . This indicates that the power of higher arity operators… Expand

Ranking-Based Black-Box Complexity

- Mathematics, Computer Science
- Algorithmica
- 2012

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

Elitist Black-Box Models: Analyzing the Impact of Elitist Selection on the Performance of Evolutionary Algorithms

- Computer Science, Mathematics
- GECCO
- 2015

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

A New Framework for the Valuation of Algorithms for Black-Box Optimization

- Mathematics, Computer Science
- FOGA
- 2002

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

- Computer Science, Mathematics
- GECCO '10
- 2010

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

Black-box complexity: from complexity theory to playing mastermind

- Mathematics, Computer Science
- GECCO '12
- 2012

This tutorial aims to give an in-depth coverage of two topics that received much attention in the last few years of randomized search heuristics: stronger upper bounds and the connection to guessing games and alternative black-box models. Expand

Faster black-box algorithms through higher arity operators

- Computer Science, Mathematics
- FOGA '11
- 2011

The work of Lehre and Witt (GECCO 2010) on the unbiased black- box model is extended by considering higher arity variation operators by showing that already for binary operators the black-box complexity of LeadingOnes drops from Θ(<i>n</i><sup>2</sup>) for unary operators to <i>O</i>(<i-i> log <i*n> log<i+i>) in the binary case. Expand

From black-box complexity to designing new genetic algorithms

- Mathematics, Computer Science
- Theor. Comput. Sci.
- 2015

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

Black-box search by elimination of fitness functions

- Mathematics, Computer Science
- FOGA '09
- 2009

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