Benchmarking the Pure Random Search on the BBOB-2009 Noisy Testbed

Anne Auger 1, 2 Raymond Ros 1
1 TAO - Machine Learning and Optimisation
CNRS - Centre National de la Recherche Scientifique : UMR8623, Inria Saclay - Ile de France, UP11 - Université Paris-Sud - Paris 11, LRI - Laboratoire de Recherche en Informatique
Abstract : We benchmark the Pure-Random-Search algorithm on the BBOB 2009 noisy 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 metadatas

Cited literature [5 references]  Display  Hide  Download

https://hal.inria.fr/inria-00430534
Contributor : Anne Auger <>
Submitted on : Sunday, November 8, 2009 - 5:05:21 PM
Last modification on : Thursday, April 5, 2018 - 12:30:12 PM
Long-term archiving on : Thursday, June 17, 2010 - 7:46:17 PM

File

wk2043-Auger.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00430534, version 1

Collections

Citation

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

Share

Metrics

Record views

249

Files downloads

185