mlsanityData to 7 Oct 2026

EXPObench: Benchmarking Surrogate-based Optimisation Algorithms on Expensive Black-box Functions

arXiv 2106.04618 ↗First posted 8 Jun 2021cs.LG cs.NE math.OCcited by 9

Not on the map. Why?

Abstract (arXiv)

Surrogate algorithms such as Bayesian optimisation are especially designed for black-box optimisation problems with expensive objectives, such as hyperparameter tuning or simulation-based optimisation. In the literature, these algorithms are usually evaluated with synthetic benchmarks which are well established but have no expensive objective, and only on one or two real-life applications which vary wildly between papers. There is a clear lack of standardisation when it comes to benchmarking surrogate algorithms on real-life, expensive, black-box objective functions. This makes it very difficult to draw conclusions on the effect of algorithmic contributions and to give substantial advice on which method to use when. A new benchmark library, EXPObench, provides first steps towards such a standardisation. The library is used to provide an extensive comparison of six different surrogate algorithms on four expensive optimisation problems from different real-life applications. This has led to new insights regarding the relative importance of exploration, the evaluation time of the objective, and the used model. We also provide rules of thumb for which surrogate algorithm to use in which situation. A further contribution is that we make the algorithms and benchmark problem instances publicly available, contributing to more uniform analysis of surrogate algorithms. Most importantly, we include the performance of the six algorithms on all evaluated problem instances. This results in a unique new dataset that lowers the bar for researching new methods as the number of expensive evaluations required for comparison is significantly reduced.

Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 19 of its 70 references that are in the map. First posted on arXiv 8 Jun 2021.

Builds on

19 of 70 references.

References · 19

  1. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
  2. 2018BOHB: Robust and Efficient Hyperparameter Optimization at Scalecited by 466
  3. 2020NAS-Bench-201: Extending the Scope of Reproducible Neural Architecture Searchcited by 412
  4. 2019NAS-Bench-101: Towards Reproducible Neural Architecture Searchcited by 340
  5. 2019An Open Source AutoML Benchmarkcited by 85
  6. 2019Combinatorial Bayesian Optimization using the Graph Cartesian Productcited by 78
  7. 2019Bayesian Optimisation over Multiple Continuous and Categorical Inputscited by 55
  8. 2021Benchmarking the Performance of Bayesian Optimization across Multiple Experimental Materials Science Domainscited by 46
  9. 2018IOHprofiler: A Benchmarking and Profiling Tool for Iterative Optimization Heuristicscited by 28
  10. 2021DACBench: A Benchmark Library for Dynamic Algorithm Configurationcited by 28
  11. 2019Safe Contextual Bayesian Optimization for Sustainable Room Temperature PID Control Tuningcited by 24
  12. 2020Black-box Mixed-Variable Optimisation using a Surrogate Model that Satisfies Integer Constraintscited by 9
7 more
  1. 2020Continuous surrogate-based optimization algorithms are well-suited for expensive discrete problemscited by 8
  2. 2019pySOT and POAP: An event-driven asynchronous framework for surrogate optimizationcited by 6
  3. 2020Generative Melody Composition with Human-in-the-Loop Bayesian Optimizationcited by 6
  4. 2019Black-box Combinatorial Optimization using Models with Integer-valued Minimacited by 5
  5. 2020Identifying Properties of Real-World Optimisation Problems through a Questionnairecited by 5
  6. 2016Online Optimization with Costly and Noisy Measurements using Random Fourier Expansionscited by 2
  7. 2021Machine learning for improving performance in an evolutionary algorithm for minimum path with uncertain costs given by massively simulated scenarioscited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 1; 2022: 0; 2023: 3; 2024: 3; 2025: 0; 2026: 2.

9 papers.