Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

Information Complexity in Bandit Subset Selection

10 references·5 citing·29 second hop

FromToDepth

this work references cited by second hop

References

2002Finite-time Analysis of the Multiarmed Bandit Problem5,980 cited
2010Best Arm Identification in Multi-Armed Bandits418 cited
2006Action Elimination and Stopping Conditions for the Multi-Armed Bandit and Reinforcement Learning Problems410 cited
2012Thompson Sampling: An Asymptotically Optimal Finite-Time Analysis381 cited
2004The Sample Complexity of Exploration in the Multi-Armed Bandit Problem309 cited
2013KULLBACK-LEIBLER UPPER CONFIDENCE BOUNDS FOR OPTIMAL SEQUENTIAL ALLOCATION274 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
2011A Finite-Time Analysis of Multi-armed Bandits Problems with Kullback-Leibler Divergences121 cited

Cited by

2014Combinatorial Pure Exploration of Multi-Armed Bandits104 cited
2014On correlation and budget constraints in model-based bandit optimization with application to automatic machine learning85 cited
2014Best-Arm Identification in Linear Bandits78 cited
2019Pure Exploration with Multiple Correct Answers76 cited

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

2018

Combinatorial Pure Exploration with Continuous and Separable Reward Functions and Its Applications

60 cited