Cover Image

Towards a Rigorous Understanding of the Population Dynamics of the NSGA-III: Tight Runtime Bounds

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Opris, Andre
Format:	Preprint
Published:	2025
Subjects:	Neural and Evolutionary Computing 68W05, 68Q25, 68W20, 68W50, 68T20 F.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Runtime Analyses of NSGA-III on Many-Objective Problems
by: Opris, Andre, et al.
Published: (2024)

Achieving Tight $O(4^k)$ Runtime Bounds on Jump$_k$ by Proving that Genetic Algorithms Evolve Near-Maximal Population Diversity
by: Opris, Andre, et al.
Published: (2024)

A First Runtime Analysis of the PAES-25: An Enhanced Variant of the Pareto Archived Evolution Strategy
by: Opris, Andre
Published: (2025)

Runtime Analyses of NSGA-III on Many-Objective Problems: Provable Exponential Speedup via Stochastic Population Update
by: Opris, Andre
Published: (2025)

Tight Runtime Guarantees From Understanding the Population Dynamics of the GSEMO Multi-Objective Evolutionary Algorithm
by: Doerr, Benjamin, et al.
Published: (2025)

Many Objective Problems Where Crossover is Provably Essential
by: Opris, Andre
Published: (2024)

Optimizing Genetic Algorithms Using the Binomial Distribution
by: Cicirello, Vincent A.
Published: (2024)

Open Source Evolutionary Computation with Chips-n-Salsa
by: Cicirello, Vincent A.
Published: (2024)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
by: DasGupta, Bhaskar, et al.
Published: (2026)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
by: Chen, Zongchen, et al.
Published: (2022)

How to Compute a Moving Sum
by: Maslen, David K., et al.
Published: (2025)

Parameter Tuning of the Firefly Algorithm by Standard Monte Carlo and Quasi-Monte Carlo Methods
by: Joy, Geethu, et al.
Published: (2024)

Domain-Informed Genetic Superposition Programming: A Case Study on SFRC Beams
by: Khorshidi, Mohammad Sadegh, et al.
Published: (2025)

Evolutionary Computation as Natural Generative AI
by: Shi, Yaxin, et al.
Published: (2025)

Shortest Paths without a Map, but with an Entropic Regularizer
by: Bubeck, Sébastien, et al.
Published: (2022)

First Steps Towards a Runtime Analysis When Starting With a Good Solution
by: Antipov, Denis, et al.
Published: (2020)

L-System Genetic Encoding for Scalable Neural Network Evolution: A Comparison with Direct Matrix Encoding
by: Stuy, Alexander, et al.
Published: (2026)

Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruption
by: Cai, HanQin, et al.
Published: (2023)

Strongly Sublinear Algorithms for Testing Pattern Freeness
by: Newman, Ilan, et al.
Published: (2021)

Point Location in Constant Time
by: Chaganti, Sairam, et al.
Published: (2023)

How Population Diversity Influences the Efficiency of Crossover
by: Cerf, Sacha, et al.
Published: (2024)

A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
by: Hougardy, Stefan, et al.
Published: (2025)

Optimal non-adaptive algorithm for edge estimation
by: Bishnu, Arijit, et al.
Published: (2025)

Stochastic trace estimation for parameter-dependent matrices applied to spectral density approximation
by: Matti, Fabio, et al.
Published: (2025)

Survey of Genetic and Differential Evolutionary Algorithm Approaches to Search Documents Based On Semantic Similarity
by: Muniyappa, Chandrashekar, et al.
Published: (2025)

An Improved Drift Theorem for Balanced Allocations
by: Los, Dimitrios, et al.
Published: (2023)

OneMax is not the Easiest Function for Fitness Improvements
by: Kaufmann, Marc, et al.
Published: (2022)

Random-Order Online Independent Set of Intervals and Hyperrectangles
by: Garg, Mohit, et al.
Published: (2024)

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
by: Feldman, Moran, et al.
Published: (2026)

Random feature-based double Vovk-Azoury-Warmuth algorithm for online multi-kernel learning
by: Rokhlin, Dmitry B., et al.
Published: (2025)

A hierarchical Vovk-Azoury-Warmuth forecaster with discounting for online regression in RKHS
by: Rokhlin, Dmitry B.
Published: (2025)

Naively Sorting Evolving Data is Optimal and Robust
by: Giakkoupis, George, et al.
Published: (2024)

Computing and Enumerating Minimal Common Supersequences Between Two Strings
by: Sopp, Braeden, et al.
Published: (2026)

Massively Parallel Genetic Optimization through Asynchronous Propagation of Populations
by: Taubert, Oskar, et al.
Published: (2023)

On the Parenthesisations of Matrix Chains: All are Useful, Few Are Essential
by: López, Francisco, et al.
Published: (2023)

On the Average-Case Performance of Greedy for Maximum Coverage
by: Balkanski, Eric, et al.
Published: (2026)

Revisiting Chazelle's Implementation of the Bottom-Left Heuristic: A Corrected and Rigorous Analysis
by: Michel, Stefan
Published: (2025)

Refutation of Spectral Graph Theory Conjectures with Search Algorithms)
by: Roucairol, Milo, et al.
Published: (2024)

Exascale Multi-Task Graph Foundation Models for Imbalanced, Multi-Fidelity Atomistic Data
by: Pasini, Massimiliano Lupo, et al.
Published: (2026)

The average-case complexity of the Word Problem for groups of matrices over $\mathbb{Z}$ is linear
by: Bassino, Frédérique, et al.
Published: (2025)