Better Fixed-Arity Unbiased Black-Box Algorithms

Nina Bulanova, Maxim Buzdalov

In their GECCO'12 paper, Doerr and Doerr proved that the $k$-ary unbiased black-box complexity of OneMax on $n$ bits is $O(n/k)$ for $2\le k\le O(\log n)$. We propose an alternativ…