Mutative σ-self-adaptation can beat cumulative step size adaptation when using weighted recombination

This paper proposes the σ-self-adaptive weighted multirecombination evolution strategy (ES) and presents a performance analysis of this newly engineered ES. The steady state behavior of this strategy is investigated on the sphere model and a formula for the optimal choice of the learning parameter is derived allowing the ES to reach maximal performance. A comparison between weighted multirecombination ES with σ-self-adaptation (σSA) and with cumulative step size adaptation (CSA) shows that the σ-self-adaptive ES can exhibit the same performance and can even outperform its CSA counterpart for a range of learning parameters.

[1]  Silja Meyer-Nieberg,et al.  Self-adaptation in evolution strategies , 2008 .

[2]  Hans-Paul Schwefel,et al.  Numerical optimization of computer models , 1981 .

[3]  Dirk V. Arnold,et al.  On the use of evolution strategies for optimising certain positive definite quadratic forms , 2007, GECCO '07.

[4]  Ingo Rechenberg,et al.  Evolutionsstrategie : Optimierung technischer Systeme nach Prinzipien der biologischen Evolution , 1973 .

[5]  H. Beyer,et al.  Some observations on the interaction of recombination and self-adaptation in evolution strategies , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[6]  W. Vent,et al.  Rechenberg, Ingo, Evolutionsstrategie — Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. 170 S. mit 36 Abb. Frommann‐Holzboog‐Verlag. Stuttgart 1973. Broschiert , 1975 .

[7]  Hans-Georg Beyer,et al.  The Theory of Evolution Strategies , 2001, Natural Computing Series.

[8]  Thomas Bartz-Beielstein,et al.  Experimental Research in Evolutionary Computation - The New Experimentalism , 2010, Natural Computing Series.

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

[10]  Hans-Georg Beyer,et al.  On the analysis of self-adaptive recombination strategies: first results , 2005, 2005 IEEE Congress on Evolutionary Computation.

[11]  Jens Jägersküpper,et al.  How the (1+1) ES using isotropic mutations minimizes positive definite quadratic forms , 2006, Theor. Comput. Sci..

[12]  Dirk V. Arnold,et al.  Weighted multirecombination evolution strategies , 2006, Theor. Comput. Sci..

[13]  Hans-Georg Beyer,et al.  Qualms Regarding the Optimality of Cumulative Path Length Control in CSA/CMA-Evolution Strategies , 2003, Evolutionary Computation.

[14]  Nikolaus Hansen,et al.  A Derandomized Approach to Self-Adaptation of Evolution Strategies , 1994, Evolutionary Computation.

[15]  Xin Yao,et al.  Fast Evolution Strategies , 1997, Evolutionary Programming.

[16]  Hans-Georg Beyer,et al.  Local Performance of the (μ/μ, μ)-ES in a Noisy Environment , 2000, FOGA.