Algorithm selection based on exploratory landscape analysis and cost-sensitive learning

Bischl B., Mersmann O., Trautmann H., Preuss M.


Abstract
The steady supply of new optimization methods makes the algorithm selection problem (ASP) an increasingly pressing and challenging task, specially for real-world black-box optimization problems. The introduced approach considers the ASP as a cost-sensitive classification task which is based on Exploratory Landscape Analysis. Low-level features gathered by systematic sampling of the function on the feasible set are used to predict a well-performing algorithm out of a given portfolio. Example-specific label costs are defined by the expected runtime of each candidate algorithm. We use one-sided support vector regression to solve this learning problem. The approach is illustrated by means of the optimization problems and algorithms of the BBOB'09/10 workshop. © 2012 ACM.

Keywords
algorithm selection; bbob test set; benchmarking; evolutionary optimization; exploratory landscape analysis; fitness landscape; machine learning



Publication type
Conference Paper

Peer reviewed
Yes

Publication status
Published

Year
2012

Conference
14th International Conference on Genetic and Evolutionary Computation, GECCO'12

Venue
Philadelphia, PA, usa

Start page
313

End page
320

Pages range
313-320

Volume
null

Language
English

ISBN
9781450311779

DOI

Full text

Affiliation
Universitat Dortmund