Generalization Ability of Feature-based Performance Prediction Models: A Statistical Analysis across Benchmarks
Ana Nikolikj, Ana Kostovska, Gjorgjina Cenikj, Carola Doerr, Tome, Eftimov

TL;DR
This paper investigates how well feature-based performance prediction models generalize across different benchmark suites, finding that statistical similarity between training and testing problem collections correlates with better model generalization.
Contribution
It provides a statistical analysis linking the similarity of problem distributions to the generalization performance of prediction models across benchmarks.
Findings
Positive correlation between statistical similarity and model accuracy
Models generalize better when feature distributions are statistically similar
Validation across multiple benchmark collections confirms the findings
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSoftware Engineering Research
