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. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Arnold, D. V., & Van Wart, D. C. S. (2008). Cumulative step length adaptation for evolution strategies using negative recombination weights. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4974 LNCS, pp. 545–554). https://doi.org/10.1007/978-3-540-78761-7_60
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.