SZodixStudyAcademic Library

Dashboard Shelves Open access My library Inbox Notes Write Learn Alerts

More

Ask your library Notifications Quick cite Review

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

On Upper-Confidence Bound Policies for Switching Bandit Problems · Study

WorkOn Upper-Confidence Bound Policies for Switching Bandit Problems

Aurélien Garivier2011

Work2011

On Upper-Confidence Bound Policies for Switching Bandit Problems

Aurélien Garivier · Éric Moulines

455 citations·0/0 files stored·Lecture notes in computer science

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 — 455 citations exist upstream.

References

1997A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting 2002Finite-time Analysis of the Multiarmed Bandit Problem 2006Prediction, Learning, and Games 2002The Nonstochastic Multiarmed Bandit Problem 2003Using confidence bounds for exploitation-exploration trade-offs 1988Restless bandits: activity allocation in a changing world 1998Tracking the Best Expert 1995Sample mean based index policies byO(logn) regret for the multi-armed bandit problem

Cited by

2012Thompson Sampling: An Asymptotically Optimal Finite-Time Analysis 2014Stochastic Multi-Armed-Bandit Problem with Non-stationary Rewards 2016Chasing Demand: Learning and Earning in a Changing Environment 2019Optimal Exploration–Exploitation in a Multi-armed Bandit Problem with Non-stationary Rewards 2014Unimodal Bandits: Regret Lower Bounds and Optimal Algorithms 2014Sequential Learning for Multi-Channel Wireless Network Monitoring With Channel Switching Costs

Related works

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

2008On Upper-Confidence Bound Policies for Non-Stationary Bandit Problemspreprint · 8 shared references 2020Bandit Algorithmsbook · 5 shared references 2019Introduction to Multi-Armed Banditsarticle · 5 shared references 2014From Bandits to Monte-Carlo Tree Search: The Optimistic Principle Applied to Optimization and Planningarticle · 5 shared references 2014Stochastic Multi-Armed-Bandit Problem with Non-stationary Rewardsarticle · 5 shared references 2008Mortal Multi-Armed Banditsarticle · 5 shared references

Details

Year2011

Typeother

Published2011-01-01

VenueLecture notes in computer science

ISSN-L0302-9743

Languageen

Citations455

Files0 public / 0

ShelfAdvanced Bandit Algorithms Research

Identifiers

doi10.1007/978-3-642-24412-4_16

openalex_workW157259654

Links

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

2018Hedging the Drift: Learning to Optimize Under Non-Stationarity

2013Informational confidence bounds for self-normalized averages and applications