Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond

4 references·16 citing·32 second hop

FromToDepth

this work references cited by second hop

References

2002Finite-time Analysis of the Multiarmed Bandit Problem5,980 cited
1979Bandit Processes and Dynamic Allocation Indices1,488 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

Cited by

2013KULLBACK-LEIBLER UPPER CONFIDENCE BOUNDS FOR OPTIMAL SEQUENTIAL ALLOCATION274 cited
2013Bandits With Heavy Tail249 cited
2012Optimistic bayesian sampling in contextual-bandit problems213 cited
2014Combinatorial Multi-Armed Bandit and Its Extension to Probabilistically Triggered Arms196 cited
2013Kullback–Leibler upper confidence bounds for optimal sequential allocation181 cited
20121 1 Online Learning of Rested and Restless Bandits141 cited
2017Near-Optimal Regret Bounds for Thompson Sampling118 cited
2012Online Learning of Rested and Restless Bandits114 cited
2017Minimal Exploration in Structured Stochastic Bandits113 cited
2018Stochastic bandits robust to adversarial corruptions111 cited
2018On Bayesian index policies for sequential resource allocation

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

97 cited

2014Modeling Human Decision Making in Generalized Gaussian Multiarmed Bandits80 cited

2013Online Learning under Delayed Feedback78 cited

2019Bandits and Experts in Metric Spaces75 cited

2016Adaptive Contract Design for Crowdsourcing Markets: Bandit Algorithms for Repeated Principal-Agent Problems75 cited

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