My Webpage
My Webpage
Home
Posts
Projects
Publications
Coursework
Teaching
Contact
Light
Dark
Automatic
Optimization
Bayesian Optimization
Low complexity algorithms with improved regret bounds
Kernelized Bandits
Algorithm with uniformly improved regret bounds + a computationally efficient heuristic with better empirical performance
Cite
×