This work significantly enhance the understanding of the dynamics of the GSEMO, in particular, for the classic CountingOnesCountingZeros benchmark, and proves a lower bound of order Ω(n2 log n), for the first time matching the seminal upper bounds known for over twenty years.
Benjamin Doerr, Martin S. Krejca, Andre Opris· GECCO Companion· 0 citations
A rigorous runtime analysis of NSGA-III on the many-objective OneJumpZeroJump benchmark, providing runtime bounds where the number of objectives is constant and a stochastic population update provably guarantees a speedup of order Θ((k/b)k-1) in the runtime where b > 0 is a constant.
This paper introduces the bi-objective problem class CLIMB and analyzes the runtime of GSEMO and the widely used NSGA-II on this problem, and proves that GSEMO and NSGA-II-DYN, a version of NSGA-II with dynamic population sizes, can find the Pareto front of CLIMB in expected fitness evaluations.
Andre Opris· arXiv.org· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.