Weighted recombination evolution strategy on a class of PDQF's

This work is concerned with a weighted recombination method for Evolution Strategies (ES) on a class of positive definite quadratic forms (PDQF). In particular, the λopt-ES and the λopt-CSA-ES will be analyzed. A characteristic of both strategies is the use of weighted recombination of all offspring within an iteration step. After obtaining equations describing the evolutionary process, the weights and the progress rate for the λopt-ES will be derived. It is shown that the optimal mutation strength (step size) for the λopt-ES yields an asymptotic limit value of 2κ, where κ is an user-chosen rescaling factor. Afterwards the cumulative step-length adaptation (CSA) is analyzed to determine the target mutation strength (the mutation strength the strategy tries to reach by means of adaptation) and the actually attained mutation strength. For both the asymptotic values are obtained at √2κ. To justify the theoretical results, comparisons with simulations are presented.

[1]  Hans-Georg Beyer,et al.  Local performance of the (1 + 1)-ES in a noisy environment , 2002, IEEE Trans. Evol. Comput..

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

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

[4]  Hans-Georg Beyer,et al.  On the performance of evolution strategies on noisy PDQFs: Progress rate analysis , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

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

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

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

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

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

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

[11]  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 .

[12]  H. Beyer,et al.  Performance of the -ES on a Class of PDQFs , 2010 .

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

[14]  Jens Jägersküpper,et al.  Probabilistic analysis of evolution strategies using isotropic mutations , 2007 .

[15]  H. Beyer,et al.  Noisy Local Optimization with Evolution Strategies , 2002 .

[16]  Jens Jägersküpper,et al.  Rigorous Runtime Analysis of the (1+1) ES: 1/5-Rule and Ellipsoidal Fitness Landscapes , 2005, FOGA.

[17]  Dirk V. Arnold,et al.  Noisy Optimization With Evolution Strategies , 2002, Genetic Algorithms and Evolutionary Computation.

[18]  Alpha Microprocessor,et al.  Performance of an , 1998 .