Landscape-aware fixed-budget performance regression and algorithm selection for modular CMA-ES variants
Authors:
Open Access
- 25 June 2020
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 841-849
Abstract
Automated algorithm selection promises to support the user in the decisive task of selecting a most suitable algorithm for a given problem. A common component of these machine-trained techniques are regression models which predict the performance of a given algorithm on a previously unseen problem instance. In the context of numerical black-box optimization, such regression models typically build on exploratory landscape analysis (ELA), which quantifies several characteristics of the problem. These measures can be used to train a supervised performance regression model. First steps towards ELA-based performance regression have been made in the context of a fixed-target setting. In many applications, however, the user needs to select an algorithm that performs best within a given budget of function evaluations. Adopting this fixed-budget setting, we demonstrate that it is possible to achieve high-quality performance predictions with off-the-shelf supervised learning approaches, by suitably combining two differently trained regression models. We test this approach on a very challenging problem: algorithm selection on a portfolio of very similar algorithms, which we choose from the family of modular CMA-ES algorithms.Keywords
All Related Versions
Funding Information
- Paris Ile de France Region (DIM RFSI AlgoSelect)
- Agence Nationale de la Recherche (ANR-11-LABX-0056-LMH)
- European Cooperation in Science and Technology (CA15140)
This publication has 22 references indexed in Scilit:
- Performance Analysis of Continuous Black-Box Optimization Algorithms via Footprints in Instance SpaceEvolutionary Computation, 2017
- ASlib: A benchmark library for algorithm selectionArtificial Intelligence, 2016
- Algorithm selection for black-box continuous optimization problems: A survey on methods and challengesInformation Sciences, 2015
- Detecting Funnel Structures by Means of Exploratory Landscape Analysis2015
- A Meta-learning Prediction Model of Algorithm Performance for Continuous Optimization ProblemsLecture Notes in Computer Science, 2012
- Exploratory landscape analysis2011
- The dispersion metric and the CMA evolution strategy2006
- Completely Derandomized Self-Adaptation in Evolution StrategiesEvolutionary Computation, 2001
- No free lunch theorems for optimizationIEEE Transactions on Evolutionary Computation, 1997
- The Algorithm Selection Problem1976