References

• 2012Practical Bayesian Optimization of Machine Learning Algorithms6,690 cited
• 2002Finite-time Analysis of the Multiarmed Bandit Problem5,980 cited
• 2006Prediction, Learning, and Games3,176 cited
• 2012Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting2,098 cited
• 2010A Tutorial on Bayesian Optimization of Expensive Cost Functions, with Application to Active User Modeling and Hierarchical Reinforcement Learning2,053 cited
• 2011An Empirical Evaluation of Thompson Sampling1,000 cited
• 2012Thompson Sampling for Contextual Bandits with Linear Payoffs600 cited
• 2013Multi-Task Bayesian Optimization484 cited
• 2012Entropy search for information-efficient global optimization456 cited
• 2010Best Arm Identification in Multi-Armed Bandits418 cited
• 2010A modern Bayesian look at the multi‐armed bandit408 cited
• 2012Thompson Sampling: An Asymptotically Optimal Finite-Time Analysis381 cited
• 2009Pure Exploration in Multi-armed Bandits Problems365 cited
• 2013Bayesian optimization in high dimensions via random embeddings244 cited
• 2012On Bayesian Upper Confidence Bounds for Bandit Problems210 cited