Generalization Ability of Feature-based Performance Prediction Models: A Statistical Analysis across Benchmarks
Not on the map. Why?
Abstract (arXiv)
This study examines the generalization ability of algorithm performance prediction models across various benchmark suites. Comparing the statistical similarity between the problem collections with the accuracy of performance prediction models that are based on exploratory landscape analysis features, we observe that there is a positive correlation between these two measures. Specifically, when the high-dimensional feature value distributions between training and testing suites lack statistical significance, the model tends to generalize well, in the sense that the testing errors are in the same range as the training errors. Two experiments validate these findings: one involving the standard benchmark suites, the BBOB and CEC collections, and another using five collections of affine combinations of BBOB problem instances.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 11 of its 40 references that are in the map. First posted on arXiv 20 May 2024.
Builds on
11 of 40 references.
References · 11
- 2016COCO: A Platform for Comparing Continuous Optimizers in a Black-Box Settingcited by 135
- 2017Automated Algorithm Selection on Continuous Black-Box Problems By Combining Exploratory Landscape Analysis and Machine Learningcited by 33
- 2017Comprehensive Feature-Based Landscape Analysis of Continuous and Constrained Optimization Problems Using the R-Package flaccocited by 27
- 2021IOHexperimenter: Benchmarking Platform for Iterative Optimization Heuristicscited by 24
- 2022Per-run Algorithm Selection with Warm-starting using Trajectory-based Featurescited by 20
- 2020Landscape-Aware Fixed-Budget Performance Regression and Algorithm Selection for Modular CMA-ES Variantscited by 15
- 2022SELECTOR: Selecting a Representative Benchmark Suite for Reproducible Statistical Comparisoncited by 11
- 2022BBOB Instance Analysis: Landscape Properties and Algorithm Performance across Problem Instancescited by 10
- 2015An Improved Distributed Algorithm for Maximal Independent Setcited by 4
- 2020Linear Matrix Factorization Embeddings for Single-objective Optimization Landscapescited by 4
- 2023Assessing the Generalizability of a Performance Predictive Modelcited by 4
Built on by
Citing papers per year: 2025: 2; 2026: 2.
4 papers.
- 2025BLADE: Benchmark suite for LLM-driven Automated Design and Evolution of iterative optimisation heuristicscited by 9
- 2025Revisiting Generalization Power of a DNN in Terms of Symbolic Interactionscited by 1
- 2026Geometric Probing for Algorithm Selection in Continuous Black-Box Optimizationcited by 0
- 2026Unsupervised Multi-kernel Learning for Automated Algorithm Selectioncited by 0
- 2026Unsupervised Multi-kernel Learning for Automated Algorithm Selection21 Jul 2026
- 2026Geometric Probing for Algorithm Selection in Continuous Black-Box Optimization10 Apr 2026
- 2025BLADE: Benchmark suite for LLM-driven Automated Design and Evolution of iterative optimisation heuristics28 Apr 2025
- 2025Revisiting Generalization Power of a DNN in Terms of Symbolic Interactions14 Feb 2025