Cover Image

When Switching Algorithms Helps: A Theoretical Study of Online Algorithm Selection

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Antipov, Denis, Doerr, Carola
Format:	Preprint
Published:	2026
Subjects:	Neural and Evolutionary Computing Artificial Intelligence
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Evolutionary Algorithms Are Significantly More Robust to Noise When They Ignore It
by: Antipov, Denis, et al.
Published: (2024)

Parent Selection Mechanisms in Elitist Crossover-Based Algorithms
by: Opris, Andre, et al.
Published: (2026)

Already Moderate Population Sizes Provably Yield Strong Robustness to Noise
by: Antipov, Denis, et al.
Published: (2024)

Lazy Parameter Tuning and Control: Choosing All Parameters Randomly From a Power-Law Distribution
by: Antipov, Denis, et al.
Published: (2021)

Theoretical Analyses of Multiobjective Evolutionary Algorithms on Multimodal Objectives
by: Zheng, Weijie, et al.
Published: (2020)

Enhancing Parameter Control Policies with State Information
by: Covini, Gianluca, et al.
Published: (2025)

A Block-Coordinate Descent EMO Algorithm: Theoretical and Empirical Analysis
by: Doerr, Benjamin, et al.
Published: (2024)

Using 3-Objective Evolutionary Algorithms for the Dynamic Chance Constrained Knapsack Problem
by: Pathiranage, Ishara Hewa, et al.
Published: (2024)

Approximation Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II)
by: Zheng, Weijie, et al.
Published: (2022)

Runtime Analysis for Permutation-based Evolutionary Algorithms
by: Doerr, Benjamin, et al.
Published: (2022)

Local Optima in Diversity Optimization: Non-trivial Offspring Population is Essential
by: Antipov, Denis, et al.
Published: (2024)

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

Impact of Training Instance Selection on Automated Algorithm Selection Models for Numerical Black-box Optimization
by: Dietrich, Konstantin, et al.
Published: (2024)

Runtime Analysis of Evolutionary Diversity Optimization on the Multi-objective (LeadingOnes, TrailingZeros) Problem
by: Antipov, Denis, et al.
Published: (2024)

Hybridizing Target- and SHAP-encoded Features for Algorithm Selection in Mixed-variable Black-box Optimization
by: Dietrich, Konstantin, et al.
Published: (2024)

Stochastic Population Update Can Provably Be Helpful in Multi-Objective Evolutionary Algorithms
by: Bian, Chao, et al.
Published: (2023)

How Sequential Algorithm Portfolios can benefit Black Box Optimization
by: Dinu, Catalin-Viorel, et al.
Published: (2026)

Tight Runtime Bounds for Static Unary Unbiased Evolutionary Algorithms on Linear Functions
by: Doerr, Carola, et al.
Published: (2023)

Deep Reinforcement Learning for Dynamic Algorithm Selection: A Proof-of-Principle Study on Differential Evolution
by: Guo, Hongshu, et al.
Published: (2024)

Runtime Analysis for the NSGA-II: Proving, Quantifying, and Explaining the Inefficiency For Many Objectives
by: Zheng, Weijie, et al.
Published: (2022)

Lower Bounds from Fitness Levels Made Easy
by: Doerr, Benjamin, et al.
Published: (2021)

Finding Low Star Discrepancy 3D Kronecker Point Sets Using Algorithm Configuration Techniques
by: Abderrahim, Imène Ait, et al.
Published: (2026)

Theoretical Analysis of Quality Diversity Algorithms for a Classical Path Planning Problem
by: Dang, Duc-Cuong, et al.
Published: (2024)

A Crowding Distance That Provably Solves the Difficulties of the NSGA-II in Many-Objective Optimization
by: Zheng, Weijie, et al.
Published: (2024)

The First Theoretical Approximation Guarantees for the Non-Dominated Sorting Genetic Algorithm III (NSGA-III)
by: Deng, Renzhong, et al.
Published: (2025)

Scalable Speed-ups for the SMS-EMOA from a Simple Aging Strategy
by: Li, Mingfeng, et al.
Published: (2025)

An Extended Jump Functions Benchmark for the Analysis of Randomized Search Heuristics
by: Bambury, Henry, et al.
Published: (2021)

An Algorithm Board in Neural Decoding
by: Feng, Jingyi, et al.
Published: (2025)

Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms
by: Wietheger, Simon, et al.
Published: (2024)

A Novel Immune Algorithm for Multiparty Multiobjective Optimization
by: Chen, Kesheng, et al.
Published: (2026)

Algorithm Instance Footprint: Separating Easily Solvable and Challenging Problem Instances
by: Nikolikj, Ana, et al.
Published: (2023)

Superior Genetic Algorithms for the Target Set Selection Problem Based on Power-Law Parameter Choices and Simple Greedy Heuristics
by: Doerr, Benjamin, et al.
Published: (2024)

SHS: Scorpion Hunting Strategy Swarm Algorithm
by: Singh, Abhilash, et al.
Published: (2024)

Improved Compact Genetic Algorithms with Efficient Caching
by: Dutta, Prasanta, et al.
Published: (2025)

A Prescription of Methodological Guidelines for Comparing Bio-inspired Optimization Algorithms
by: LaTorre, Antonio, et al.
Published: (2020)

From Performance to Understanding: A Vision for Explainable Automated Algorithm Design
by: van Stein, Niki, et al.
Published: (2025)

A Genetic Algorithm for Multi-Capacity Fixed-Charge Flow Network Design
by: Eardley, Caleb, et al.
Published: (2024)

Concentration Tail-Bound Analysis of Coevolutionary and Bandit Learning Algorithms
by: Lehre, Per Kristian, et al.
Published: (2024)

Archive-based Single-Objective Evolutionary Algorithms for Submodular Optimization
by: Neumann, Frank, et al.
Published: (2024)

MultiGA: Leveraging Multi-Source Seeding in Genetic Algorithms
by: Ng, Isabelle Diana May-Xin, et al.
Published: (2025)