A Many-Objective Problem Where Crossover Is Provably Indispensable
Andre Opris
Abstract
This paper addresses theory in evolutionary multiobjective optimisation (EMO) and focuses on the role of crossover operators in many-objective optimisation. The advantages of using crossover are hardly understood and rigorous runtime analyses with crossover are lagging far behind its use in practice, specifically in the case of more than two objectives. We present a many-objective problem class together with a theoretical runtime analysis of the widely used NSGA-III to demonstrate that crossover can yield an exponential speedup on the runtime. In particular, this algorithm can find the Pareto set in expected polynomial time when using crossover, while without crossover it requires exponential time to even find a single Pareto-optimal point. To our knowledge, this is the first rigorous runtime analysis in many-objective optimisation demonstrating an exponential performance gap when using crossover for more than two objectives. This Hot-off-the-Press paper summarises the work Andre Opris, A Many-Objective Problem Where Crossover is Provably Indispensable, To appear at The 39th Annual AAAI Conference on Artificial Intelligence, 2025.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 0b295d97-e880-4712-95d8-4bfda56c9921Cited by top-tier papers1
Ask how each one uses itBuilds on2
Related papers
- A Proof That Using Crossover Can Guarantee Exponential Speed-Ups in Evolutionary Multi-Objective OptimisationDuc-Cuong Dang, Andre Opris, Bahare Salehi, Dirk SudholtAAAI 2023
- Runtime Analysis for the NSGA-II: Provable Speed-Ups from CrossoverBenjamin Doerr, Zhongdi QuAAAI 2023 · 61 citations
- Why Popular MOEAs Are Popular: Proven Advantages in Approximating the Pareto FrontMingfeng Li, Qiang Zhang, Weijie Zheng, Benjamin DoerrNeurIPS 2025 · 6 citations
- Towards a Rigorous Understanding of the Population Dynamics of the NSGA-III: Tight Runtime BoundsAndre OprisAAAI 2026 · 2 citations
- Runtime Analysis of the SMS-EMOA for Many-Objective OptimizationWeijie Zheng, Benjamin DoerrAAAI 2024 · 26 citations
