no code implementations • 14 Oct 2023 • Ana Kostovska, Gjorgjina Cenikj, Diederick Vermetten, Anja Jankovic, Ana Nikolikj, Urban Skvorc, Peter Korosec, Carola Doerr, Tome Eftimov
Our proposed method creates algorithm behavior meta-representations, constructs a graph from a set of algorithms based on their meta-representation similarity, and applies a graph algorithm to select a final portfolio of diverse, representative, and non-redundant algorithms.
no code implementations • 30 Jun 2023 • Ana Kostovska, Anja Jankovic, Diederick Vermetten, Sašo Džeroski, Tome Eftimov, Carola Doerr
Performance complementarity of solvers available to tackle black-box optimization problems gives rise to the important task of algorithm selection (AS).
1 code implementation • 7 Jun 2023 • Carolin Benjamins, Elena Raponi, Anja Jankovic, Carola Doerr, Marius Lindauer
Bayesian Optimization (BO) is a class of surrogate-based, sample-efficient algorithms for optimizing black-box problems with small evaluation budgets.
1 code implementation • 17 Nov 2022 • Carolin Benjamins, Anja Jankovic, Elena Raponi, Koen van der Blom, Marius Lindauer, Carola Doerr
Bayesian optimization (BO) algorithms form a class of surrogate-based heuristics, aimed at efficiently computing high-quality solutions for numerical black-box optimization problems.
1 code implementation • 2 Nov 2022 • Carolin Benjamins, Elena Raponi, Anja Jankovic, Koen van der Blom, Maria Laura Santoni, Marius Lindauer, Carola Doerr
We also compare this to a random schedule and round-robin selection of EI and PI.
no code implementations • 20 Apr 2022 • Ana Kostovska, Anja Jankovic, Diederick Vermetten, Jacob de Nobel, Hao Wang, Tome Eftimov, Carola Doerr
In contrast to other recent work on online per-run algorithm selection, we warm-start the second optimizer using information accumulated during the first optimization phase.
no code implementations • 13 Apr 2022 • Anja Jankovic, Diederick Vermetten, Ana Kostovska, Jacob de Nobel, Tome Eftimov, Carola Doerr
We study the quality and accuracy of performance regression and algorithm selection models in the scenario of predicting different algorithm performances after a fixed budget of function evaluations.
no code implementations • 22 Apr 2021 • Tome Eftimov, Anja Jankovic, Gorjan Popovski, Carola Doerr, Peter Korošec
Accurately predicting the performance of different optimization algorithms for previously unseen problem instances is crucial for high-performing algorithm selection and configuration techniques.
no code implementations • 19 Apr 2021 • Anja Jankovic, Gorjan Popovski, Tome Eftimov, Carola Doerr
By comparing a total number of 30 different models, each coupled with 2 complementary regression strategies, we derive guidelines for the tuning of the regression models and provide general recommendations for a more systematic use of classical machine learning models in landscape-aware algorithm selection.
no code implementations • 10 Feb 2021 • Anja Jankovic, Tome Eftimov, Carola Doerr
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.
no code implementations • 17 Jun 2020 • Anja Jankovic, Carola Doerr
Automated algorithm selection promises to support the user in the decisive task of selecting a most suitable algorithm for a given problem.