References

• 2012Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting2,098 cited
• 2012Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems1,410 cited
• 2011Improved Algorithms for Linear Stochastic Bandits860 cited
• 2014On the Complexity of Best Arm Identification in Multi-Armed Bandit Models704 cited
• 2012Thompson Sampling for Contextual Bandits with Linear Payoffs600 cited
• 2006Action Elimination and Stopping Conditions for the Multi-Armed Bandit and Reinforcement Learning Problems410 cited
• 1959Sequential Design of Experiments394 cited
• 2004The Sample Complexity of Exploration in the Multi-Armed Bandit Problem309 cited
• 1992Sequential Design of Experiments294 cited
• 2013KULLBACK-LEIBLER UPPER CONFIDENCE BOUNDS FOR OPTIMAL SEQUENTIAL ALLOCATION274 cited
• 2014From Bandits to Monte-Carlo Tree Search: The Optimistic Principle Applied to Optimization and Planning233 cited
• 2011X -Armed Bandits205 cited
• 2013lil' UCB : An Optimal Exploration Algorithm for Multi-Armed Bandits196 cited
• 2012PAC Subset Selection in Stochastic Multi-armed Bandits188 cited
• 2006Action Elimination and Stopping Conditions for the Multi-Armed Bandit and Reinforcement Learning Problems