Abstract
Cumulative step length adaptation is a mutation strength control mechanism commonly employed with evolution strategies. When using weighted recombination with negative weights it can be observed to be prone to failure, often leading to divergent behaviour in low-dimensional search spaces. This paper traces the reasons for this breakdown of step length control. It then proposes a novel variant of the algorithm that reliably results in convergent behaviour for the test functions considered. The influence of the dimensionality as well as of the degree of ill-conditioning on optimisation performance are evaluated in computer experiments. Implications for the use of weighted recombination with negative weights are discussed.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Arnold, D.V.: Noisy Optimization with Evolution Strategies. Kluwer Academic Publishers, Dordrecht (2002)
Arnold, D.V.: Optimal weighted recombination. In: Wright, A.H., et al. (eds.) Foundations of Genetic Algorithms 8, pp. 215–237. Springer, Heidelberg (2005)
Arnold, D.V.: Weighted multirecombination evolution strategies. Theoretical Computer Science 361(1), 291–308 (2006)
Arnold, D.V., MacDonald, D.: Weighted recombination evolution strategies on the parabolic ridge. In: Proc. of the 2006 IEEE Congress on Evolutionary Computation, pp. 411–418. IEEE Press, Los Alamitos (2006)
Auger, A., Hansen, N.: Reconsidering the progress rate theory for evolution strategies in finite dimensions. In: Proc. of the 8th Annual Conference on Genetic and Evolutionary Computation, pp. 445–452. ACM Press, New York (2006)
Beyer, H.-G., Schwefel, H.-P.: Evolution strategies — A comprehensive introduction. Natural Computing 1(1), 3–52 (2002)
Hansen, N., Kern, S.: Evaluating the CMA evolution strategy on multimodal test functions. In: Yao, X., Burke, E.K., Lozano, J.A., Smith, J., Merelo-Guervós, J.J., Bullinaria, J.A., Rowe, J.E., Tiňo, P., Kabán, A., Schwefel, H.-P. (eds.) PPSN 2004. LNCS, vol. 3242, pp. 282–291. Springer, Heidelberg (2004)
Hansen, N., Müller, S.D., Koumoutsakos, P.: Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (CMA-ES). Evolutionary Computation 11(1), 1–18 (2003)
Hansen, N., Ostermeier, A.: Completely derandomized self-adaptation in evolution strategies. Evolutionary Computation 9(2), 159–195 (2001)
Ostermeier, A., Gawelczyk, A., Hansen, N.: Step-size adaptation based on non-local use of selection information. In: Davidor, Y., Männer, R., Schwefel, H.-P. (eds.) PPSN 1994. LNCS, vol. 866, pp. 189–198. Springer, Heidelberg (1994)
Rechenberg, I.: Evolutionsstrategie — Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. Friedrich Frommann Verlag (1973)
Rudolph, G.: Convergence Properties of Evolutionary Algorithms. Verlag Dr. Kovač (1997)
Schwefel, H.-P.: Evolution and Optimum Seeking. John Wiley & Sons, Chichester (1995)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arnold, D.V., Van Wart, D.C.S. (2008). Cumulative Step Length Adaptation for Evolution Strategies Using Negative Recombination Weights. In: Giacobini, M., et al. Applications of Evolutionary Computing. EvoWorkshops 2008. Lecture Notes in Computer Science, vol 4974. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78761-7_60
Download citation
DOI: https://doi.org/10.1007/978-3-540-78761-7_60
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78760-0
Online ISBN: 978-3-540-78761-7
eBook Packages: Computer ScienceComputer Science (R0)