2020
IJCAI
IJCAI 2020
Randomised Gaussian Process Upper Confidence Bound for Bayesian Optimisation
Abstract
In order to improve the performance of Bayesian optimisation, we develop a modified Gaussian process upper confidence bound (GP-UCB) acquisition function. This is done by sampling the exploration-exploitation trade-off parameter from a distribution. We prove that this allows the expected trade-off parameter to be altered to better suit the problem without compromising a bound on the function's Bayesian regret. We also provide results showing that our method achieves better performance than GP-UCB in a range of real-world and synthetic problems.
🐝
Cross-Pollinator
— Artificial Intelligence, Computer Vision, Data Science & Analytics, Deep Learning, Healthcare & Medicine, Interdisciplinary, Knowledge & Reasoning, Machine Learning, Mathematics & Optimization, Natural Language Processing, Reinforcement Learning, Robotics, Security & Privacy, Speech & Audio
🌉
Interdisciplinary Bridge
— Machine Learning and Mathematics & Optimization
Authors
Topics
Machine Learning > Optimization & Theory > Bayesian Inference
Machine Learning > Optimization & Theory > Optimization
Machine Learning > Optimization & Theory > Online Algorithms
Mathematics & Optimization > Optimization > Optimization
Machine Learning > Bayesian & Probabilistic > Gaussian Processes