HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

The Impact of Sample Volume in Random Search on the bbob Test Suite

Dimo Brockhoff 1, 2, 3 Nikolaus Hansen 1, 2, 3
1 RANDOPT - Randomized Optimisation
CMAP - Centre de Mathématiques Appliquées - Ecole Polytechnique, Inria Saclay - Ile de France
Abstract : Uniform Random Search is considered the simplest of all randomized search strategies and thus a natural baseline in benchmarking. Yet, in continuous domain it has its search domain width as a parameter that potentially has a strong effect on its performance. In this paper, we investigate this effect on the well-known 24 functions from the bbob test suite by varying the sample domain of the algorithm ([−α, α]^n for α ∈ {0.5, 1, 2, 3, 4, 5, 6, 10, 20} and n the search space dimension). Though the optima of the bbob testbed are randomly chosen in [−4, 4]^n (with the exception of the linear function f5), the best strategy depends on the search space dimension and the chosen budget. Small budgets and larger dimensions favor smaller domain widths.
Document type :
Conference papers
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download

Contributor : Dimo Brockhoff Connect in order to contact the contributor
Submitted on : Tuesday, July 2, 2019 - 5:07:27 PM
Last modification on : Friday, February 4, 2022 - 3:32:54 AM


Files produced by the author(s)



Dimo Brockhoff, Nikolaus Hansen. The Impact of Sample Volume in Random Search on the bbob Test Suite. GECCO 2019 - The Genetic and Evolutionary Computation Conference, Jul 2019, Prague, Czech Republic. ⟨10.1145/3319619.3326894⟩. ⟨hal-02171213⟩



Record views


Files downloads