Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

On Upper-Confidence Bound Policies for Switching Bandit Problems

8 references·16 citing·28 second hop

FromToDepth

this work references cited by second hop

References

1997A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting20,469 cited
2002Finite-time Analysis of the Multiarmed Bandit Problem5,980 cited
2006Prediction, Learning, and Games3,176 cited
2002The Nonstochastic Multiarmed Bandit Problem2,210 cited
2003Using confidence bounds for exploitation-exploration trade-offs1,189 cited
1988Restless bandits: activity allocation in a changing world1,174 cited
1998Tracking the Best Expert557 cited
1995Sample mean based index policies byO(logn) regret for the multi-armed bandit problem539 cited

Cited by

2012Thompson Sampling: An Asymptotically Optimal Finite-Time Analysis381 cited
2014Stochastic Multi-Armed-Bandit Problem with Non-stationary Rewards193 cited
2016Chasing Demand: Learning and Earning in a Changing Environment139 cited
2019Optimal Exploration–Exploitation in a Multi-armed Bandit Problem with Non-stationary Rewards101 cited
2014Unimodal Bandits: Regret Lower Bounds and Optimal Algorithms97 cited
2014Sequential Learning for Multi-Channel Wireless Network Monitoring With Channel Switching Costs83 cited
2018Hedging the Drift: Learning to Optimize Under Non-Stationarity

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

83 cited

2013Informational confidence bounds for self-normalized averages and applications74 cited

2013Dynamic Pricing and Learning: Historical Origins, Current Research, and New Directions67 cited

2019A New Algorithm for Non-stationary Contextual Bandits: Efficient, Optimal, and Parameter-free62 cited

2020Sliding-Window Thompson Sampling for Non-Stationary Settings61 cited

2017Stochastic Online Shortest Path Routing: The Value of Feedback61 cited

2016Dynamic Privacy Pricing: A Multi-Armed Bandit Approach With Time-Variant Rewards54 cited

2013Sequential Transfer in Multi-armed Bandit with Finite Set of Models52 cited

2017The non-stationary stochastic multi-armed bandit problem51 cited

2021An empirical evaluation of active inference in multi-armed bandits45 cited