Learned Features vs. Classical ELA on Affine BBOB Functions

  • Moritz Seiler*
  • , Urban Škvorc
  • , Gjorgjina Cenikj
  • , Carola Doerr
  • , Heike Trautmann
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

1 Citation (Scopus)

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 deep-learning, 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.

Original languageEnglish
Title of host publicationParallel Problem Solving from Nature – PPSN XVIII
Subtitle of host publication18th International Conference, PPSN 2024, Proceedings
EditorsMichael Affenzeller, Stephan M. Winkler, Anna V. Kononova, Thomas Bäck, Heike Trautmann, Tea Tušar, Penousal Machado
PublisherSpringer
Pages137-153
Number of pages17
ISBN (Print)9783031700675
DOIs
Publication statusPublished - 7 Sept 2024
Event18th International Conference on Parallel Problem Solving from Nature, PPSN 2024 - Hagenberg, Austria
Duration: 14 Sept 202418 Sept 2024
Conference number: 18

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume15149
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference18th International Conference on Parallel Problem Solving from Nature, PPSN 2024
Abbreviated titlePPSN 2024
Country/TerritoryAustria
CityHagenberg
Period14/09/2418/09/24

Keywords

  • n/a OA procedure
  • Black-box Optimization
  • Deep Learning
  • Exploratory Landscape Analysis
  • Automated Algorithm Selection

Fingerprint

Dive into the research topics of 'Learned Features vs. Classical ELA on Affine BBOB Functions'. Together they form a unique fingerprint.

Cite this