Preprint · 2019 · Open access

BoTorch: A Framework for Efficient Monte-Carlo Bayesian Optimization

Maximilian Balandat, Brian Karrer, Daniel Jiang, Samuel Daulton, Benjamin Letham, Andrew Gordon Wilson, Eytan Bakshy

arXiv (Cornell University), 33, 21524–21538 · Published 14 October 2019 · DOI 10.48550/arxiv.1910.06403

Open PDFView at the publisherCite this paper

In brief

“BoTorch: A Framework for Efficient Monte-Carlo Bayesian Optimization” is a 2019 preprint by Maximilian Balandat and 6 co-authors, published in arXiv (Cornell University). OpenAlex counts 1,232 citations as of 19 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).

Citations
1,232
Most cited in
2026 (337)
References
109
Authors
7

Abstract

Bayesian optimization provides sample-efficient global optimization for a broad range of applications, including automatic machine learning, engineering, physics, and experimental design. We introduce BoTorch, a modern programming framework for Bayesian optimization that combines Monte-Carlo (MC) acquisition functions, a novel sample average approximation optimization approach, auto-differentiation, and variance reduction techniques. BoTorch's modular design facilitates flexible specification and optimization of probabilistic models written in PyTorch, simplifying implementation of new acquisition functions. Our approach is backed by novel theoretical convergence results and made practical by a distinctive algorithmic foundation that leverages fast predictive distributions, hardware acceleration, and deterministic optimization. We also propose a novel "one-shot" formulation of the Knowledge Gradient, enabled by a combination of our theoretical and software contributions. In experiments, we demonstrate the improved sample efficiency of BoTorch relative to other popular libraries.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Balandat, M., Karrer, B., Jiang, D., Daulton, S., Letham, B., Wilson, A. G., & Bakshy, E. (2019). BoTorch: A Framework for Efficient Monte-Carlo Bayesian Optimization. arXiv (Cornell University), 33, 21524–21538. https://doi.org/10.48550/arxiv.1910.06403

MLA 9

Balandat, Maximilian, et al. “BoTorch: A Framework for Efficient Monte-Carlo Bayesian Optimization.” arXiv (Cornell University), vol. 33, 2019, pp. 21524–21538. https://doi.org/10.48550/arxiv.1910.06403.

Chicago

Balandat, Maximilian, Brian Karrer, Daniel Jiang, Samuel Daulton, Benjamin Letham, Andrew Gordon Wilson, and Eytan Bakshy. 2019. “BoTorch: A Framework for Efficient Monte-Carlo Bayesian Optimization.” arXiv (Cornell University) 33: 21524–21538. https://doi.org/10.48550/arxiv.1910.06403.

Harvard

Balandat, M. et al. (2019) ‘BoTorch: A Framework for Efficient Monte-Carlo Bayesian Optimization’, arXiv (Cornell University), 33, pp. 21524–21538. doi:10.48550/arxiv.1910.06403.

IEEE

M. Balandat et al., “BoTorch: A Framework for Efficient Monte-Carlo Bayesian Optimization,” arXiv (Cornell University), vol. 33, pp. 21524–21538, 2019, doi: 10.48550/arxiv.1910.06403.

BibTeX

@misc{balandat2019botorch,
  title     = {{BoTorch: A Framework for Efficient Monte-Carlo Bayesian Optimization}},
  author    = {Balandat, Maximilian and Karrer, Brian and Jiang, Daniel and Daulton, Samuel and Letham, Benjamin and Wilson, Andrew Gordon and Bakshy, Eytan},
  howpublished = {arXiv (Cornell University)},
  year      = {2019},
  volume    = {33},
  pages     = {21524--21538},
  doi       = {10.48550/arxiv.1910.06403},
  url       = {https://doi.org/10.48550/arxiv.1910.06403}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
201811
201933
20202727
20218989
2022110110
2023174174
2024215215
2025275275
2026337337

Topic and keywords

Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Bandit Algorithms Research

  • Bayesian optimization
  • sample average approximation
  • auto-differentiation
  • variance reduction
  • PyTorch
  • knowledge gradient
  • sample efficiency
  • global optimization

Work with this paper

Most-cited papers in Decision Sciences

All highly cited Decision Sciences papers

Questions about this paper

How do I cite this paper in APA style?

Balandat, M., Karrer, B., Jiang, D., Daulton, S., Letham, B., Wilson, A. G., & Bakshy, E. (2019). BoTorch: A Framework for Efficient Monte-Carlo Bayesian Optimization. arXiv (Cornell University), 33, 21524–21538. https://doi.org/10.48550/arxiv.1910.06403

How many times has this paper been cited?

1,232 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?

Maximilian Balandat, Brian Karrer, Daniel Jiang, Samuel Daulton, Benjamin Letham, Andrew Gordon Wilson, Eytan Bakshy.

What is the DOI of this paper?

10.48550/arxiv.1910.06403, permanently at https://doi.org/10.48550/arxiv.1910.06403. 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.