An Extended Jump Functions Benchmark for the Analysis of Randomized Search Heuristics

no code implementations • 7 May 2021 • Henry Bambury, Antoine Bultel, Benjamin Doerr

We prove that several previous results extend to this more general class: for all {$k \le \frac{n^{1/3}}{\ln{n}}$} and $\delta < k$, the optimal mutation rate for the $(1+1)$~EA is $\frac{\delta}{n}$, and the fast $(1+1)$~EA runs faster than the classical $(1+1)$~EA by a factor super-exponential in $\delta$.

Evolutionary Algorithms