Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

Best Arm Identification: A Unified Approach to Fixed Budget and Fixed Confidence

6 references·11 citing·24 second hop

FromToDepth

this work references cited by second hop

References

2002Finite-time Analysis of the Multiarmed Bandit Problem5,980 cited
1952Some aspects of the sequential design of experiments2,183 cited
2010Best Arm Identification in Multi-Armed Bandits418 cited
2006Action Elimination and Stopping Conditions for the Multi-Armed Bandit and Reinforcement Learning Problems410 cited
2009Pure Exploration in Multi-armed Bandits Problems365 cited
2012PAC Subset Selection in Stochastic Multi-armed Bandits188 cited

Cited by

2014Best-arm identification algorithms for multi-armed bandits in the fixed confidence setting115 cited
2016Optimal Best Arm Identification with Fixed Confidence115 cited
2020Simple Bayesian Algorithms for Best-Arm Identification114 cited
2021Review on ranking and selection: A new perspective109 cited
2013Information Complexity in Bandit Subset Selection107 cited
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
2017A new acquisition function for Bayesian optimization based on the moment-generating function80 cited
2014

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

Best-Arm Identification in Linear Bandits

78 cited

2016Causal Bandits: Learning Good Interventions via Causal Inference72 cited

2018Combinatorial Pure Exploration with Continuous and Separable Reward Functions and Its Applications60 cited