Towards Feature-Based Performance Regression Using Trajectory Data
Anja Jankovic, Tome Eftimov, Carola Doerr

TL;DR
This paper investigates the effectiveness of using trajectory data from optimization algorithms to predict solution quality, aiming to reduce the costly sampling process in feature-based performance regression.
Contribution
It demonstrates that trajectory-based feature approximation can closely predict final solution quality with less sampling, challenging the need for explicit feature selection.
Findings
Trajectory-based ELA predictions are nearly as accurate as global sampling.
Feature selection does not improve prediction accuracy and may worsen it.
Including CMA-ES state variables has a moderate impact on predictions.
Abstract
Black-box optimization is a very active area of research, with many new algorithms being developed every year. This variety is needed, on the one hand, since different algorithms are most suitable for different types of optimization problems. But the variety also poses a meta-problem: which algorithm to choose for a given problem at hand? Past research has shown that per-instance algorithm selection based on exploratory landscape analysis (ELA) can be an efficient mean to tackle this meta-problem. Existing approaches, however, require the approximation of problem features based on a significant number of samples, which are typically selected through uniform sampling or Latin Hypercube Designs. The evaluation of these points is costly, and the benefit of an ELA-based algorithm selection over a default algorithm must therefore be significant in order to pay off. One could hope to by-pass…
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.
