Skip to Main content Skip to Navigation
Conference papers

Lower bounds for evolution strategies using VC-dimension

Olivier Teytaud 1, 2 Hervé Fournier 3 
2 TAO - Machine Learning and Optimisation
LRI - Laboratoire de Recherche en Informatique, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR8623
Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Olivier Teytaud Connect in order to contact the contributor
Submitted on : Friday, June 13, 2008 - 10:09:57 AM
Last modification on : Sunday, June 26, 2022 - 11:48:19 AM
Long-term archiving on: : Friday, September 28, 2012 - 3:52:45 PM


Files produced by the author(s)


  • 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⟩



Record views


Files downloads