Lyapunov design of a simple step-size adaptation strategy based on success

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A simple success-based step-size adaptation rule for singleparent Evolution Strategies is formulated, and the setting of the corresponding parameters is considered. Theoretical convergence on the class of strictly unimodal functions of one variable that are symmetric around the optimum is investigated using a stochastic Lyapunov function method developed by Semenov and Terkel [5] in the context of martingale theory. General expressions for the conditional expectations of the next values of step size and distance to the optimum under (1 +, λ)-selection are analytically derived, and an appropriate Lyapunov function is constructed. Convergence rate upper bounds, as well as adaptation parameter values, are obtained through numerical optimization for increasing values of λ. By selecting the number of offspring that minimizes the bound on the convergence rate with respect to the number of function evaluations, all strategy parameter values result from the analysis.

Cite

CITATION STYLE

APA

Correa, C. R., Wanner, E. F., & Fonseca, C. M. (2016). Lyapunov design of a simple step-size adaptation strategy based on success. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9921 LNCS, pp. 101–110). Springer Verlag. https://doi.org/10.1007/978-3-319-45823-6_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free