SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

Finite-time Analysis of the Multiarmed Bandit Problem · Study

ArticleShelves

ArticleFinite-time Analysis of the Multiarmed Bandit Problem

Peter L. Auer2002

OA

Articlebronze2002

Finite-time Analysis of the Multiarmed Bandit Problem

Peter L. Auer · Nicolò Cesa‐Bianchi · Paul Fischer

5,980 citations·0/0 files stored·Machine Learning

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Bandit Algorithms Research Reinforcement Learning in Robotics Optimization and Search Problems

Abstract

No abstract was published for this record.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 5,980 citations exist upstream.

Cited by

2006Prediction, Learning, and Games 2012Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting 2012Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems 2011An Empirical Evaluation of Thompson Sampling 2020Bandit Algorithms 2011Analysis of Thompson Sampling for the multi-armed bandit problem 2011Improved Algorithms for Linear Stochastic Bandits 2010Why Copy Others? Insights from the Social Learning Strategies Tournament

Details

Year2002

Typearticle

Published2002-05-01

VenueMachine Learning

ISSN-L0885-6125

Languageen

Citations5,980

Files0 public / 0

ShelfAdvanced Bandit Algorithms Research

Identifiers

doi10.1023/a:1013689704352

openalex_workW2168405694

Links

Imported from OpenAlex (CC0) — nothing here is generated.