Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

Lower Bounds and Selectivity of Weak-Consistent Policies in Stochastic Multi-Armed Bandit Problem

13 references·1 citing·32 second hop

FromToDepth

this work references cited by second hop

References

2002Finite-time Analysis of the Multiarmed Bandit Problem5,980 cited
2006Prediction, Learning, and Games3,176 cited
2002The Nonstochastic Multiarmed Bandit Problem2,210 cited
1952Some aspects of the sequential design of experiments2,183 cited
1997How to use expert advice631 cited
2009Exploration–exploitation tradeoff using variance estimates in multi-armed bandits571 cited
1995Sample mean based index policies byO(logn) regret for the multi-armed bandit problem539 cited
2008Multi-armed bandits in metric spaces353 cited
2004Nearly Tight Bounds for the Continuum-Armed Bandit Problem285 cited
1996Optimal Adaptive Policies for Sequential Allocation Problems219 cited
2014Bandit Algorithms for Tree Search170 cited
2010An Asymptotically Optimal Bandit Algorithm for Bounded Support Models.139 cited
2008Online Optimization in X-Armed Bandits131 cited

Cited by

2020Learning Unknown Service Rates in Queues: A Multiarmed Bandit Approach50 cited

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