Benchmarking the pure random search on the BBOB-2009 noisy testbed

Anne Auger; Raymond Ros

doi:10.1145/1570256.1570348

Benchmarking the pure random search on the BBOB-2009 noisy testbed

Anne Auger
, Raymond Ros

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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 106 times the search space dimension. With this budget the algorithm is not able to solve any single function of the testbed.

Original language	English
Title of host publication	Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009
Publisher	Association for Computing Machinery
Pages	2485-2489
Number of pages	5
ISBN (Print)	9781605583259
DOIs	https://doi.org/10.1145/1570256.1570348
Publication status	Published - 1 Jan 2009
Externally published	Yes
Event	11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009 - Montreal, QC, Canada Duration: 8 Jul 2009 → 12 Jul 2009

Publication series

Name	Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009
Volume	2009-January

Conference

Conference	11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009
Country/Territory	Canada
City	Montreal, QC
Period	8/07/09 → 12/07/09

Keywords

Benchmarking
Black-box optimization
Evolutionary com- putation
Monte-Carlo
Pure random search

Access to Document

10.1145/1570256.1570348

Cite this

Auger, A., & Ros, R. (2009). Benchmarking the pure random search on the BBOB-2009 noisy testbed. In Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009 (pp. 2485-2489). (Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009; Vol. 2009-January). Association for Computing Machinery. https://doi.org/10.1145/1570256.1570348

@inproceedings{c7b9a28833bd433196e85ed0bd2966c3,

title = "Benchmarking the pure random search on the BBOB-2009 noisy testbed",

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 106 times the search space dimension. With this budget the algorithm is not able to solve any single function of the testbed.",

keywords = "Benchmarking, Black-box optimization, Evolutionary com- putation, Monte-Carlo, Pure random search",

author = "Anne Auger and Raymond Ros",

note = "Publisher Copyright: {\textcopyright} 2009 ACM.; 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009 ; Conference date: 08-07-2009 Through 12-07-2009",

year = "2009",

month = jan,

day = "1",

doi = "10.1145/1570256.1570348",

language = "English",

isbn = "9781605583259",

series = "Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009",

publisher = "Association for Computing Machinery",

pages = "2485--2489",

booktitle = "Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009",

}

Auger, A & Ros, R 2009, Benchmarking the pure random search on the BBOB-2009 noisy testbed. in Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009. Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009, vol. 2009-January, Association for Computing Machinery, pp. 2485-2489, 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009, Montreal, QC, Canada, 8/07/09. https://doi.org/10.1145/1570256.1570348

Benchmarking the pure random search on the BBOB-2009 noisy testbed. / Auger, Anne; Ros, Raymond.
Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009. Association for Computing Machinery, 2009. p. 2485-2489 (Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009; Vol. 2009-January).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Benchmarking the pure random search on the BBOB-2009 noisy testbed

AU - Auger, Anne

AU - Ros, Raymond

PY - 2009/1/1

Y1 - 2009/1/1

N2 - 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 106 times the search space dimension. With this budget the algorithm is not able to solve any single function of the testbed.

AB - 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 106 times the search space dimension. With this budget the algorithm is not able to solve any single function of the testbed.

KW - Benchmarking

KW - Black-box optimization

KW - Evolutionary com- putation

KW - Monte-Carlo

KW - Pure random search

UR - https://www.scopus.com/pages/publications/85133049666

U2 - 10.1145/1570256.1570348

DO - 10.1145/1570256.1570348

M3 - Conference contribution

AN - SCOPUS:85133049666

SN - 9781605583259

T3 - Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009

SP - 2485

EP - 2489

BT - Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009

PB - Association for Computing Machinery

T2 - 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009

Y2 - 8 July 2009 through 12 July 2009

ER -

Benchmarking the pure random search on the BBOB-2009 noisy testbed

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this