Benchmarking a BI-population CMA-ES on the BBOB-2009 function testbed
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
Mirrored variants of the (1,2)-CMA-ES compared on the noisy BBOB-2010 testbed
Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
Analyzing the impact of mirrored sampling and sequential selection in elitist evolution strategies
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
| Hi-index | 0.00 |
Derandomization by means of mirroring has been recently introduced to enhance the performances of (1,λ)-Evolution-Strategies (ESs) with the aim of designing fast robust local search stochastic algorithms. This paper compares on the BBOB-2010 noiseless benchmark testbed two variants of the (1,2)-CMA-ES where the mirroring method is implemented. Independent restarts are conducted till a total budget of 104 D function evaluations per trial is reached, where D is the dimension of the search space. The results show that the improved variants increase the success probability on 5 (respectively 7) out of 24 test functions in 20D and at the same time are significantly faster on 9 (10) functions in 20D by a factor of about 2-3 (2-4) for a target value of 10-7 while in no case, the baseline (1,2)-CMA-ES is significantly faster on any tested target function value in 5D and 20D.