mlsanityData to 7 Oct 2026

Optimal Initialization of Batch Bayesian Optimization

arXiv 2404.17997 ↗First posted 27 Apr 2024cs.LG stat.MLcited by 2

Not on the map. Why?

Abstract (arXiv)

Field experiments and computer simulations are effective but time-consuming methods of measuring the quality of engineered systems at different settings. To reduce the total time required, experimenters may employ Bayesian optimization, which is parsimonious with measurements, and take measurements of multiple settings simultaneously, in a batch. In practice, experimenters use very few batches, thus, it is imperative that each batch be as informative as possible. Typically, the initial batch in a Batch Bayesian Optimization (BBO) is constructed from a quasi-random sample of settings values. We propose a batch-design acquisition function, Minimal Terminal Variance (MTV), that designs a batch by optimization rather than random sampling. MTV adapts a design criterion function from Design of Experiments, called I-Optimality, which minimizes the variance of the post-evaluation estimates of quality, integrated over the entire space of settings. MTV weights the integral by the probability that a setting is optimal, making it able to design not only an initial batch but all subsequent batches, as well. Applicability to both initialization and subsequent batches is novel among acquisition functions. Numerical experiments on test functions and simulators show that MTV compares favorably to other BBO methods.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 23 of its 47 references that are in the map. First posted on arXiv 27 Apr 2024.

Builds on

23 of 47 references.

References · 23

  1. 2018GPyTorch: Blackbox Matrix-Matrix Gaussian Process Inference with GPU Accelerationcited by 603
  2. 2017Max-value Entropy Search for Efficient Bayesian Optimizationcited by 202
  3. 2021Bayesian Optimization is Superior to Random Search for Machine Learning Hyperparameter Tuning: Analysis of the Black-Box Optimization Challenge 2020cited by 146
  4. 2017Constrained Bayesian Optimization with Noisy Experimentscited by 103
  5. 2020Scalable Constrained Bayesian Optimizationcited by 84
  6. 2018Simple random search provides a competitive approach to reinforcement learningcited by 75
  7. 2022Recent Advances in Bayesian Optimizationcited by 74
  8. 2019Tuning Hyperparameters without Grad Students: Scalable and Robust Bayesian Optimisation with Dragonflycited by 66
  9. 2017The reparameterization trick for acquisition functionscited by 61
  10. 2021GIBBON: General-purpose Information-Based Bayesian OptimisatioNcited by 47
  11. 2020Efficient Nonmyopic Bayesian Optimization via One-Shot Multi-Step Treescited by 41
  12. 2019BoTorch: A Framework for Efficient Monte-Carlo Bayesian Optimizationcited by 28
11 more
  1. 2021Diversified Sampling for Batched Bayesian Optimization with Determinantal Point Processescited by 23
  2. 2019Bayesian Optimization for Policy Search via Online-Offline Experimentationcited by 20
  3. 2023A/B Testing: A Systematic Literature Reviewcited by 16
  4. 2021Bayesian Optimization in Materials Science: A Surveycited by 9
  5. 2021A portfolio approach to massively parallel Bayesian optimizationcited by 9
  6. 2024Improving sample efficiency of high dimensional Bayesian optimization with MCMCcited by 9
  7. 2016A sequential Monte Carlo approach to Thompson sampling for Bayesian optimizationcited by 7
  8. 2017Asynchronous Parallel Bayesian Optimisation via Thompson Samplingcited by 7
  9. 2023SOBER: Highly Parallel Bayesian Optimization and Bayesian Quadrature over Discrete and Mixed Spacescited by 7
  10. 2019DQN with model-based exploration: efficient learning on environments with sparse rewardscited by 6
  11. 2018An Efficient Algorithm for Elastic I-optimal Design of Generalized Linear Modelscited by 1

Built on by

Cited by year

Citing papers per year: 2025: 2.

2 papers.