Skip to Main content Skip to Navigation
New interface
Conference papers

Benchmarking the Pure Random Search on the BBOB-2009 Testbed

Anne Auger 1, 2 Raymond Ros 1 
1 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 benchmark the pure random search algorithm on the BBOB 2009 noise-free testbed. Each candidate solution is sampled uniformly in $[-5, 5]^{D}$, where $D$ denotes the search space dimension. The maximum number of function evaluations chosen is $10^{6}$ times the search space dimension. With this budget the algorithm is not able to solve any single function of the testbed.
Document type :
Conference papers
Complete list of metadata

Cited literature [4 references]  Display  Hide  Download
Contributor : Anne Auger Connect in order to contact the contributor
Submitted on : Sunday, November 8, 2009 - 4:57:23 PM
Last modification on : Friday, November 18, 2022 - 9:26:26 AM
Long-term archiving on: : Thursday, June 17, 2010 - 7:45:28 PM


Files produced by the author(s)


  • HAL Id : inria-00430532, version 1


Anne Auger, Raymond Ros. Benchmarking the Pure Random Search on the BBOB-2009 Testbed. ACM-GECCO Genetic and Evolutionary Computation Conference, Jul 2009, Montreal, Canada. ⟨inria-00430532⟩



Record views


Files downloads