Conference paper · 2012
Open Problem: Regret Bounds for Thompson Sampling
Conference on Learning Theory · Published 16 June 2012
In brief
“Open Problem: Regret Bounds for Thompson Sampling” is a 2012 conference paper by Lihong Li and Olivier Chapelle, published in Conference on Learning Theory. OpenAlex counts 15 citations as of 19 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.
- Citations
- 15
- Most cited in
- 2021 (4)
- Field-weighted impact
- 2.76
- References
- 12
- Authors
- 2
Abstract
Contextual multi-armed bandits (Langford and Zhang, 2008) have received substantial interests in recent years due to their wide applications on the Internet, such as new recommendation and advertising. The fundamental challenge here is to balance exploration and exploitation so that the total payoff collected by an algorithm approaches that of an optimal strategy. Exploration techniques… Read the full abstract at the publisher.
Excerpt. This paper is not open access.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Li, L., & Chapelle, O. (2012). Open Problem: Regret Bounds for Thompson Sampling. Conference on Learning Theory. http://proceedings.mlr.press/v23/li12/li12.pdf
MLA 9
Li, Lihong, and Olivier Chapelle. “Open Problem: Regret Bounds for Thompson Sampling.” Conference on Learning Theory, 2012. http://proceedings.mlr.press/v23/li12/li12.pdf.
Chicago
Li, Lihong and Olivier Chapelle. 2012. “Open Problem: Regret Bounds for Thompson Sampling.” Conference on Learning Theory. http://proceedings.mlr.press/v23/li12/li12.pdf.
Harvard
Li, L. and Chapelle, O. (2012) ‘Open Problem: Regret Bounds for Thompson Sampling’, Conference on Learning Theory. Available at: http://proceedings.mlr.press/v23/li12/li12.pdf.
IEEE
L. Li and O. Chapelle, “Open Problem: Regret Bounds for Thompson Sampling,” Conference on Learning Theory, 2012.
BibTeX
@inproceedings{li2012open,
title = {{Open Problem: Regret Bounds for Thompson Sampling}},
author = {Li, Lihong and Chapelle, Olivier},
booktitle = {Conference on Learning Theory},
year = {2012},
url = {http://proceedings.mlr.press/v23/li12/li12.pdf}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2012 | 2 | |
| 2013 | 1 | |
| 2014 | 2 | |
| 2017 | 2 | |
| 2019 | 1 | |
| 2020 | 1 | |
| 2021 | 4 | |
| 2023 | 1 | |
| 2026 | 1 |
Its field-weighted citation impact is 2.76: it has been cited 2.76 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Bandit Algorithms Research
- Thompson sampling
- regret bounds
- contextual bandits
- exploration-exploitation balance
- probability matching
- posterior sampling
- Bayesian reinforcement learning
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?
Li, L., & Chapelle, O. (2012). Open Problem: Regret Bounds for Thompson Sampling. Conference on Learning Theory. http://proceedings.mlr.press/v23/li12/li12.pdf
How many times has this paper been cited?
15 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?
OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.
Who wrote this paper?
Lihong Li, Olivier Chapelle.
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.