2 code implementations • 9 Mar 2017 • Benjamin Doerr, Huu Phuoc Le, Régis Makhmara, Ta Duy Nguyen
We prove that the $(1+1)$ EA with this heavy-tailed mutation rate optimizes any $\jump_{m, n}$ function in a time that is only a small polynomial (in~$m$) factor above the one stemming from the optimal rate for this $m$.
