no code implementations • 24 Feb 2023 • Benjamin Doerr, Aymen Echarghaoui, Mohammed Jamal, Martin S. Krejca
From this better understanding of the population diversity, we obtain stronger runtime guarantees, among them the statement that for all $c\ln(n)\le\mu \le n/\log n$, with $c$ a suitable constant, the runtime of the $(\mu+1)$ GA on $\mathrm{Jump}_k$, with $k \ge 3$, is $O(n^{k-1})$.