Copertina

Achieving Tight $O(4^k)$ Runtime Bounds on Jump$_k$ by Proving that Genetic Algorithms Evolve Near-Maximal Population Diversity

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Opris, Andre, Lengler, Johannes, Sudholt, Dirk
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Neural and Evolutionary Computing 68Q25, 68Q87, 68W20, 68W40, 68W50 F.2.2; G.3
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

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

Many Objective Problems Where Crossover is Provably Essential
di: Opris, Andre
Pubblicazione: (2024)

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

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

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

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

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

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

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

Near-Optimal Bootstrapping of Hitting Sets for Algebraic Models
di: Kumar, Mrinal, et al.
Pubblicazione: (2018)

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

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

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

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

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

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

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

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

Massively Parallel Modular Methods in Commutative Algebra and Algebraic Geometry
di: Basson, Dirk, et al.
Pubblicazione: (2024)

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

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

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

Approximating k-Center via Farthest-First on $δ$-Covers
di: Wilson, Jason R.
Pubblicazione: (2026)

Quantifying The Limits of AI Reasoning: Systematic Neural Network Representations of Algorithms
di: Kratsios, Anastasis, et al.
Pubblicazione: (2025)

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
di: Heimann, Sophia, et al.
Pubblicazione: (2026)

Algorithms for Generating Small Random Samples
di: Cicirello, Vincent A.
Pubblicazione: (2024)

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

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

Incremental-Decremental Maximization
di: Disser, Yann, et al.
Pubblicazione: (2025)

Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization
di: Buchbinder, Niv, et al.
Pubblicazione: (2024)

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
di: Heimann, Sophia, et al.
Pubblicazione: (2024)

Exact Set Packing in Multimodal Transportation with Ridesharing System for First/Last Mile
di: Gu, Qian-Ping, et al.
Pubblicazione: (2025)

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

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

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
di: Heimann, Sophia, et al.
Pubblicazione: (2025)

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

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

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