Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 244

The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.

Bandits With Heavy Tail

Bubeck, Sebastien, Cesa-Bianchi, Nicolo, Lugosi, Gabor · 2013 · IEEE Transactions on Information Theory

Abstract

The stochastic multiarmed bandit problem is well understood when the reward distributions are sub-Gaussian. In this paper, we examine the bandit problem under the weaker assumption that the distributions have moments of order$1 + \varepsilon $, for some$ \varepsilon \in (0,1]$. Surprisingly, moments of order 2 (i.e., finite variance) are sufficient to obtain regret bounds of the same order as under sub-Gaussian reward distributions. In order to achieve such regret, we define sampling strategies based on refined estimators of the mean such as the truncated empirical mean, Catoni's$M$-estimator, and the median-of-means estimator. We also derive matching lower bounds that also show that the best achievable regret deteriorates when$ \varepsilon < 1$.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tit.2013.2277869

Cites

5 of 5 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 5 references

Cited by

See all 244

Metadata

Authors
Bubeck, S., Cesa-Bianchi, N., & Lugosi, G.
Venue
IEEE Transactions on Information Theory
Published
2013-11
Volume
59
Issue
11
Pages
7711-7717
ISSN
  • 0018-9448 (ISSN-L)
  • 1557-9654
OpenAlex
W1984332158
Cited by
244
References
5
FWCI
9.97
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Bandits With Heavy Tail. https://app.cochat.ai/papers/10.1109/tit.2013.2277869
The paper
Bubeck, S., Cesa-Bianchi, N., & Lugosi, G. (2013). Bandits With Heavy Tail. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2013.2277869

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.