Lower bounds for evolution strategies using VC-dimension - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2008

Lower bounds for evolution strategies using VC-dimension


We derive lower bounds for comparison-based or selection-based algorithms, improving existing results in the continuous setting, and extending them to non-trivial results in the discrete case. We introduce for that the use of the VC-dimension of the level sets of the fitness functions; results are then obtained through the use of Sauer's lemma. In the special case of optmization of the sphere function, improved lower bounds are obtained by bounding the possible number of sign conditions realized by some systems of equations. The results include several applications to the parametrization of sequential or parallel algorithms of type $\mul$-ES.
Fichier principal
Vignette du fichier
paralb.pdf (190.22 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00287845 , version 1 (13-06-2008)


  • HAL Id : inria-00287845 , version 1


Olivier Teytaud, Hervé Fournier. Lower bounds for evolution strategies using VC-dimension. Parallel Problem Solving from Nature, Sep 2008, Dortmund, Germany. 10 p. ⟨inria-00287845⟩
364 View
251 Download


Gmail Facebook X LinkedIn More