the open
    research
    Contribute
    Back to the reading lists

    Machine learning foundations· 2002

    Finite-time Analysis of the Multiarmed Bandit Problem

    Peter Auer (first author) · 2002

    Read the original

    DOI 10.1023/a:1013689704352OpenAlex W2168405694

    On the reading lists

    Why it matters

    Established finite-time regret guarantees for simple upper-confidence-bound exploration strategies.

    Condensed from the expert lists' notes.

    The record

    First released
    2002 (from OpenAlex)
    Citations
    5,983 citations, as counted by OpenAlex (CC0)
    Named by
    both expert lists
    Score
    0.567 · computed rank 173 · consensus 0.74, must-read 1, citations percentile 0.7 (2000s · foundations), awards 0, existing lists 0. Method

    Editor's notes

    • Readability check: pass: UCB and its regret bound; short. (AI draft (Claude), not yet reviewed, 2026-10-29)

    Data sources

    Catalogue data from OpenAlex (CC0), Crossref (CC0 metadata; no abstracts are shown), arXiv, and Papers With Code (CC BY-SA 4.0). Each count names its source. See the method.