Landscape Features in Single-Objective Continuous Optimization: Have We Hit a Wall in Algorithm Selection Generalization?
Not on the map. Why?
Abstract (arXiv)
%% Text of abstract The process of identifying the most suitable optimization algorithm for a specific problem, referred to as algorithm selection (AS), entails training models that leverage problem landscape features to forecast algorithm performance. A significant challenge in this domain is ensuring that AS models can generalize effectively to novel, unseen problems. This study evaluates the generalizability of AS models based on different problem representations in the context of single-objective continuous optimization. In particular, it considers the most widely used Exploratory Landscape Analysis features, as well as recently proposed Topological Landscape Analysis features, and features based on deep learning, such as DeepELA, TransOptAS and Doe2Vec. Our results indicate that when presented with out-of-distribution evaluation data, none of the feature-based AS models outperform a simple baseline model, i.e., a Single Best Solver.
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 9 of its 31 references that are in the map. First posted on arXiv 29 Jan 2025.
Builds on
9 of 31 references.
References · 9
- 2021Tabular Data: Deep Learning is Not All You Needcited by 535
- 2018Automated Algorithm Selection: Survey and Perspectivescited by 114
- 2023DoE2Vec: Deep-learning Based Features for Exploratory Landscape Analysiscited by 12
- 2023DynamoRep: Trajectory-Based Population Dynamics for Classification of Black-box Optimization Problemscited by 8
- 2024On the Utility of Probing Trajectories for Algorithm-Selectioncited by 8
- 2021Benchmarking Feature-based Algorithm Selection Systems for Black-box Numerical Optimizationcited by 7
- 2023Using Affine Combinations of BBOB Problems for Performance Assessmentcited by 5
- 2024Impact of Training Instance Selection on Automated Algorithm Selection Models for Numerical Black-box Optimizationcited by 5
- 2023TransOpt: Transformer-based Representation Learning for Optimization Problem Classificationcited by 3
Built on by
Citing papers per year: 2025: 2; 2026: 5.
7 papers.
- 2025The Pitfalls of Benchmarking in Algorithm Selection: What We Are Getting Wrongcited by 3
- 2026LLM Driven Design of Continuous Optimization Problems with Controllable High-level Propertiescited by 2
- 2025Molecular Embedding-Based Algorithm Selection in Protein-Ligand Dockingcited by 1
- 2026Geometric Probing for Algorithm Selection in Continuous Black-Box Optimizationcited by 0
- 2026On the Influence of the Feature Computation Budget on Per-Instance Algorithm Selection for Black-Box Optimizationcited by 0
- 2026Evaluating Real-World Generalizability of Algorithm Selection Modelscited by 0
- 2026Unsupervised Multi-kernel Learning for Automated Algorithm Selectioncited by 0
- 2026Unsupervised Multi-kernel Learning for Automated Algorithm Selection21 Jul 2026
- 2026Evaluating Real-World Generalizability of Algorithm Selection Models1 Jun 2026
- 2026On the Influence of the Feature Computation Budget on Per-Instance Algorithm Selection for Black-Box Optimization6 May 2026
- 2026Geometric Probing for Algorithm Selection in Continuous Black-Box Optimization10 Apr 2026
- 2026LLM Driven Design of Continuous Optimization Problems with Controllable High-level Properties26 Jan 2026
- 2025Molecular Embedding-Based Algorithm Selection in Protein-Ligand Docking2 Dec 2025
- 2025The Pitfalls of Benchmarking in Algorithm Selection: What We Are Getting Wrong12 May 2025