Choosing a Suitable Acquisition Function for Batch Bayesian Optimization: Comparison of Serial and Monte Carlo Approaches
Imon Mia, Mark Lee, Weijie Xu, William Vandenberghe, and Julia W. P. Hsu

TL;DR
This study compares serial and Monte Carlo batch acquisition functions in Bayesian optimization, finding qUCB most effective for noisy, low-dimensional black-box functions in experimental settings.
Contribution
The paper provides a comparative analysis of batch acquisition functions, recommending qUCB for efficient optimization in practical, low-dimensional experimental scenarios.
Findings
qUCB outperforms qlogEI in noiseless conditions.
qUCB and UCB/LP perform well without noise, with qUCB being most robust.
Empirical results confirm qUCB's effectiveness in real experimental data.
Abstract
Batch Bayesian optimization is widely used for optimizing expensive experimental processes when several samples can be tested together to save time or cost. A central decision in designing a Bayesian optimization campaign to guide experiments is the choice of a batch acquisition function when little or nothing is known about the landscape of the "black box" function to be optimized. To inform this decision, we first compare the performance of serial and Monte Carlo batch acquisition functions on two mathematical functions that serve as proxies for typical materials synthesis and processing experiments. The two functions, both in six dimensions, are the Ackley function, which epitomizes a "needle-in-haystack" search, and the Hartmann function, which exemplifies a "false optimum" problem. Our study evaluates the serial upper confidence bound with local penalization (UCB/LP) batch…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
