Conference paper · 2016 · Open access
Budgeted Batch Bayesian Optimization
Proceedings, 1107–1112 · Published 1 December 2016 · DOI 10.1109/icdm.2016.0144
In brief
“Budgeted Batch Bayesian Optimization” is a 2016 conference paper by Vu Nguyen and 4 co-authors, published in Proceedings. OpenAlex counts 44 citations as of 19 November 2026, which puts it in the top 7% of works published in 2016 by citations. It is open access under a CC BY licence: the full text is free to read at Figshare.
- Citations
- 44
- Most cited in
- 2020 (8)
- Field-weighted impact
- 7.23
- References
- 24
- Authors
- 5
Abstract
Parameter settings profoundly impact the performance of machine learning algorithms and laboratory experiments. The classical 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 functions can be evaluated at multiple points simultaneously, batch Bayesian optimization is used. Current batch BO approaches are restrictive in fixing 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. In particular, 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 benchmark 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. (2016). Budgeted Batch Bayesian Optimization. Proceedings, 1107–1112. https://doi.org/10.1109/icdm.2016.0144
MLA 9
Nguyen, Vu, et al. “Budgeted Batch Bayesian Optimization.” Proceedings, 2016, pp. 1107–1112. https://doi.org/10.1109/icdm.2016.0144.
Chicago
Nguyen, Vu, Santu Rana, Sunil Gupta, Cheng Li, and Svetha Venkatesh. 2016. “Budgeted Batch Bayesian Optimization.” Proceedings: 1107–1112. https://doi.org/10.1109/icdm.2016.0144.
Harvard
Nguyen, V. et al. (2016) ‘Budgeted Batch Bayesian Optimization’, Proceedings, pp. 1107–1112. doi:10.1109/icdm.2016.0144.
IEEE
V. Nguyen, S. Rana, S. Gupta, C. Li, and S. Venkatesh, “Budgeted Batch Bayesian Optimization,” Proceedings, pp. 1107–1112, 2016, doi: 10.1109/icdm.2016.0144.
BibTeX
@inproceedings{nguyen2016budgeted,
title = {{Budgeted Batch Bayesian Optimization}},
author = {Nguyen, Vu and Rana, Santu and Gupta, Sunil and Li, Cheng and Venkatesh, Svetha},
booktitle = {Proceedings},
year = {2016},
pages = {1107--1112},
doi = {10.1109/icdm.2016.0144},
url = {https://doi.org/10.1109/icdm.2016.0144}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2017 | 4 | |
| 2018 | 4 | |
| 2019 | 5 | |
| 2020 | 8 | |
| 2021 | 6 | |
| 2022 | 4 | |
| 2023 | 5 | |
| 2024 | 5 | |
| 2025 | 3 |
Its field-weighted citation impact is 7.23: it has been cited 7.23 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Bandit Algorithms Research
- batch Bayesian optimization
- hyperparameter optimization
- experimental design
- acquisition functions
- infinite Gaussian mixture model
- batch size selection
- black-box optimization
- alloy hardening
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. (2016). Budgeted Batch Bayesian Optimization. Proceedings, 1107–1112. https://doi.org/10.1109/icdm.2016.0144
How many times has this paper been cited?
44 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 Figshare: sign in and open the full text 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.1109/icdm.2016.0144, permanently at https://doi.org/10.1109/icdm.2016.0144. 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.