Cover Image

Similarity-based Portfolio Construction for Black-box Optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Dinu, Catalin-Viorel, Vermetten, Diederick, Doerr, Carola
Format:	Preprint
Published:	2026
Subjects:	Neural and Evolutionary Computing
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

A Standardized Benchmark Set of Clustering Problem Instances for Comparing Black-Box Optimizers
by: Vermetten, Diederick, et al.
Published: (2025)

Impact of Training Instance Selection on Automated Algorithm Selection Models for Numerical 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)

Large-scale Benchmarking of Metaphor-based Optimization Heuristics
by: Vermetten, Diederick, 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)

Exploration of Pareto-preserving Search Space Transformations in Multi-objective Test Functions
by: Vermetten, Diederick, et al.
Published: (2026)

On the Influence of the Feature Computation Budget on Per-Instance Algorithm Selection for Black-Box Optimization
by: van der Blom, Koen, et al.
Published: (2026)

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

An Adaptive Re-evaluation Method for Evolution Strategy under Additive Noise
by: Dinu, Catalin-Viorel, et al.
Published: (2024)

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

In-the-loop Hyper-Parameter Optimization for LLM-Based Automated Design of Heuristics
by: van Stein, Niki, et al.
Published: (2024)

Avoiding Redundant Restarts in Multimodal Global Optimization
by: de Nobel, Jacob, et al.
Published: (2024)

Explainable Benchmarking for Iterative Optimization Heuristics
by: van Stein, Niki, et al.
Published: (2024)

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

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

Impact of spatial transformations on landscape features of CEC2022 basic benchmark problems
by: Yin, Haoran, et al.
Published: (2024)

Abnormal Mutations: Evolution Strategies Don't Require Gaussianity
by: de Nobel, Jacob, et al.
Published: (2025)

Stalling in Space: Attractor Analysis for any Algorithm
by: Thomson, Sarah L., et al.
Published: (2024)

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

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

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

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

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

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

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

General-Purpose Co-Evolutionary Construction of Parallel Algorithm Portfolios for Multi-Objective Binary Optimization
by: Wang, Zhiyuan, et al.
Published: (2026)

Exploring the True Potential: Evaluating the Black-box Optimization Capability of Large Language Models
by: Huang, Beichen, et al.
Published: (2024)

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

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

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

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)

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)

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

Epoch-based Application of Problem-Aware Operators in a Multiobjective Memetic Algorithm for Portfolio Optimization
by: Durán, Feijoo Colomine, et al.
Published: (2024)

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)