Per instance algorithm configuration of CMA-ES with limited budget

Nacim Belkhir 1, 2 Johann Dreo 1 Pierre Savéant 3 Marc Schoenauer 4, 2
2 TAU - TAckling the Underspecified
LRI - Laboratoire de Recherche en Informatique, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR8623
Abstract : Per Instance Algorithm Configuration (PIAC) relies on features that describe problem instances. It builds an Empirical Performance Model (EPM) from a training set made of (instance, parameter configuration) pairs together with the corresponding performance of the algorithm at hand. This paper presents a case study in the continuous black-box optimization domain, using features proposed in the literature. The target algorithm is CMA-ES, and three of its hyper-parameters. Special care is taken to the computational cost of the features. The EPM is learned on the BBOB benchmark, but tested on independent test functions gathered from the optimization literature.The results demonstrate that the proposed approach can outperform the default setting of CMA-ES with as few as 30 or 50 time the problem dimension additional function evaluations for feature computation.
Liste complète des métadonnées

Cited literature [34 references]  Display  Hide  Download

https://hal.inria.fr/hal-01613753
Contributor : Nacim Belkhir <>
Submitted on : Wednesday, October 11, 2017 - 2:30:54 PM
Last modification on : Wednesday, March 27, 2019 - 4:08:31 PM
Document(s) archivé(s) le : Friday, January 12, 2018 - 12:36:50 PM

File

GECCO2017_nacimbelkhir.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01613753, version 1

Citation

Nacim Belkhir, Johann Dreo, Pierre Savéant, Marc Schoenauer. Per instance algorithm configuration of CMA-ES with limited budget. GECCO 2017 - Proceedings of the Genetic and Evolutionary Computation Conference , Jul 2017, Berlin, Germany. pp. 681-688. ⟨hal-01613753⟩

Share

Metrics

Record views

555

Files downloads

379