Citation map · Study

SZodixStudyAcademic Library

Dashboard Shelves Open access My library Inbox Notes Write Learn Alerts

More

Ask your library Notifications Quick cite Review

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

Best Arm Identification in Multi-Armed Bandits

3 references·16 citing·30 second hop

FromToDepth

this work references cited by second hop

References

2002Finite-time Analysis of the Multiarmed Bandit Problem5,980 cited
2006Prediction, Learning, and Games3,176 cited
1952Some aspects of the sequential design of experiments2,183 cited

Cited by

2018A unified framework for stochastic optimization319 cited
2015Safe Exploration for Optimization with Gaussian Processes294 cited
2013Almost Optimal Exploration in Multi-Armed Bandits258 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
2011Portfolio allocation for Bayesian optimization160 cited
2011Optimistic Optimization of a Deterministic Function without the Knowledge of its Smoothness145 cited
2012Best Arm Identification: A Unified Approach to Fixed Budget and Fixed Confidence132 cited
2014Efficient crowdsourcing of unknown experts using bounded multi-armed bandits128 cited
2013Multi-Armed Bandit with Budget Constraint and Variable Costs120 cited
2014Best-arm identification algorithms for multi-armed bandits in the fixed confidence setting

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

115 cited

2020Simple Bayesian Algorithms for Best-Arm Identification114 cited

2013Information Complexity in Bandit Subset Selection107 cited

2014Combinatorial Pure Exploration of Multi-Armed Bandits104 cited

2018Stagewise Safe Bayesian Optimization with Gaussian Processes88 cited