the open
    research
    Contribute
    Back to the reading lists

    Machine learning foundations· 1985

    Asymptotically Efficient Adaptive Allocation Rules

    T. L. Lai (first author) · 1985

    Read the original

    DOI 10.1016/0196-8858(85)90002-8OpenAlex W2009551863

    On the reading lists

    Why it matters

    Established logarithmic regret lower bounds and asymptotically efficient bandit allocation strategies.

    Condensed from the expert lists' notes.

    The record

    First released
    1985 (from OpenAlex)
    Citations
    2,406 citations, as counted by OpenAlex (CC0)
    Named by
    the chatgpt list only
    Score
    0.256 · computed rank 717 · consensus 0.27, must-read 0, citations percentile 0.5 (1980s · foundations), awards 0, existing lists 0. Method

    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.