Learned Features vs. Classical ELA on Affine BBOB Functions - Sorbonne Université
Conference Papers Year : 2024

Learned Features vs. Classical ELA on Affine BBOB Functions

Moritz Seiler
Urban Škvorc
Gjorgjina Cenikj
Carola Doerr

Abstract

Automated algorithm selection has proven to be effective to improve optimization performance by using machine learning to select the best-performing algorithm for the particular problem being solved. However, doing so requires the ability to describe the landscape of optimization problems using numerical features, which is a difficult task. In this work, we analyze the synergies and complementarity of recently proposed feature sets TransOpt and Deep ELA, which are based on deeplearning, and compare them to the commonly used classical ELA features. We analyze the correlation between the feature sets as well as how well one set can predict the other. We show that while the feature sets contain some shared information, each also contains important unique information. Further, we compare and benchmark the different feature sets for the task of automated algorithm selection on the recently proposed affine black-box optimization problems. We find that while classical ELA is the best-performing feature set by itself, using selected features from a combination of all three feature sets provides superior performance, and all three sets individually substantially outperform the single best solver.
Embargoed file
Embargoed file
0 3 3
Year Month Jours
Avant la publication
Friday, March 7, 2025
Embargoed file
Friday, March 7, 2025
Please log in to request access to the document

Dates and versions

hal-04759437 , version 1 (29-10-2024)

Identifiers

Cite

Moritz Seiler, Urban Škvorc, Gjorgjina Cenikj, Carola Doerr, Heike Trautmann. Learned Features vs. Classical ELA on Affine BBOB Functions. Parallel Problem Solving from Nature – PPSN XVIII (PPSN 2024), Sep 2024, Hagenberg, Austria. pp.137-153, ⟨10.1007/978-3-031-70068-2_9⟩. ⟨hal-04759437⟩
0 View
0 Download

Altmetric

Share

More