%0 Journal Article %1 Kerschke2019-hz %A Kerschke, Pascal %A Trautmann, Heike %D 2019 %I MIT Press %J Evol. Comput. %K Automated algorithm analysis; black-box continuous exploratory landscape learning; machine optimization. optimization; selection; single-objective %N 1 %P 99--127 %T Automated algorithm selection on continuous black-box problems by combining Exploratory Landscape Analysis and machine learning %V 27 %X In this article, we build upon previous work on designing informative and efficient Exploratory Landscape Analysis features for characterizing problems' landscapes and show their effectiveness in automatically constructing algorithm selection models in continuous black-box optimization problems. Focusing on algorithm performance results of the COCO platform of several years, we construct a representative set of high-performing complementary solvers and present an algorithm selection model that, compared to the portfolio's single best solver, on average requires less than half of the resources for solving a given problem. Therefore, there is a huge gain in efficiency compared to classical ensemble methods combined with an increased insight into problem characteristics and algorithm properties by using informative features. The model acts on the assumption that the function set of the Black-Box Optimization Benchmark is representative enough for practical applications. The model allows for selecting the best suited optimization algorithm within the considered set for unseen problems prior to the optimization itself based on a small sample of function evaluations. Note that such a sample can even be reused for the initial population of an evolutionary (optimization) algorithm so that even the feature costs become negligible.

@article{Kerschke2019-hz, abstract = {In this article, we build upon previous work on designing informative and efficient Exploratory Landscape Analysis features for characterizing problems' landscapes and show their effectiveness in automatically constructing algorithm selection models in continuous black-box optimization problems. Focusing on algorithm performance results of the COCO platform of several years, we construct a representative set of high-performing complementary solvers and present an algorithm selection model that, compared to the portfolio's single best solver, on average requires less than half of the resources for solving a given problem. Therefore, there is a huge gain in efficiency compared to classical ensemble methods combined with an increased insight into problem characteristics and algorithm properties by using informative features. The model acts on the assumption that the function set of the Black-Box Optimization Benchmark is representative enough for practical applications. The model allows for selecting the best suited optimization algorithm within the considered set for unseen problems prior to the optimization itself based on a small sample of function evaluations. Note that such a sample can even be reused for the initial population of an evolutionary (optimization) algorithm so that even the feature costs become negligible.}, added-at = {2024-09-10T11:54:51.000+0200}, author = {Kerschke, Pascal and Trautmann, Heike}, biburl = {https://puma.scadsai.uni-leipzig.de/bibtex/2ef8615931dbd076a625bedbe5c80b49b/scadsfct}, interhash = {2b8caae5115859dec7b464d2d9f35835}, intrahash = {ef8615931dbd076a625bedbe5c80b49b}, journal = {Evol. Comput.}, keywords = {Automated algorithm analysis; black-box continuous exploratory landscape learning; machine optimization. optimization; selection; single-objective}, language = {en}, number = 1, pages = {99--127}, publisher = {MIT Press}, timestamp = {2024-09-10T11:54:51.000+0200}, title = {Automated algorithm selection on continuous black-box problems by combining Exploratory Landscape Analysis and machine learning}, volume = 27, year = 2019 }