References

• 2012Practical Bayesian Optimization of Machine Learning Algorithms6,690 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
• 2000Interpolation of Spatial Data: Some Theory for Kriging1,916 cited
• 2012Thompson Sampling for Contextual Bandits with Linear Payoffs600 cited
• 2012Entropy search for information-efficient global optimization456 cited
• 2011Convergence rates of efficient global optimization algorithms454 cited
• 2012Thompson Sampling: An Asymptotically Optimal Finite-Time Analysis381 cited
• 2013Bayesian optimization in high dimensions via random embeddings244 cited
• 2014From Bandits to Monte-Carlo Tree Search: The Optimistic Principle Applied to Optimization and Planning233 cited
• 2012Optimistic bayesian sampling in contextual-bandit problems213 cited
• 2010Convergence properties of the expected improvement algorithm with fixed mean and covariance functions183 cited
• 2014Bandit Algorithms for Tree Search170 cited
• 2011Portfolio allocation for Bayesian optimization160 cited