mlsanityData to 14 Oct 2026

How Bayesian Should Bayesian Optimisation Be?

arXiv 2105.00894 ↗First posted 3 May 2021cs.LG stat.MLcited by 5

Not on the map. Why?

Abstract (arXiv)

Bayesian optimisation (BO) uses probabilistic surrogate models - usually Gaussian processes (GPs) - for the optimisation of expensive black-box functions. At each BO iteration, the GP hyperparameters are fit to previously-evaluated data by maximising the marginal likelihood. However, this fails to account for uncertainty in the hyperparameters themselves, leading to overconfident model predictions. This uncertainty can be accounted for by taking the Bayesian approach of marginalising out the model hyperparameters. We investigate whether a fully-Bayesian treatment of the Gaussian process hyperparameters in BO (FBBO) leads to improved optimisation performance. Since an analytic approach is intractable, we compare FBBO using three approximate inference schemes to the maximum likelihood approach, using the Expected Improvement (EI) and Upper Confidence Bound (UCB) acquisition functions paired with ARD and isotropic Matern kernels, across 15 well-known benchmark problems for 4 observational noise settings. FBBO using EI with an ARD kernel leads to the best performance in the noise-free setting, with much less difference between combinations of BO components when the noise is increased. FBBO leads to over-exploration with UCB, but is not detrimental with EI. Therefore, we recommend that FBBO using EI with an ARD kernel as the default choice for BO.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 14 of its 63 references that are in the map. First posted on arXiv 3 May 2021.

Builds on

14 of 63 references.

References · 14

  1. 2015Variational Inference with Normalizing Flowscited by 2,170
  2. 2016Variational Inference: A Review for Statisticianscited by 1,472
  3. 2018A Tutorial on Bayesian Optimizationcited by 744
  4. 2018GPyTorch: Blackbox Matrix-Matrix Gaussian Process Inference with GPU Accelerationcited by 609
  5. 2017Max-value Entropy Search for Efficient Bayesian Optimizationcited by 206
  6. 2014Predictive Entropy Search for Efficient Global Optimization of Black-box Functionscited by 204
  7. 2016Automatic Differentiation Variational Inferencecited by 159
  8. 2014Input Warping for Bayesian Optimization of Non-stationary Functionscited by 67
  9. 2019Greed is Good: Exploration and Exploitation Trade-offs in Bayesian Optimisationcited by 51
  10. 2019Approximate Inference for Fully Bayesian Gaussian Process Regressioncited by 31
  11. 2017Fast Information-theoretic Bayesian Optimisationcited by 19
  12. 2019Deep Gaussian Processes with Importance-Weighted Variational Inferencecited by 19
2 more
  1. 2019A hierarchical expected improvement method for Bayesian optimizationcited by 13
  2. 2020What do you Mean? The Role of the Mean Function in Bayesian Optimisationcited by 7

Built on by

Cited by year

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

5 papers.