Benchmarking the (1,4)-CMA-ES with mirrored sampling and sequential selection on the noiseless BBOB-2010 testbed

The well-known Covariance Matrix Adaptation Evolution Strategy (CMA-ES) is a robust stochastic search algorithm for optimizing functions defined on a continuous search space RD. Recently, mirrored samples and sequential selection have been introduced within CMA-ES to improve its local search performances. In this paper, we benchmark the (1,4ms)-CMA-ES which implements mirrored samples and sequential selection on the BBOB-2010 noiseless testbed. Independent restarts are conducted until a maximal number of 104 D function evaluations is reached. The experiments show that 11 of the 24 functions are solved in 20D (and 13 in 5D respectively). Compared to the function-wise target-wise best algorithm of the BBOB-2009 benchmarking, on 25% of the functions the (1,4ms)-CMA-ES is at most by a factor of 3.1 (and 3.8) slower in dimension 20 (and 5) for targets associated to budgets larger than 10D. Moreover, the (1,4ms)-CMA-ES slightly outperforms the best algorithm on the rotated ellipsoid function in 20D and would be ranked two on the Gallagher function with 101 peaks in 10D and 20D--being 25 times faster than the BIPOP-CMA-ES and about 3 times faster than the (1+1)-CMA-ES on this function.

[1]  Edmund K. Burke,et al.  The Genetic and Evolutionary Computation Conference , 2011 .

[2]  Andrew M. Sutton,et al.  The Impact of Global Structure on Search , 2008, PPSN.

[3]  Nikolaus Hansen,et al.  Evaluating the CMA Evolution Strategy on Multimodal Test Functions , 2004, PPSN.

[4]  Anne Auger,et al.  Comparing results of 31 algorithms from the black-box optimization benchmarking BBOB-2009 , 2010, GECCO '10.

[5]  Nikolaus Hansen,et al.  The CMA Evolution Strategy: A Comparing Review , 2006, Towards a New Evolutionary Computation.

[6]  Anne Auger,et al.  Performance evaluation of an advanced local search evolutionary algorithm , 2005, 2005 IEEE Congress on Evolutionary Computation.

[7]  Raymond Ros,et al.  Benchmarking sep-CMA-ES on the BBOB-2009 noisy testbed , 2009, GECCO '09.

[8]  Anne Auger,et al.  BBOB 2009: Comparison Tables of All Algorithms on All Noiseless Functions , 2010 .

[9]  Anne Auger,et al.  Benchmarking the (1+1)-CMA-ES on the BBOB-2009 noisy testbed , 2009, GECCO '09.

[10]  Anne Auger,et al.  Real-Parameter Black-Box Optimization Benchmarking 2009: Noiseless Functions Definitions , 2009 .

[11]  Nikolaus Hansen,et al.  A restart CMA evolution strategy with increasing population size , 2005, 2005 IEEE Congress on Evolutionary Computation.

[12]  Anne Auger,et al.  Mirrored variants of the (1,2)-CMA-ES compared on the noisy BBOB-2010 testbed , 2010, GECCO '10.

[13]  Mihály Csaba Markót,et al.  BBO-Benchmarking of the GLOBAL method for the Noiseless Function Testbed , 2009 .

[14]  Carlos García-Martínez,et al.  A continuous variable neighbourhood search based on specialised EAs: application to the noiseless BBO-benchmark 2009 , 2009, GECCO '09.

[15]  Anne Auger,et al.  Investigating the impact of sequential selection in the (1,2)-CMA-ES on the noiseless BBOB-2010 testbed , 2010, GECCO '10.

[16]  Anne Auger,et al.  Mirrored Sampling and Sequential Selection for Evolution Strategies , 2010, PPSN.

[17]  Anne Auger,et al.  Mirrored variants of the (1,4)-CMA-ES compared on the noiseless BBOB-2010 testbed , 2010, GECCO '10.

[18]  Anne Auger,et al.  Mirrored variants of the (1,4)-CMA-ES compared on the noisy BBOB-2010 testbed , 2010, GECCO '10.

[19]  Anne Auger,et al.  Benchmarking the (1+1)-CMA-ES on the BBOB-2009 function testbed , 2009, GECCO '09.

[20]  Dirk Thierens,et al.  AMaLGaM IDEAs in noiseless black-box optimization benchmarking , 2009, GECCO '09.

[21]  Nikolaus Hansen,et al.  Benchmarking a BI-population CMA-ES on the BBOB-2009 function testbed , 2009, GECCO '09.

[22]  J. van Leeuwen,et al.  Genetic and Evolutionary Computation — GECCO 2003 , 2003, Lecture Notes in Computer Science.

[23]  Carlos García-Martínez,et al.  A continuous variable neighbourhood search based on specialised eas: application to the noisy BBO-benchmark 2009 testbed , 2009, GECCO '09.

[24]  Nikolaus Hansen,et al.  Completely Derandomized Self-Adaptation in Evolution Strategies , 2001, Evolutionary Computation.

[25]  Raymond Ros,et al.  Benchmarking the NEWUOA on the BBOB-2009 function testbed , 2009, GECCO '09.

[26]  Anne Auger,et al.  Mirrored variants of the (1,2)-CMA-ES compared on the noiseless BBOB-2010 testbed , 2010, GECCO '10.

[27]  N. Hansen,et al.  Real-Parameter Black-Box Optimization Benchmarking: Experimental Setup , 2010 .

[28]  Anne Auger,et al.  Investigating the impact of sequential selection in the (1,2)-CMA-ES on the noisy BBOB-2010 testbed , 2010, GECCO '10.