Preprint · 2018 · Open access
Practical Batch Bayesian Optimization for Less Expensive Functions
arXiv (Cornell University) · Published 5 November 2018 · DOI 10.48550/arxiv.1811.01466
In brief
“Practical Batch Bayesian Optimization for Less Expensive Functions” is a 2018 preprint by Nguyen, Vu and 4 co-authors, published in arXiv (Cornell University). OpenAlex counts 7 citations as of 19 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).
- Citations
- 7
- Most cited in
- 2023 (2)
- References
- 27
- Authors
- 5
Abstract
Bayesian optimization (BO) and its batch extensions are successful for optimizing expensive black-box functions. However, these traditional BO approaches are not yet ideal for optimizing less expensive functions when the computational cost of BO can dominate the cost of evaluating the blackbox function. Examples of these less expensive functions are cheap machine learning models, inexpensive physical experiment through simulators, and acquisition function optimization in Bayesian optimization. In this paper, we consider a batch BO setting for situations where function evaluations are less expensive. Our model is based on a new exploration strategy using geometric distance that provides an alternative way for exploration, selecting a point far from the observed locations. Using that intuition, we propose to use Sobol sequence to guide exploration that will get rid of running multiple global optimization steps as used in previous works. Based on the proposed distance exploration, we present an efficient batch BO approach. We demonstrate that our approach outperforms other baselines and global optimization methods when the function evaluations are less expensive.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Vu, N., Gupta, S., Rana, S., Li, C., & Venkatesh, S. (2018). Practical Batch Bayesian Optimization for Less Expensive Functions. arXiv (Cornell University). https://doi.org/10.48550/arxiv.1811.01466
MLA 9
Vu, Nguyen,, et al. “Practical Batch Bayesian Optimization for Less Expensive Functions.” arXiv (Cornell University), 2018. https://doi.org/10.48550/arxiv.1811.01466.
Chicago
Vu, Nguyen,, Sunil Gupta, Santu Rana, Cheng Li, and Svetha Venkatesh. 2018. “Practical Batch Bayesian Optimization for Less Expensive Functions.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.1811.01466.
Harvard
Vu, N. et al. (2018) ‘Practical Batch Bayesian Optimization for Less Expensive Functions’, arXiv (Cornell University). doi:10.48550/arxiv.1811.01466.
IEEE
N. Vu, S. Gupta, S. Rana, C. Li, and S. Venkatesh, “Practical Batch Bayesian Optimization for Less Expensive Functions,” arXiv (Cornell University), 2018, doi: 10.48550/arxiv.1811.01466.
BibTeX
@misc{vu2018practical,
title = {{Practical Batch Bayesian Optimization for Less Expensive Functions}},
author = {Vu, Nguyen, and Gupta, Sunil and Rana, Santu and Li, Cheng and Venkatesh, Svetha},
howpublished = {arXiv (Cornell University)},
year = {2018},
doi = {10.48550/arxiv.1811.01466},
url = {https://doi.org/10.48550/arxiv.1811.01466}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2020 | 1 | |
| 2023 | 2 | |
| 2024 | 1 | |
| 2025 | 2 | |
| 2026 | 1 |
Topic and keywords
Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Bandit Algorithms Research
- batch Bayesian optimization
- Sobol sequence
- exploration strategy
- expensive function evaluations
- global 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?
Vu, N., Gupta, S., Rana, S., Li, C., & Venkatesh, S. (2018). Practical Batch Bayesian Optimization for Less Expensive Functions. arXiv (Cornell University). https://doi.org/10.48550/arxiv.1811.01466
How many times has this paper been cited?
7 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?
Nguyen, Vu, Sunil Gupta, Santu Rana, Cheng Li, Svetha Venkatesh.
What is the DOI of this paper?
10.48550/arxiv.1811.01466, permanently at https://doi.org/10.48550/arxiv.1811.01466. 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.