A Many-Objective Problem Where Crossover Is Provably Indispensable
Andre Opris
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它它引用的顶会 Paper2
相关 Paper
- 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 次
- Why Popular MOEAs Are Popular: Proven Advantages in Approximating the Pareto FrontMingfeng Li, Qiang Zhang, Weijie Zheng, Benjamin DoerrNeurIPS 2025 · 被引用 6 次
- Towards a Rigorous Understanding of the Population Dynamics of the NSGA-III: Tight Runtime BoundsAndre OprisAAAI 2026 · 被引用 2 次
- Runtime Analysis of the SMS-EMOA for Many-Objective OptimizationWeijie Zheng, Benjamin DoerrAAAI 2024 · 被引用 26 次
