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

  • Authors:
  • Ilya Loshchilov;Marc Schoenauer;Michele Sebag

  • Affiliations:
  • INRIA-Saclay , TAO, Orsay, France;INRIA-Saclay , TAO, Orsay, France;CNRS, TAO, Orsay, France

  • Venue:
  • Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

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-aCMA-ES and BIPOP-CMA-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.