论文信息 - Benchmarking CMA-EGS on the BBOB 2010 noisy function testbed

Benchmarking CMA-EGS on the BBOB 2010 noisy function testbed

This paper describes the implementation and the results for CMA-EGS on the BBOB 2010 testbed. The CMA-EGS is a hybrid strategy which combines elements from gradient search and evolutionary algorithms. The paper describes the algorithm used and the experimental setup. The strategy is able to solve 17 of 30 functions in at least one dimensionality.

Hans-Georg Beyer | Steffen Finck | H. Beyer | Steffen Finck

[1] Petros Koumoutsakos,et al. Reducing the Time Complexity of the Derandomized Evolution Strategy with Covariance Matrix Adaptation (CMA-ES) , 2003, Evolutionary Computation.

[2] Dirk V. Arnold,et al. Evolution strategies with adaptively rescaled mutation vectors , 2005, 2005 IEEE Congress on Evolutionary Computation.

[3] Nikolaus Hansen,et al. Adapting arbitrary normal mutation distributions in evolution strategies: the covariance matrix adaptation , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

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

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

[6] Dirk V. Arnold,et al. Evolutionary Gradient Search Revisited , 2007, IEEE Transactions on Evolutionary Computation.

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

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

[9] Nikolaus Hansen,et al. Step-Size Adaption Based on Non-Local Use of Selection Information , 1994, PPSN.