Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration

11 references·1 citing·38 second hop

FromToDepth

this work references cited by second hop

References

2014On the Complexity of Best Arm Identification in Multi-Armed Bandit Models790 cited
2002PAC Bounds for Multi-armed Bandit and Markov Decision Processes327 cited
1992Sequential Design of Experiments309 cited
2013Active sequential hypothesis testing243 cited
2014From Bandits to Monte-Carlo Tree Search: The Optimistic Principle Applied to Optimization and Planning233 cited
2013lil' UCB : An Optimal Exploration Algorithm for Multi-Armed Bandits196 cited
2012PAC Subset Selection in Stochastic Multi-armed Bandits188 cited
2014Combinatorial Pure Exploration of Multi-Armed Bandits104 cited
2016An optimal algorithm for the Thresholding Bandit Problem68 cited
2010Efficient Selection of Multiple Bandit Arms: Theory and Practice64 cited
2015On Top-k selection in multi-armed bandits and hidden bipartite graphs31 cited

Cited by

2020An Empirical Process Approach to the Union Bound: Practical Algorithms for Combinatorial and Linear Bandits26 cited

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