Which Surrogate Works for Empirical Performance Modelling? A Case Study with Differential Evolution

01/30/2019
by   Ke Li, et al.
0

It is not uncommon that meta-heuristic algorithms contain some intrinsic parameters, the optimal configuration of which is crucial for achieving their peak performance. However, evaluating the effectiveness of a configuration is expensive, as it involves many costly runs of the target algorithm. Perhaps surprisingly, it is possible to build a cheap-to-evaluate surrogate that models the algorithm's empirical performance as a function of its parameters. Such surrogates constitute an important building block for understanding algorithm performance, algorithm portfolio/selection, and the automatic algorithm configuration. In principle, many off-the-shelf machine learning techniques can be used to build surrogates. In this paper, we take the differential evolution (DE) as the baseline algorithm for proof-of-concept study. Regression models are trained to model the DE's empirical performance given a parameter configuration. In particular, we evaluate and compare four popular regression algorithms both in terms of how well they predict the empirical performance with respect to a particular parameter configuration, and also how well they approximate the parameter versus the empirical performance landscapes.

READ FULL TEXT

page 5

page 6

page 14

research
03/30/2017

Efficient Benchmarking of Algorithm Configuration Procedures via Model-Based Surrogates

The optimization of algorithm (hyper-)parameters is crucial for achievin...
research
04/15/2019

On the Performance of Differential Evolution for Hyperparameter Tuning

Automated hyperparameter tuning aspires to facilitate the application of...
research
06/17/2020

Landscape-Aware Fixed-Budget Performance Regression and Algorithm Selection for Modular CMA-ES Variants

Automated algorithm selection promises to support the user in the decisi...
research
08/30/2023

Surrogate-based Autotuning for Randomized Sketching Algorithms in Regression Problems

Algorithms from Randomized Numerical Linear Algebra (RandNLA) are known ...
research
11/05/2012

Algorithm Runtime Prediction: Methods & Evaluation

Perhaps surprisingly, it is possible to predict how long an algorithm wi...
research
11/30/2022

Learning non-stationary and discontinuous functions using clustering, classification and Gaussian process modelling

Surrogate models have shown to be an extremely efficient aid in solving ...
research
08/03/2021

Arby - Fast data-driven surrogates

The availability of fast to evaluate and reliable predictive models is h...

Please sign up or login with your details

Forgot password? Click here to reset