Imagen de Portada

Enhancing Parameter Control Policies with State Information

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Covini, Gianluca, Antipov, Denis, Doerr, Carola
Formato:	Preprint
Publicado:	2025
Materias:	Neural and Evolutionary Computing
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Empirical Analysis of the Dynamic Binary Value Problem with IOHprofiler
por: Vermetten, Diederick, et al.
Publicado: (2024)

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

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

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

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

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

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

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

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

Feature-based Evolutionary Diversity Optimization of Discriminating Instances for Chance-constrained Optimization Problems
por: Ahouei, Saba Sadeghi, et al.
Publicado: (2025)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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