Skip to main content

2016 | OriginalPaper | Buchkapitel

Lyapunov Design of a Simple Step-Size Adaptation Strategy Based on Success

verfasst von : Claudia R. Correa, Elizabeth F. Wanner, Carlos M. Fonseca

Erschienen in: Parallel Problem Solving from Nature – PPSN XIV

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

A simple success-based step-size adaptation rule for single-parent 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\mathop {,}\limits ^{+}\lambda )\)-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 \(\lambda \). 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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Fußnoten
1
Equivalently to \(V(x^*)=0\) and \(V(x)>0\) \(\forall \,x \ne x^*\), one may require that \(V(x) \rightarrow -\infty \) only when \(x \rightarrow x^*\).
 
2
An event holds asymptotically almost surely if it holds with probability \(1- o(1)\), i.e. the probability of success goes to 1 in the limit as \(n \rightarrow \infty \) [14].
 
3
A stochastic process \(V_t\) is said to be a supermartingale if \(E^{A_t}(V_{t+1}) \le V_t\).
 
Literatur
1.
Zurück zum Zitat Hansen, N., Ostermeier, A.: Completely derandomized self-adaptation in evolution strategies. Evol. Comput. 9(2), 159–195 (2001)CrossRef Hansen, N., Ostermeier, A.: Completely derandomized self-adaptation in evolution strategies. Evol. Comput. 9(2), 159–195 (2001)CrossRef
2.
Zurück zum Zitat Doerr, B., Doerr, C.: Optimal parameter choices through self-adjustment: applying the \(1/5\)-th rule in discrete settings. In: Proceedings of the 2015 ACM-GECCO Genetic and Evolutionary Computation Conference, pp. 1335–1342. ACM (2015) Doerr, B., Doerr, C.: Optimal parameter choices through self-adjustment: applying the \(1/5\)-th rule in discrete settings. In: Proceedings of the 2015 ACM-GECCO Genetic and Evolutionary Computation Conference, pp. 1335–1342. ACM (2015)
3.
Zurück zum Zitat Doerr, B., Doerr, C.: A tight runtime analysis of the \((1+(\lambda ,\lambda ))\) genetic algorithm on onemax. In: Proceedings of the 2015 ACM-GECCO Genetic and Evolutionary Computation Conference, pp. 1423–1430. ACM (2015) Doerr, B., Doerr, C.: A tight runtime analysis of the \((1+(\lambda ,\lambda ))\) genetic algorithm on onemax. In: Proceedings of the 2015 ACM-GECCO Genetic and Evolutionary Computation Conference, pp. 1423–1430. ACM (2015)
4.
Zurück zum Zitat Wanner, E.F., Fonseca, C.M., Cardoso, R.T.N., Takahashi, R.H.C.: Lyapunov stability analysis and adaptation law synthesis of a derandomized self-adaptive \((1,2)\)-ES. Under review Wanner, E.F., Fonseca, C.M., Cardoso, R.T.N., Takahashi, R.H.C.: Lyapunov stability analysis and adaptation law synthesis of a derandomized self-adaptive \((1,2)\)-ES. Under review
5.
Zurück zum Zitat Semenov, M.A., Terkel, D.A.: Analysis of convergence of an evolutionary algorithm with self-adaptation using a stochastic Lyapunov function. Evol. Comput. 11(4), 363–379 (2003)CrossRef Semenov, M.A., Terkel, D.A.: Analysis of convergence of an evolutionary algorithm with self-adaptation using a stochastic Lyapunov function. Evol. Comput. 11(4), 363–379 (2003)CrossRef
6.
Zurück zum Zitat Jägersküpper, J.: A blend of Markov-chain and drift analysis. In: Rudolph, G., Jansen, T., Lucas, S., Poloni, C., Beume, N. (eds.) PPSN 2008. LNCS, vol. 5199, pp. 41–51. Springer, Heidelberg (2008)CrossRef Jägersküpper, J.: A blend of Markov-chain and drift analysis. In: Rudolph, G., Jansen, T., Lucas, S., Poloni, C., Beume, N. (eds.) PPSN 2008. LNCS, vol. 5199, pp. 41–51. Springer, Heidelberg (2008)CrossRef
7.
8.
Zurück zum Zitat He, J., Yao, X.: A study of drift analysis for estimating computational time of evolutionary algorithms. Natural Comput. 3, 21–35 (2004)MathSciNetCrossRefMATH He, J., Yao, X.: A study of drift analysis for estimating computational time of evolutionary algorithms. Natural Comput. 3, 21–35 (2004)MathSciNetCrossRefMATH
10.
Zurück zum Zitat Witt, C.: Tight bounds on the optimization time of a randomized search heuristic on linear function. Comb. Probab. Comput. 22(02), 294–318 (2013)MathSciNetCrossRefMATH Witt, C.: Tight bounds on the optimization time of a randomized search heuristic on linear function. Comb. Probab. Comput. 22(02), 294–318 (2013)MathSciNetCrossRefMATH
11.
Zurück zum Zitat Hart, W.E.: Rethinking the design of real-coded evolutionary algorithms: making discrete choices in continuous search domains. Soft Comput. J. 9, 225–235 (2002)CrossRefMATH Hart, W.E.: Rethinking the design of real-coded evolutionary algorithms: making discrete choices in continuous search domains. Soft Comput. J. 9, 225–235 (2002)CrossRefMATH
12.
Zurück zum Zitat Lyapunov, A.M.: The general problem of stability of motion (reprint of the original paper of 1892). Int. J. Control 55(3), 531–773 (1992)MathSciNetCrossRef Lyapunov, A.M.: The general problem of stability of motion (reprint of the original paper of 1892). Int. J. Control 55(3), 531–773 (1992)MathSciNetCrossRef
14.
Metadaten
Titel
Lyapunov Design of a Simple Step-Size Adaptation Strategy Based on Success
verfasst von
Claudia R. Correa
Elizabeth F. Wanner
Carlos M. Fonseca
Copyright-Jahr
2016
DOI
https://doi.org/10.1007/978-3-319-45823-6_10

Premium Partner