Reproduce “Mathematical Runtime Analysis for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II)” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Weijie Zheng, Benjamin Doerr
The paper analyzes NSGA-II runtime on two bi-objective benchmarks. With population size at least four times the Pareto-front size, its proofs show that all found front values persist and the complete front is reached in expected O(n log n) iterations on OneMinMax and O(n²) on LOTZ. For OneMinMax, exponential-time obstruction applies only at front-sized populations with one-bit mutation once per parent.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.