mirrored variants of the (1,4)-cma-es compared on the noiseless bbob-2010 testbed
Derandomization by means of mirrored samples has been recently introduced to enhance the performances of (1,?)-Evolution-Strategies (ESs) with the aim of designing fast and robust stochastic local search algorithms. This paper compares on the BBOB-2010 noiseless benchmark testbed two variants of the (1,4)-CMA-ES where the mirrored samples are used. Independent restarts are conducted up to a total budget of 10 4 D function evaluations, where D is the dimension of the search space. The results show that the improved variants are significantly faster than the baseline (1,4)-CMA-ES on 4 functions in 20D (respectively 7 when using sequential selection in addition) by a factor of up to 3 (on the attractive sector function). In no case, the (1,4)-CMA-ES is significantly faster on any tested target function value in 5D and 20D. Moreover, the algorithm employing both mirroring and sequential selection is significantly better than the algorithm without sequentialism on five functions in 20D with expected running times that are about 20\% smaller.
benchmarking black-box optimization