pith. sign in

arxiv: 1206.0974 · v1 · pith:55H3OHC6new · submitted 2012-04-24 · 💻 cs.NE

Black-box optimization benchmarking of IPOP-saACM-ES on the BBOB-2012 noisy testbed

classification 💻 cs.NE
keywords ipop-saacm-esbenchmarkdimensionfunctionproblemsadaptationalgorithmallows
0
0 comments X
read the original abstract

In this paper, we study the performance of IPOP-saACM-ES, recently proposed self-adaptive surrogate-assisted Covariance Matrix Adaptation Evolution Strategy. The algorithm was 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. The experiments show that the surrogate model control allows IPOP-saACM-ES to be as robust as the original IPOP-aCMA-ES and outperforms the latter by a factor from 2 to 3 on 6 benchmark problems with moderate noise. On 15 out of 30 benchmark problems in dimension 20, IPOP-saACM-ES exceeds the records observed during BBOB-2009 and BBOB-2010.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.