Cover Image

Tight Runtime Guarantees From Understanding the Population Dynamics of the GSEMO Multi-Objective Evolutionary Algorithm

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Doerr, Benjamin, Krejca, Martin, Opris, Andre
Format:	Preprint
Published:	2025
Subjects:	Neural and Evolutionary Computing Primary: 68W50, Secondary: 68W20, 68W40 F.2.2; G.3
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: Provable Exponential Speedup via Stochastic Population Update
by: Opris, Andre
Published: (2025)

Towards a Rigorous Understanding of the Population Dynamics of the NSGA-III: Tight Runtime Bounds
by: Opris, Andre
Published: (2025)

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)

Runtime Analyses of NSGA-III on Many-Objective Problems
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)

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

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

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)

Hardest Monotone Functions for Evolutionary Algorithms
by: Kaufmann, Marc, et al.
Published: (2023)

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

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

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

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

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

A Survey of Meta-features Used for Automated Selection of Algorithms for Black-box Single-objective Continuous Optimization
by: Cenikj, Gjorgjina, et al.
Published: (2024)

Quantum-Inspired Evolutionary Algorithms for Feature Subset Selection: A Comprehensive Survey
by: Vivek, Yelleti, et al.
Published: (2024)

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

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

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

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

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

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

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

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

Improved Differential Evolution based Feature Selection through Quantum, Chaos, and Lasso
by: Vivek, Yelleti, et al.
Published: (2024)

Improved Approximation Algorithms for Path and Forest Augmentation via a Novel Relaxation
by: Hommelsheim, Felix
Published: (2025)

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

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

Multipole Semantic Attention: A Fast Approximation of Softmax Attention for Pretraining
by: Mitchell, Rupert, et al.
Published: (2025)

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

A $4/3$ Approximation for $2$-Vertex-Connectivity
by: Bosch-Calvo, Miguel, et al.
Published: (2023)

On the Approximation Ratio of the $k$-Opt and Lin-Kernighan Algorithm
by: Zhong, Xianghui
Published: (2019)

A $5/4$-Approximation for Two-Edge Connectivity
by: Bosch-Calvo, Miguel, et al.
Published: (2024)

Incremental-Decremental Maximization
by: Disser, Yann, et al.
Published: (2025)

SCAPE: Searching Conceptual Architecture Prompts using Evolution
by: Lim, Soo Ling, et al.
Published: (2024)

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

Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means
by: Friggstad, Zachary, et al.
Published: (2018)

Multi-Party Multi-Objective Optimization as Consensus Search: Runtime Analysis of Cross-Party Recombination
by: Fang, Xiaolei, et al.
Published: (2026)

Finding Complex Patterns in Trajectory Data via Geometric Set Cover
by: Conradi, Jacobus, et al.
Published: (2023)