Conditionning, halting criteria and choosing lambda - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2007

Conditionning, halting criteria and choosing lambda

Olivier Teytaud


We show the convergence of 1+ lambda-ES with standard step-size update-rules on a large family of fitness functions without any convexity assumption or quasi-convexity assumptions ([5, 6]). The result provides a rule for choosing lambda and shows the consistency of halting criteria based on thresholds on the step-size. The family of functions under work is defined through a conditionnumber that generalizes usual condition-numbers in a manner that only depends on level-sets. We consider that the definition of this conditionnumber is the relevant one for evolutionary algorithms; in particular, global convergence results without convexity or quasi-convexity assumptions are proved when this condition-number is finite.
Fichier principal
Vignette du fichier
chooselambda.pdf (473.52 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00173237 , version 1 (19-09-2007)


  • HAL Id : inria-00173237 , version 1


Olivier Teytaud. Conditionning, halting criteria and choosing lambda. EA07, 2007, Tours, France. ⟨inria-00173237⟩
241 View
105 Download


Gmail Facebook X LinkedIn More