Preprint · 2012 · Open access

Further Optimal Regret Bounds for Thompson Sampling

Shipra Agrawal, Navin Goyal

arXiv (Cornell University) · Published 15 September 2012 · DOI 10.48550/arxiv.1209.3353

Open PDFView at the publisherCite this paper

In brief

“Further Optimal Regret Bounds for Thompson Sampling” is a 2012 preprint by Shipra Agrawal and Navin Goyal, published in arXiv (Cornell University). OpenAlex counts 341 citations as of 19 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).

Citations
341
Most cited in
2021 (62)
References
26
Authors
2

Abstract

Thompson Sampling is one of the oldest heuristics for multi-armed bandit problems. It is a randomized algorithm based on Bayesian ideas, and has recently generated significant interest after several studies demonstrated it to have better empirical performance compared to the state of the art methods. In this paper, we provide a novel regret analysis for Thompson Sampling that simultaneously proves both the optimal problem-dependent bound of $(1+ε)\sum_i \frac{\ln T}{Δ_i}+O(\frac{N}{ε^2})$ and the first near-optimal problem-independent bound of $O(\sqrt{NT\ln T})$ on the expected regret of this algorithm. Our near-optimal problem-independent bound solves a COLT 2012 open problem of Chapelle and Li. The optimal problem-dependent regret bound for this problem was first proven recently by Kaufmann et al. [ALT 2012]. Our novel martingale-based analysis techniques are conceptually simple, easily extend to distributions other than the Beta distribution, and also extend to the more general contextual bandits setting [Manuscript, Agrawal and Goyal, 2012].

Cite this paper

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

APA 7

Agrawal, S., & Goyal, N. (2012). Further Optimal Regret Bounds for Thompson Sampling. arXiv (Cornell University). https://doi.org/10.48550/arxiv.1209.3353

MLA 9

Agrawal, Shipra, and Navin Goyal. “Further Optimal Regret Bounds for Thompson Sampling.” arXiv (Cornell University), 2012. https://doi.org/10.48550/arxiv.1209.3353.

Chicago

Agrawal, Shipra and Navin Goyal. 2012. “Further Optimal Regret Bounds for Thompson Sampling.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.1209.3353.

Harvard

Agrawal, S. and Goyal, N. (2012) ‘Further Optimal Regret Bounds for Thompson Sampling’, arXiv (Cornell University). doi:10.48550/arxiv.1209.3353.

IEEE

S. Agrawal and N. Goyal, “Further Optimal Regret Bounds for Thompson Sampling,” arXiv (Cornell University), 2012, doi: 10.48550/arxiv.1209.3353.

BibTeX

@misc{agrawal2012further,
  title     = {{Further Optimal Regret Bounds for Thompson Sampling}},
  author    = {Agrawal, Shipra and Goyal, Navin},
  howpublished = {arXiv (Cornell University)},
  year      = {2012},
  doi       = {10.48550/arxiv.1209.3353},
  url       = {https://doi.org/10.48550/arxiv.1209.3353}
}

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

Citations by year

YearCitationsShare of the best year
20171616
20183030
20195252
20205757
20216262
20222121
20231717
20241515
202577
20261111

Topic and keywords

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

  • Thompson sampling
  • multi-armed bandits
  • regret bounds
  • contextual bandits

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?

Agrawal, S., & Goyal, N. (2012). Further Optimal Regret Bounds for Thompson Sampling. arXiv (Cornell University). https://doi.org/10.48550/arxiv.1209.3353

How many times has this paper been cited?

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

Shipra Agrawal, Navin Goyal.

What is the DOI of this paper?

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