Performance analysis of evolution strategies with multi-recombination in high-dimensional RN-search spaces disturbed by noise

The presence of noise in real-world optimization problems poses difficulties to optimization strategies. It is frequently observed that evolutionary algorithms are quite capable of succeeding in noisy environments. Intuitively, the use of a population of candidate solutions alongside with some implicit or explicit form of averaging inherent in the algorithms is considered responsible. However, so as to arrive at a deeper understanding of the reasons for the capabilities of evolutionary algorithms, mathematical analyses of their performance in select environments are necessary. Such analyses can reveal how the performance of the algorithms scales with parameters of the problem--such as the dimensionality of the search space or the noise strength--or of the algorithms--such as population size or mutation strength. Recommendations regarding the optimal sizing of such parameters can then be derived.The present paper derives an asymptotically exact approximation to the progress rate of the (µ/µI, λ)-evolution strategy (ES) on a finite-dimensional noisy sphere. It is shown that, in contrast to results obtained in the limit of infinite search space dimensionality, there is a finite optimal population size above which the efficiency of the strategy declines, and that therefore it is not possible to attain the efficiency that can be achieved in the absence of noise by increasing the population size. It is also shown that nonetheless, the benefits of genetic repair and an increased mutation strength make it possible for the multi-parent (µ/µI, λ)-ES to far outperform simple one-parent strategies.

[1]  Ingo Wegener,et al.  A Rigorous Complexity Analysis of the (1 + 1) Evolutionary Algorithm for Separable Functions with Boolean Inputs , 1998, Evolutionary Computation.

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

[3]  Hans-Georg Beyer,et al.  Toward a Theory of Evolution Strategies: Some Asymptotical Results from the (1,+ )-Theory , 1993, Evolutionary Computation.

[4]  Hans-Paul Schwefel,et al.  Evolution and Optimum Seeking: The Sixth Generation , 1993 .

[5]  Ingo Rechenberg,et al.  Evolutionsstrategie '94 , 1994, Werkstatt Bionik und Evolutionstechnik.

[6]  Volker Nissen,et al.  Optimization with Noisy Function Evaluations , 1998, PPSN.

[7]  Dan Boneh,et al.  On genetic algorithms , 1995, COLT '95.

[8]  Günter Rudolph,et al.  Theory of Evolutionary Algorithms: A Bird's Eye View , 1999, Theor. Comput. Sci..

[9]  David E. Goldberg,et al.  Genetic Algorithms, Selection Schemes, and the Varying Effects of Noise , 1996, Evolutionary Computation.

[10]  Hans-Paul Schwefel,et al.  Where Elitists Start Limping Evolution Strategies at Ridge Functions , 1998, PPSN.

[11]  BeyerHans-Georg Toward a theory of evolution strategies , 1993 .

[12]  Magnus Rattray,et al.  Noisy Fitness Evaluation in Genetic Algorithms and the Dynamics of Learning , 1996, FOGA.

[13]  Hans-Georg Beyer,et al.  Toward a Theory of Evolution Strategies: On the Benefits of Sex the (/, ) Theory , 1995, Evolutionary Computation.

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

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

[16]  Kevin Barraclough,et al.  I and i , 2001, BMJ : British Medical Journal.

[17]  Hans-Georg Beyer,et al.  Theory of evolution strategies - a tutorial , 2001 .

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

[19]  Thomas Bäck,et al.  Evolution Strategies on Noisy Functions: How to Improve Convergence Properties , 1994, PPSN.

[20]  H. Beyer Evolutionary algorithms in noisy environments : theoretical issues and guidelines for practice , 2000 .

[21]  Dirk V. Arnold,et al.  Evolution strategies in noisy environments- a survey of existing work , 2001 .

[22]  Hans-Georg Beyer,et al.  Efficiency and Mutation Strength Adaptation of the (mu, muI, lambda)-ES in a Noisy Environment , 2000, PPSN.

[23]  H. P. Schwefel,et al.  Numerische Optimierung von Computermodellen mittels der Evo-lutionsstrategie , 1977 .

[24]  L. Kallel,et al.  Theoretical Aspects of Evolutionary Computing , 2001, Natural Computing Series.

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

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

[27]  Hans-Paul Schwefel,et al.  Evolution and optimum seeking , 1995, Sixth-generation computer technology series.

[28]  John J. Grefenstette,et al.  Genetic algorithms in noisy environments , 1988, Machine Learning.