Name
Title | ||
|---|---|---|
Comparing results of 31 algorithms from the black-box optimization benchmarking BBOB-2009 |
Abstract | ||
|---|---|---|
This paper presents results of the BBOB-2009 benchmarking of 31 search algorithms on 24 noiseless functions in a black-box optimization scenario in continuous domain. The runtime of the algorithms, measured in number of function evaluations, is investigated and a connection between a single convergence graph and the runtime distribution is uncovered. Performance is investigated for different dimensions up to 40-D, for different target precision values, and in different subgroups of functions. Searching in larger dimension and multi-modal functions appears to be more difficult. The choice of the best algorithm also depends remarkably on the available budget of function evaluations. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1145/1830761.1830790 | GECCO (Companion) |
Keywords | Field | DocType |
bbob-2009 benchmarking,different dimension,multi-modal function,function evaluation,best algorithm,noiseless function,black-box optimization,different subgroup,available budget,runtime distribution,different target precision value,benchmarking,search algorithm | Convergence (routing),Graph,Mathematical optimization,Search algorithm,Computer science,Test functions for optimization,Algorithm,Theoretical computer science,Artificial intelligence,Black box,Benchmarking,Machine learning | Conference |
Citations | PageRank | References |
114 | 4.53 | 29 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nikolaus Hansen | 1 | 723 | 51.44 |
| Anne Auger | 2 | 1198 | 77.81 |
| Raymond Ros | 3 | 211 | 12.69 |
| Steffen Finck | 4 | 143 | 9.27 |
| Petr Pošík | 5 | 210 | 15.44 |