Preprint · 2024 · Open access

Fast, Precise Thompson Sampling for Bayesian Optimization

David Sweet

arXiv (Cornell University) · Published 26 November 2024 · DOI 10.48550/arxiv.2411.17071

Open PDFView at the publisherCite this paper

In brief

“Fast, Precise Thompson Sampling for Bayesian Optimization” is a 2024 preprint by David Sweet, published in arXiv (Cornell University). OpenAlex counts 1 citations as of 19 November 2026. It is open access under a CC BY licence: the full text is free to read at arXiv (Cornell University).

Citations
1
Most cited in
2026 (1)
References
16
Authors
1

Abstract

Thompson sampling (TS) has optimal regret and excellent empirical performance in multi-armed bandit problems. Yet, in Bayesian optimization, TS underperforms popular acquisition functions (e.g., EI, UCB). TS samples arms according to the probability that they are optimal. A recent algorithm, P-Star Sampler (PSS), performs such a sampling via Hit-and-Run. We present an improved version, Stagger Thompson Sampler (STS). STS more precisely locates the maximizer than does TS using less computation time. We demonstrate that STS outperforms TS, PSS, and other acquisition methods in numerical experiments of optimizations of several test functions across a broad range of dimension. Additionally, since PSS was originally presented not as a standalone acquisition method but as an input to a batching algorithm called Minimal Terminal Variance (MTV), we also demon-strate that STS matches PSS performance when used as the input to MTV.

Cite this paper

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

APA 7

Sweet, D. (2024). Fast, Precise Thompson Sampling for Bayesian Optimization. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2411.17071

MLA 9

Sweet, David. “Fast, Precise Thompson Sampling for Bayesian Optimization.” arXiv (Cornell University), 2024. https://doi.org/10.48550/arxiv.2411.17071.

Chicago

Sweet, David. 2024. “Fast, Precise Thompson Sampling for Bayesian Optimization.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.2411.17071.

Harvard

Sweet, D. (2024) ‘Fast, Precise Thompson Sampling for Bayesian Optimization’, arXiv (Cornell University). doi:10.48550/arxiv.2411.17071.

IEEE

D. Sweet, “Fast, Precise Thompson Sampling for Bayesian Optimization,” arXiv (Cornell University), 2024, doi: 10.48550/arxiv.2411.17071.

BibTeX

@misc{sweet2024fast,
  title     = {{Fast, Precise Thompson Sampling for Bayesian Optimization}},
  author    = {Sweet, David},
  howpublished = {arXiv (Cornell University)},
  year      = {2024},
  doi       = {10.48550/arxiv.2411.17071},
  url       = {https://doi.org/10.48550/arxiv.2411.17071}
}

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

Topic and keywords

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

  • Thompson sampling
  • Bayesian optimization
  • hit-and-run
  • acquisition functions
  • multi-armed bandits
  • high-dimensional 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?

Sweet, D. (2024). Fast, Precise Thompson Sampling for Bayesian Optimization. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2411.17071

How many times has this paper been cited?

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

David Sweet.

What is the DOI of this paper?

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