Faster black-box algorithms through higher arity operators

@article{Doerr2011FasterBA,
  title={Faster black-box algorithms through higher arity operators},
  author={Benjamin Doerr and D. Johannsen and Timo K{\"o}tzing and P. Lehre and Markus Wagner and Carola Doerr},
  journal={ArXiv},
  year={2011},
  volume={abs/1012.0952}
}
We extend the work of Lehre and Witt (GECCO 2010) on the unbiased black-box model by considering higher arity variation operators. In particular, we show 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>n</i> log <i>n</i>). For OneMax, the Ω(<i>n</i> log <i>n</i>) unary black-box complexity drops to <i>O</i>(<i>n</i>) in the binary case. For <i>k</i>-ary operators, <i>k</i> ≤ <i>n</i>, the OneMax… Expand
Reducing the arity in unbiased black-box complexity
Reducing the arity in unbiased black-box complexity
Better fixed-arity unbiased black-box algorithms
The (1+1) Elitist Black-Box Complexity of LeadingOnes
OneMax in Black-Box Models with Several Restrictions
Parallel Black-Box Complexity With Tail Bounds
OneMax in Black-Box Models with Several Restrictions
The $$(1+1)$$(1+1) Elitist Black-Box Complexity of LeadingOnes
Black-Box Complexity: Breaking the O(n logn) Barrier of LeadingOnes
Unbiased black-box complexities of jump functions: how to cross large plateaus
...
1
2
3
4
5
...