Cover Image

Algorithm Instance Footprint: Separating Easily Solvable and Challenging Problem Instances

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Nikolikj, Ana, Džeroski, Sašo, Muñoz, Mario Andrés, Doerr, Carola, Korošec, Peter, Eftimov, Tome
Format:	Preprint
Published:	2023
Subjects:	Neural and Evolutionary Computing
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Adaptive Estimation of the Number of Algorithm Runs in Stochastic Optimization
by: Eftimov, Tome, et al.
Published: (2025)

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

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

Tracing the Interactions of Modular CMA-ES Configurations Across Problem Landscapes
by: Nikolikj, Ana, et al.
Published: (2025)

Quantifying the Impact of Modules and Their Interactions in the PSO-X Framework
by: Camacho-Villalón, Christian L., et al.
Published: (2026)

Customized Exploration of Landscape Features Driving Multi-Objective Combinatorial Optimization Performance
by: Nikolikj, Ana, 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)

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

An Instance Space Analysis of Constrained Multi-Objective Optimization Problems
by: Alsouly, Hanan, et al.
Published: (2022)

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

A Survey of Meta-features Used for Automated Selection of Algorithms for Black-box Single-objective Continuous Optimization
by: Cenikj, Gjorgjina, et al.
Published: (2024)

Comparing Optimization Algorithms Through the Lens of Search Behavior Analysis
by: Cenikj, Gjorgjina, et al.
Published: (2025)

ClustOpt: A Clustering-based Approach for Representing and Visualizing the Search Dynamics of Numerical Metaheuristic Optimization Algorithms
by: Cenikj, Gjorgjina, et al.
Published: (2025)

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)

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

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

Evolving Generalizable Parallel Algorithm Portfolios for Binary Optimization Problems via Domain-Agnostic Instance Generation
by: Wang, Zhiyuan, et al.
Published: (2025)

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

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)

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

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)

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

Difficulties of the NSGA-II with the Many-Objective LeadingOnes Problem
by: Doerr, Benjamin, 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)

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

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

LLM-Driven Instance-Specific Heuristic Generation and Selection
by: Zhang, Shaofeng, et al.
Published: (2025)

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

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

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

Identifying Easy Instances to Improve Efficiency of ML Pipelines for Algorithm-Selection
by: Renau, Quentin, et al.
Published: (2024)

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

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

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

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