.png){kind=icon}
.png){kind=icon}
Return
Black-Box Optimization Revisited: Improving Algorithm Selection Wizards Through Massive Benchmarking
.png){kind=icon}
OA
AI
DOI：10.1109/TEVC.2021.3108185.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Existing studies in black-box optimization suffer from low generalizability, caused by a typically selective choice of problem instances used for training and testing of different optimization algorithms. Among other issues, this practice promotes overfitting and poor-performing user guidelines. We address this shortcoming by introducing in this work a general-purpose algorithm selection wizard that was designed and tested on a previously unseen breadth of black-box optimization problems, ranging from academic benchmarks to real-world applications, from discrete over numerical to mixed-integer problems, from small to very large-scale problems, from noisy over dynamic to static problems, etc. Not only did we use the already very extensive benchmark environment available in Nevergrad, but we also extended it significantly by adding a number of additional benchmark suites, including Pyomo, Photonics, large-scale global optimization (LSGO), and MuJoCo. Our wizard achieves competitive performance on all benchmark suites. It significantly outperforms previous state-of-the-art algorithms on some of the suites, including YABBOB and LSGO. Its excellent performance is obtained without any task-specific parametrization. The algorithm selection wizard, all of its base solvers, as well as the benchmark suites are available for reproducible research in the open-source Nevergrad platform.
Keywords:
Benchmark testing
Optimization
Linear programming
Reproducibility of results
Heuristic algorithms
Open source software
Training
Benchmarking
black-box optimization
Journal
IF:
12
Papers:
1.8K
Citations:
2.4W
Organization
View more organizations