Benchmarking the Pure Random Search on the BBOB-2009 Noisy Testbed - Archive ouverte HAL Access content directly
Conference Papers Year : 2009

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

(1, 2) , (1)
1
2

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.
Fichier principal
Vignette du fichier
wk2043-Auger.pdf (391.1 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00430534 , version 1 (08-11-2009)

Identifiers

  • HAL Id : inria-00430534 , version 1

Cite

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⟩
99 View
159 Download

Share

Gmail Facebook Twitter LinkedIn More