Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

Informational confidence bounds for self-normalized averages and applications

13 references·2 citing·28 second hop

FromToDepth

this work references cited by second hop

References

2002Finite-time Analysis of the Multiarmed Bandit Problem5,980 cited
2012Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems1,410 cited
2012Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems1,275 cited
2011Improved Algorithms for Linear Stochastic Bandits860 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
2011On Upper-Confidence Bound Policies for Switching Bandit Problems455 cited
2011The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond363 cited
2013KULLBACK-LEIBLER UPPER CONFIDENCE BOUNDS FOR OPTIMAL SEQUENTIAL ALLOCATION274 cited
2010Parametric Bandits: The Generalized Linear Case241 cited
2013Kullback–Leibler upper confidence bounds for optimal sequential allocation181 cited
2008On Upper-Confidence Bound Policies for Non-Stationary Bandit Problems172 cited
2005Minimizing Regret With Label Efficient Prediction82 cited

Cited by

2015Regret Analysis of the Finite-Horizon Gittins Index Strategy for Multi-Armed Bandits68 cited
2016

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

Conservative Bandits

42 cited