Sign inGet started
Paper · arXiv

B3O: Scalable Boltzmann Batch Bayesian Optimization

Modern engineering workflows increasingly rely on massive parallel simulation, driving the need for scalable, large-batch Bayesian Optimization (BO). Existing batch BO methods, however, incur large computational cost or rely on approximations that erode batch diversity. We propose B3O (Boltzmann Batch Bayesian Optimization), a framework that reframes batch generation as a pure sampling problem: drawing samples directly from the Boltzmann distribution defined by the acquisition function avoids the bottlenecks of existing large-batch methods. Theoretically, we prove that queries sampled from this distribution incur only negligible additional regret. Empirically, B3O outperforms existing bat...

AuthorsMaximilian Bloor, Liyuan Xu, Hrvoje Stojic et al.
Primary categorycs.LG
Published29 June 2026
Last updated at source29 June 2026
cs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/f2d96d2b-efb2-4fa4-8c06-f47b626c52a3" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.