A meta-learning prediction model of algorithm performance for continuous optimization problems

52Citations
Citations of this article
48Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Algorithm selection and configuration is a challenging problem in the continuous optimization domain. An approach to tackle this problem is to develop a model that links landscape analysis measures and algorithm parameters to performance. This model can be then used to predict algorithm performance when a new optimization problem is presented. In this paper, we investigate the use of a machine learning framework to build such a model. We demonstrate the effectiveness of our technique using CMA-ES as a representative algorithm and a feed-forward backpropagation neural network as the learning strategy. Our experimental results show that we can build sufficiently accurate predictions of an algorithm's expected performance. This information is used to rank the algorithm parameter settings based on the current problem instance, hence increasing the probability of selecting the best configuration for a new problem. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Muñoz, M. A., Kirley, M., & Halgamuge, S. K. (2012). A meta-learning prediction model of algorithm performance for continuous optimization problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7491 LNCS, pp. 226–235). https://doi.org/10.1007/978-3-642-32937-1_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free