Preprint · 2020 · Open access
Scalable Thompson Sampling using Sparse Gaussian Process Models
arXiv (Cornell University), 34 · Published 9 June 2020 · DOI 10.48550/arxiv.2006.05356
In brief
“Scalable Thompson Sampling using Sparse Gaussian Process Models” is a 2020 preprint by Sattar Vakili and 4 co-authors, published in arXiv (Cornell University). OpenAlex counts 22 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
- 22
- Most cited in
- 2024 (4)
- References
- 77
- Authors
- 5
Abstract
Thompson Sampling (TS) from Gaussian Process (GP) models is a powerful tool for the optimization of black-box functions. Although TS enjoys strong theoretical guarantees and convincing empirical performance, it incurs a large computational overhead that scales polynomially with the optimization budget. Recently, scalable TS methods based on sparse GP models have been proposed to increase the scope of TS, enabling its application to problems that are sufficiently multi-modal, noisy or combinatorial to require more than a few hundred evaluations to be solved. However, the approximation error introduced by sparse GPs invalidates all existing regret bounds. In this work, we perform a theoretical and empirical analysis of scalable TS. We provide theoretical guarantees and show that the drastic reduction in computational complexity of scalable TS can be enjoyed without loss in the regret performance over the standard TS. These conceptual claims are validated for practical implementations of scalable TS on synthetic benchmarks and as part of a real-world high-throughput molecular design task.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Vakili, S., Moss, H. B., Artemev, A., Dutordoir, V., & Picheny, V. (2020). Scalable Thompson Sampling using Sparse Gaussian Process Models. arXiv (Cornell University), 34. https://doi.org/10.48550/arxiv.2006.05356
MLA 9
Vakili, Sattar, et al. “Scalable Thompson Sampling using Sparse Gaussian Process Models.” arXiv (Cornell University), vol. 34, 2020. https://doi.org/10.48550/arxiv.2006.05356.
Chicago
Vakili, Sattar, Henry B. Moss, Artem Artemev, Vincent Dutordoir, and Victor Picheny. 2020. “Scalable Thompson Sampling using Sparse Gaussian Process Models.” arXiv (Cornell University) 34. https://doi.org/10.48550/arxiv.2006.05356.
Harvard
Vakili, S. et al. (2020) ‘Scalable Thompson Sampling using Sparse Gaussian Process Models’, arXiv (Cornell University), 34. doi:10.48550/arxiv.2006.05356.
IEEE
S. Vakili, H. B. Moss, A. Artemev, V. Dutordoir, and V. Picheny, “Scalable Thompson Sampling using Sparse Gaussian Process Models,” arXiv (Cornell University), vol. 34, 2020, doi: 10.48550/arxiv.2006.05356.
BibTeX
@misc{vakili2020scalable,
title = {{Scalable Thompson Sampling using Sparse Gaussian Process Models}},
author = {Vakili, Sattar and Moss, Henry B. and Artemev, Artem and Dutordoir, Vincent and Picheny, Victor},
howpublished = {arXiv (Cornell University)},
year = {2020},
volume = {34},
doi = {10.48550/arxiv.2006.05356},
url = {https://doi.org/10.48550/arxiv.2006.05356}
}
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 | 3 | |
| 2021 | 3 | |
| 2022 | 2 | |
| 2023 | 3 | |
| 2024 | 4 | |
| 2025 | 4 | |
| 2026 | 3 |
Topic and keywords
Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Bandit Algorithms Research
- Thompson sampling
- regret bounds
- black-box optimization
- approximation error
- combinatorial 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?
Vakili, S., Moss, H. B., Artemev, A., Dutordoir, V., & Picheny, V. (2020). Scalable Thompson Sampling using Sparse Gaussian Process Models. arXiv (Cornell University), 34. https://doi.org/10.48550/arxiv.2006.05356
How many times has this paper been cited?
22 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?
Sattar Vakili, Henry B. Moss, Artem Artemev, Vincent Dutordoir, Victor Picheny.
What is the DOI of this paper?
10.48550/arxiv.2006.05356, permanently at https://doi.org/10.48550/arxiv.2006.05356. 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.