Abstract
We investigate (1,λ) ESs using isotropic mutations for optimization in ℝn by means of a theoretical runtime analysis. In particular, a constant offspring-population size λ will be of interest.
We start off by considering an adaptation-less (1,2) ES minimizing a linear function. Subsequently, a piecewise linear function with a jump/cliff is considered, where a (1+λ) ES gets trapped, i.e., (at least) an exponential (in n) number of steps are necessary to escape the local-optimum region. The (1,2) ES, however, manages to overcome the cliff in an almost unnoticeable number of steps.
Finally, we outline (because of the page limit) how the reasoning and the calculations can be extended to the scenario where a (1,λ) ES using Gaussian mutations minimizes Cliff, a bimodal, spherically symmetric function already considered in the literature, which is merely Sphere with a jump in the function value at a certain distance from the minimum. For λ a constant large enough, the (1,λ) ES manages to conquer the global-optimum region – in contrast to (1+λ) ESs which get trapped.
Supported by the German Research Foundation (DFG) through the collaborative research center “Computational Intelligence” (SFB 531) resp. grant We 1066/11.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arnold, D.: Noisy Optimization with Evolution Strategies. Springer, Heidelberg (2002)
Hoeffding, W.: Probability inequalities for sums of bounded random variables. American Statistical Association Journal 58(301), 13–30 (1963)
Jägersküpper, J.: Analysis of a simple evolutionary algorithm for minimization in Euclidean spaces. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 1068–1079. Springer, Heidelberg (2003)
Jägersküpper, J.: On the complexity of overcoming gaps with isotropic mutations and elitist selection. In: Proc. 2005 IEEE Congress on Evolutionary Computation (CEC), pp. 206–213. IEEE Press, Los Alamitos (2005)
Jägersküpper, J.: Probabilistic runtime analysis of \((1\overset{+}{,}\lambda)\) ES using isotropic mutations. In: Genetic and Evolutionary Computation Conference (GECCO) (2006) (accepted)
Jägersküpper, J., Witt, C.: Rigorous runtime analysis of a (μ+1) ES for the sphere function. In: Proc. 2005 Genetic and Evolutionary Computation Conference (GECCO), pp. 849–856. ACM Press, New York (2005)
Jansen, T., De Jong, K.A., Wegener, I.: On the choice of the offspring population size in evolutionary algorithms. Evolutionary Computation 13(4), 413–440 (2005)
Schwefel, H.-P.: Evolution and Optimum Seeking. Wiley, New York (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jägersküpper, J., Storch, T. (2006). How Comma Selection Helps with the Escape from Local Optima. In: Runarsson, T.P., Beyer, HG., Burke, E., Merelo-Guervós, J.J., Whitley, L.D., Yao, X. (eds) Parallel Problem Solving from Nature - PPSN IX. PPSN 2006. Lecture Notes in Computer Science, vol 4193. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11844297_6
Download citation
DOI: https://doi.org/10.1007/11844297_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38990-3
Online ISBN: 978-3-540-38991-0
eBook Packages: Computer ScienceComputer Science (R0)