Preprint · 2017 · Open access
Budgeted Batch Bayesian Optimization With Unknown Batch Sizes
arXiv (Cornell University) · Published 15 March 2017 · DOI 10.48550/arxiv.1703.04842
In brief
“Budgeted Batch Bayesian Optimization With Unknown Batch Sizes” is a 2017 preprint by Vu Nguyen and 4 co-authors, published in arXiv (Cornell University). OpenAlex counts 10 citations as of 19 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).
- Citations
- 10
- Most cited in
- 2021 (3)
- References
- 50
- Authors
- 5
Abstract
Parameter settings profoundly impact the performance of machine learning algorithms and laboratory experiments. The classical grid search or trial-error methods are exponentially expensive in large parameter spaces, and Bayesian optimization (BO) offers an elegant alternative for global optimization of black box functions. In situations where the black box function can be evaluated at multiple points simultaneously, batch Bayesian optimization is used. Current batch BO approaches are restrictive in that they fix the number of evaluations per batch, and this can be wasteful when the number of specified evaluations is larger than the number of real maxima in the underlying acquisition function. We present the Budgeted Batch Bayesian Optimization (B3O) for hyper-parameter tuning and experimental design - we identify the appropriate batch size for each iteration in an elegant way. To set the batch size flexible, we use the infinite Gaussian mixture model (IGMM) for automatically identifying the number of peaks in the underlying acquisition functions. We solve the intractability of estimating the IGMM directly from the acquisition function by formulating the batch generalized slice sampling to efficiently draw samples from the acquisition function. We perform extensive experiments for both synthetic functions and two real world applications - machine learning hyper-parameter tuning and experimental design for alloy hardening. We show empirically that the proposed B3O outperforms the existing fixed batch BO approaches in finding the optimum whilst requiring a fewer number of evaluations, thus saving cost and time.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Nguyen, V., Rana, S., Gupta, S., Li, C., & Venkatesh, S. (2017). Budgeted Batch Bayesian Optimization With Unknown Batch Sizes. arXiv (Cornell University). https://doi.org/10.48550/arxiv.1703.04842
MLA 9
Nguyen, Vu, et al. “Budgeted Batch Bayesian Optimization With Unknown Batch Sizes.” arXiv (Cornell University), 2017. https://doi.org/10.48550/arxiv.1703.04842.
Chicago
Nguyen, Vu, Santu Rana, Sunil Gupta, Cheng Li, and Svetha Venkatesh. 2017. “Budgeted Batch Bayesian Optimization With Unknown Batch Sizes.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.1703.04842.
Harvard
Nguyen, V. et al. (2017) ‘Budgeted Batch Bayesian Optimization With Unknown Batch Sizes’, arXiv (Cornell University). doi:10.48550/arxiv.1703.04842.
IEEE
V. Nguyen, S. Rana, S. Gupta, C. Li, and S. Venkatesh, “Budgeted Batch Bayesian Optimization With Unknown Batch Sizes,” arXiv (Cornell University), 2017, doi: 10.48550/arxiv.1703.04842.
BibTeX
@misc{nguyen2017budgeted,
title = {{Budgeted Batch Bayesian Optimization With Unknown Batch Sizes}},
author = {Nguyen, Vu and Rana, Santu and Gupta, Sunil and Li, Cheng and Venkatesh, Svetha},
howpublished = {arXiv (Cornell University)},
year = {2017},
doi = {10.48550/arxiv.1703.04842},
url = {https://doi.org/10.48550/arxiv.1703.04842}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2018 | 2 | |
| 2020 | 2 | |
| 2021 | 3 | |
| 2024 | 3 |
Topic and keywords
Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Bandit Algorithms Research
- batch Bayesian optimization
- infinite Gaussian mixture model
- acquisition functions
- hyperparameter optimization
- experimental design
- alloy hardening
- black-box optimization
Work with this paper
Most-cited papers in Decision Sciences
- The PRISMA 2020 statement: an updated guideline for reporting systematic reviewsMatthew James Page, Joanne E. McKenzie, Patrick M. Bossuyt and 23 more · BMJ · 2021 · 144,919 citations
- Evaluating Structural Equation Models with Unobservable Variables and Measurement ErrorClaes Fornell, David F. Larcker · Journal of Marketing Research · 1981 · 118,336 citations
- Cutoff criteria for fit indexes in covariance structure analysis: Conventional criteria versus new alternativesLi‐tze Hu, Peter M. Bentler · Structural Equation Modeling A Multidisciplinary Journal · 1999 · 117,461 citations
- Common method biases in behavioral research: A critical review of the literature and recommended remedies.Philip M. Podsakoff, SCOTT B. MACKENZIE, Jeong Yeon Lee and 1 more · Journal of Applied Psychology · 2003 · 89,248 citations
- Preferred reporting items for systematic reviews and meta-analyses: the PRISMA statementDavid Moher, Alessandro Liberati, Jennifer Tetzlaff and 2 more · BMJ · 2009 · 85,524 citations
Questions about this paper
How do I cite this paper in APA style?
Nguyen, V., Rana, S., Gupta, S., Li, C., & Venkatesh, S. (2017). Budgeted Batch Bayesian Optimization With Unknown Batch Sizes. arXiv (Cornell University). https://doi.org/10.48550/arxiv.1703.04842
How many times has this paper been cited?
10 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at arXiv (Cornell University): sign in and open the PDF from this page.
Who wrote this paper?
Vu Nguyen, Santu Rana, Sunil Gupta, Cheng Li, Svetha Venkatesh.
What is the DOI of this paper?
10.48550/arxiv.1703.04842, permanently at https://doi.org/10.48550/arxiv.1703.04842. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.