Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

On Top-k selection in multi-armed bandits and hidden bipartite graphs

10 references·1 citing·25 second hopsampled

FromToDepth

this work references cited by second hop· second hop is a sample of the most-cited connections

References

2012Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems1,483 cited
2010Best Arm Identification in Multi-Armed Bandits448 cited
2006Action Elimination and Stopping Conditions for the Multi-Armed Bandit and Reinforcement Learning Problems444 cited
2004The Sample Complexity of Exploration in the Multi-Armed Bandit Problem318 cited
2010Pure exploration in finitely-armed and continuous-armed bandits188 cited
2012PAC Subset Selection in Stochastic Multi-armed Bandits188 cited
2012Best Arm Identification: A Unified Approach to Fixed Budget and Fixed Confidence132 cited
2014Combinatorial Pure Exploration of Multi-Armed Bandits104 cited
2010Efficient Selection of Multiple Bandit Arms: Theory and Practice64 cited
2014Optimal PAC Multiple Arm Identification with Applications to Crowdsourcing39 cited

Cited by

2017Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration26 cited

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