:: Library Catalog

Saved in:

Bibliographic Details
Main Authors:	Abderrahim, Imène Ait, Doerr, Carola, Durand, Martin
Format:	Preprint
Published:	2026
Subjects:	Neural and Evolutionary Computing
Online Access:	https://arxiv.org/abs/2604.00786
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

When Switching Algorithms Helps: A Theoretical Study of Online Algorithm Selection
by: Antipov, Denis, et al.
Published: (2026)

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)

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)

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

On the Importance of Reward Design in Reinforcement Learning-based Dynamic Algorithm Configuration: A Case Study on OneMax with (1+($λ$,$λ$))-GA
by: Nguyen, Tai, et al.
Published: (2025)

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

Using the Empirical Attainment Function for Analyzing Single-objective Black-box Optimization Algorithms
by: López-Ibáñez, Manuel, et al.
Published: (2024)

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

Runtime Analysis of the Compact Genetic Algorithm on the LeadingOnes Benchmark
by: Chwiałkowski, Marcel, et al.
Published: (2025)

Sampling in CMA-ES: Low Numbers of Low Discrepancy Points
by: de Nobel, Jacob, et al.
Published: (2024)

Runtime Analysis for Multi-Objective Evolutionary Algorithms in Unbounded Integer Spaces
by: Doerr, Benjamin, et al.
Published: (2024)

Similarity-based Portfolio Construction for Black-box Optimization
by: Dinu, Catalin-Viorel, et al.
Published: (2026)

Estimation-of-Distribution Algorithms for Multi-Valued Decision Variables
by: Jedidia, Firas Ben, et al.
Published: (2023)

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

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

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

Proven Runtime Guarantees for How the MOEA/D Computes the Pareto Front From the Subproblem Solutions
by: Doerr, Benjamin, et al.
Published: (2024)

Quantifying Individual and Joint Module Impact in Modular Optimization Frameworks
by: Nikolikj, Ana, et al.
Published: (2024)

Empirical Analysis of the Dynamic Binary Value Problem with IOHprofiler
by: Vermetten, Diederick, 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)

On the Structural (Dis)Agreement of Landscape Representations in Black-Box Optimization
by: Gjorgjieva, Sara, et al.
Published: (2026)

Large-scale Benchmarking of Metaphor-based Optimization Heuristics
by: Vermetten, Diederick, et al.
Published: (2024)

Cascading CMA-ES Instances for Generating Input-diverse Solution Batches
by: Santoni, Maria Laura, et al.
Published: (2025)

MO-IOHinspector: Anytime Benchmarking of Multi-Objective Algorithms using IOHprofiler
by: Vermetten, Diederick, et al.
Published: (2024)

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

Speeding Up the NSGA-II With a Simple Tie-Breaking Rule
by: Doerr, Benjamin, et al.
Published: (2024)

Speeding Up the NSGA-II via Dynamic Population Sizes
by: Doerr, Benjamin, et al.
Published: (2025)

Difficulties of the NSGA-II with the Many-Objective LeadingOnes Problem
by: Doerr, Benjamin, et al.
Published: (2024)

Improved Runtime Guarantees for the SPEA2 Multi-Objective Optimizer
by: Doerr, Benjamin, et al.
Published: (2025)

Multi-parameter Control for the $(1+(λ,λ))$-GA on OneMax via Deep Reinforcement Learning
by: Nguyen, Tai, et al.
Published: (2025)

First Mathematical Runtime Analyses of Multi-Objective Evolutionary Algorithms for Multi-Valued Decision Variables
by: Li, Mingfeng, et al.
Published: (2026)

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

Runtime Analysis of the SMS-EMOA for Many-Objective Optimization
by: Zheng, Weijie, et al.
Published: (2023)

Speeding Up Hyper-Heuristics With Markov-Chain Operator Selection and the Only-Worsening Acceptance Operator
by: Bendahi, Abderrahim, et al.
Published: (2025)

Proven Approximation Guarantees in Multi-Objective Optimization: SPEA2 Beats NSGA-II
by: Alghouass, Yasser, et al.
Published: (2025)

Generalization Ability of Feature-based Performance Prediction Models: A Statistical Analysis across Benchmarks
by: Nikolikj, Ana, et al.
Published: (2024)

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

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

Finding Sets of Pareto Sets in Real-World Scenarios -- A Multitask Multiobjective Perspective
by: Liu, Jiao, et al.
Published: (2026)