Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
2003.10550
Cited By
Regret and Belief Complexity Trade-off in Gaussian Process Bandits via Information Thresholding
23 March 2020
Amrit Singh Bedi
Dheeraj Peddireddy
Vaneet Aggarwal
Brian M. Sadler
Alec Koppel
Re-assign community
ArXiv
PDF
HTML
Papers citing
"Regret and Belief Complexity Trade-off in Gaussian Process Bandits via Information Thresholding"
7 / 7 papers shown
Title
A Tutorial on Bayesian Optimization
P. Frazier
GP
104
1,782
0
08 Jul 2018
Streaming Sparse Gaussian Process Approximations
T. Bui
Cuong V Nguyen
Richard Turner
45
102
0
19 May 2017
Hyperband: A Novel Bandit-Based Approach to Hyperparameter Optimization
Lisha Li
Kevin Jamieson
Giulia DeSalvo
Afshin Rostamizadeh
Ameet Talwalkar
203
2,321
0
21 Mar 2016
Theoretical Analysis of Bayesian Optimisation with Unknown Gaussian Process Hyper-Parameters
Ziyun Wang
Nando de Freitas
70
89
0
30 Jun 2014
Thompson Sampling for Complex Bandit Problems
Aditya Gopalan
Shie Mannor
Yishay Mansour
114
202
0
03 Nov 2013
Practical Bayesian Optimization of Machine Learning Algorithms
Jasper Snoek
Hugo Larochelle
Ryan P. Adams
323
7,923
0
13 Jun 2012
Gaussian Process Optimization in the Bandit Setting: No Regret and Experimental Design
Niranjan Srinivas
Andreas Krause
Sham Kakade
Matthias Seeger
144
1,618
0
21 Dec 2009
1