Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
129 tokens/sec
GPT-4o
28 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Runtime Analyses of NSGA-III on Many-Objective Problems (2404.11433v2)

Published 17 Apr 2024 in cs.NE

Abstract: NSGA-II and NSGA-III are two of the most popular evolutionary multi-objective algorithms used in practice. While NSGA-II is used for few objectives such as 2 and 3, NSGA-III is designed to deal with a larger number of objectives. In a recent breakthrough, Wietheger and Doerr (IJCAI 2023) gave the first runtime analysis for NSGA-III on the 3-objective OneMinMax problem, showing that this state-of-the-art algorithm can be analyzed rigorously. We advance this new line of research by presenting the first runtime analyses of NSGA-III on the popular many-objective benchmark problems mLOTZ, mOMM, and mCOCZ, for an arbitrary constant number $m$ of objectives. Our analysis provides ways to set the important parameters of the algorithm: the number of reference points and the population size, so that a good performance can be guaranteed. We show how these parameters should be scaled with the problem dimension, the number of objectives and the fitness range. To our knowledge, these are the first runtime analyses for NSGA-III for more than 3 objectives.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (41)
  1. Black-box complexity of parallel search with distributed populations. In Proceedings of the Foundations of Genetic Algorithms (FOGA’15), pages 3–15. ACM Press, 2015.
  2. C. Bian and C. Qian. Better running time of the non-dominated sorting genetic algorithm II (NSGA-II) by using stochastic tournament selection. In Proceedings of the International Conference on Parallel Problem Solving from Nature (PPSN ’22), volume 13399 of LNCS, pages 428–441. Springer, 2022.
  3. Investigating the normalization procedure of NSGA-III. In K. Deb, E. Goodman, C. A. Coello Coello, K. Klamroth, K. Miettinen, S. Mostaghim, and P. Reed, editors, Evolutionary Multi-Criterion Optimization, pages 229–240, Cham, 2019. Springer International Publishing.
  4. The first proven performance guarantees for the non-dominated sorting genetic algorithm II (NSGA-II) on a combinatorial optimization problem. In Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI 2023, pages 5522–5530. ijcai.org, 2023.
  5. Evolutionary Algorithms for Solving Multi-Objective Problems. Genetic Algorithms and Evolutionary Computation. Springer US, 2013.
  6. Analysing the robustness of NSGA-II under noise. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO’23), pages 642–651. ACM Press, 2023a.
  7. A proof that using crossover can guarantee exponential speed-ups in evolutionary multi-objective optimisation. In Proceedings of the AAAI Conference on Artificial Intelligence, AAAI 2023, pages 12390–12398. AAAI Press, 2023b.
  8. Crossover can guarantee exponential speed-ups in evolutionary multi-objective optimisation. Artificial Intelligence, 330:104098, 2024. ISSN 0004-3702.
  9. I. Das and J. E. Dennis. Normal-boundary intersection: A new method for generating the pareto surface in nonlinear multicriteria optimization problems. SIAM Journal on Optimization, 8(3):631–657, 1998.
  10. K. Deb. Multi-Objective Optimization using Evolutionary Algorithms. John Wiley & Sons, 2001.
  11. K. Deb and H. Jain. An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part i: Solving problems with box constraints. IEEE Transactions on Evolutionary Computation, 18(4):577–601, 2014.
  12. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2):182–197, 2002.
  13. Rigorous runtime analysis of MOEA/D for solving multi-objective minimum weight base problems. In Proceedings of the Annual Conference on Neural Information Processing Systems, NeurIPS 2023, 2023.
  14. B. Doerr. Analyzing randomized search heuristics via stochastic domination. Theoretical Computer Science, 773:115–137, 2019. ISSN 0304-3975.
  15. B. Doerr and F. Neumann, editors. Theory of Evolutionary Computation – Recent Developments in Discrete Optimization. Springer, 2020.
  16. B. Doerr and Z. Qu. A first runtime analysis of the NSGA-II on a multimodal problem. In Proceedings of the International Conference on Parallel Problem Solving from Nature (PPSN ’22), volume 13399 of LNCS, pages 399–412. Springer, 2022.
  17. B. Doerr and Z. Qu. A first runtime analysis of the NSGA-II on a multimodal problem. IEEE Transactions on Evolutionary Computation, pages 1–1, 2023.
  18. W. Feller. An introduction to probability theory and its applications. Volume I. John Wiley & Sons, 1968.
  19. Approximating covering problems by randomized search heuristics using multi-objective models. Evolutionary Computation, 18(4):617–633, 2010.
  20. C. Horoba. Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem. In Proceedings of the Foundations of Genetic Algorithms (FOGA’09), pages 113–120. ACM Press, 2009.
  21. C. Horoba and F. Neumann. Benefits and drawbacks for the use of epsilon-dominance in evolutionary multi-objective optimization. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO’08), pages 641–648. ACM Press, 2008.
  22. C. Horoba and F. Neumann. Additive approximations of pareto-optimal sets by evolutionary multi-objective algorithms. In Proceedings of the Foundations of Genetic Algorithms (FOGA’09), pages 79–86. ACM Press, 2009.
  23. C. Horoba and F. Neumann. Approximating pareto-optimal sets using diversity strategies in evolutionary multi-objective optimization. In Advances in Multi-Objective Nature Inspired Computing, volume 272 of Studies in Computational Intelligence, pages 23–44. Springer, 2010.
  24. Running time analysis of MOEA/D with crossover on discrete optimization problem. In Proceedings of the AAAI Conference on Artificial Intelligence, AAAI 2019, pages 2296–2303. AAAI Press, 2019.
  25. Running time analysis of MOEA/D on pseudo-boolean functions. IEEE Transactions on Cybernetics, 51(10):5130–5141, 2021a.
  26. A runtime analysis of typical decomposition approaches in MOEA/D framework for many-objective optimization problems. In Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI 2021, pages 1682–1688. ijcai.org, 2021b.
  27. T. Jansen. Analyzing Evolutionary Algorithms – The Computer Science Perspective. Natural Computing Series. Springer, 2013.
  28. Reducing local optima in single-objective problems by multi-objectivization. In Proceedings of the International Conference on Evolutionary Multi-Criterion Optimization, EMO 2001, volume 1993 of Lecture Notes in Computer Science, pages 269–283. Springer, 2001.
  29. Running time analysis of multiobjective evolutionary algorithms on pseudo-boolean functions. IEEE Transactions on Evolutionary Computation, 8(2):170–182, 2004.
  30. F. Neumann. Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem. European Journal of Operational Research, 181(3):1620–1629, 2007.
  31. F. Neumann and I. Wegener. Minimum spanning trees made easier via multi-objective optimization. Natural Computing, 5(3):305–319, 2006.
  32. F. Neumann and C. Witt. Bioinspired Computation in Combinatorial Optimization – Algorithms and Their Computational Complexity. Natural Computing Series. Springer, 2010.
  33. S. Wietheger and B. Doerr. A mathematical runtime analysis of the non-dominated sorting genetic algorithm III (NSGA-III). In Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI 2023, pages 5657–5665. ijcai.org, 2023.
  34. S. Wietheger and B. Doerr. Near-tight runtime guarantees for many-objective evolutionary algorithms. Under review, 2024.
  35. C. Witt. Fitness levels with tail bounds for the analysis of randomized search heuristics. Information Processing Letters, 114(1):38–41, 2014.
  36. W. Zheng and B. Doerr. Better approximation guarantees for the NSGA-II by using the current crowding distance. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO’22), pages 611–619. ACM Press, 2022.
  37. W. Zheng and B. Doerr. Runtime analysis for the NSGA-II: Proving, quantifying, and explaining the inefficiency for many objectives. IEEE Transactions on Evolutionary Computation, 2023a. To appear.
  38. W. Zheng and B. Doerr. Mathematical runtime analysis for the non-dominated sorting genetic algorithm II (NSGA-II). Artificial Intelligence, 325:104016, 2023b.
  39. W. Zheng and B. Doerr. Runtime analysis of the SMS-EMOA for many-objective optimization. In Proceedings of the AAAI Conference on Artificial Intelligence, AAAI 2024, pages 20874–20882. AAAI Press, 2024.
  40. A first mathematical runtime analysis of the non-dominated sorting genetic algorithm II (NSGA-II). In Proceedings of the AAAI Conference on Artificial Intelligence, AAAI 2022, pages 10408–10416. AAAI Press, 2022.
  41. Evolutionary learning: Advances in theories and algorithms. Springer, 2019.
Citations (11)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets