Black-box optimization benchmarking of IPOP-saACM-ES and BIPOP-saACM-ES on the BBOB-2012 noiseless testbed - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

Black-box optimization benchmarking of IPOP-saACM-ES and BIPOP-saACM-ES on the BBOB-2012 noiseless testbed

(1) , (1, 2) , (1, 3)
1
2
3

Abstract

In this paper, we study the performance of IPOP-saACM-ES and BIPOP-saACM-ES, recently proposed self-adaptive surrogate-assisted Covariance Matrix Adaptation Evolution Strategies. Both algorithms were tested using restarts till a total number of function evaluations of 10^6D was reached, where D is the dimension of the function search space. We compared surrogate-assisted algorithms with their surrogate-less versions IPOP-saACM-ES and BIPOP-saACM-ES, two algorithms with one of the best overall performance observed during the BBOB-2009 and BBOB-2010. The comparison shows that the surrogate-assisted versions outperform the original CMA-ES algorithms by a factor from 2 to 4 on 8 out of 24 noiseless benchmark problems, showing the best results among all algorithms of the BBOB-2009 and BBOB-2010 on Ellipsoid, Discus, Bent Cigar, Sharp Ridge and Sum of different powers functions.
Fichier principal
Vignette du fichier
BBOB2012_saACMES_noiseless.pdf (765.66 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00690444 , version 1 (23-04-2012)

Identifiers

Cite

Ilya Loshchilov, Marc Schoenauer, Michèle Sebag. Black-box optimization benchmarking of IPOP-saACM-ES and BIPOP-saACM-ES on the BBOB-2012 noiseless testbed. Workshop Proceedings of the (GECCO) Genetic and Evolutionary Computation Conference, Jul 2012, Philadelphia, United States. ⟨hal-00690444⟩
264 View
162 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More