Randomised Gaussian Process Upper Confidence Bound for Bayesian Optimisation
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.
Code (1)
Tasks
Bayesian OptimisationMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Regret Analysis for Randomized Gaussian Process Upper Confidence Bound
Gaussian process upper confidence bound (GP-UCB) is a theoretically established algorithm for Bayesian optimization (BO), where we assume the objective function $f$ follows GP. One notable drawback of GP-UCB is that the …
Bayesian OptimizationRandomized Gaussian Process Upper Confidence Bound with Tighter Bayesian Regret Bounds
Gaussian process upper confidence bound (GP-UCB) is a theoretically promising approach for black-box optimization; however, the confidence parameter $\beta$ is considerably large in the theorem and chosen heuristically i…
Mean Square Prediction Error of Misspecified Gaussian Process Models
Nonparametric modeling approaches show very promising results in the area of system identification and control. A naturally provided model confidence is highly relevant for system-theoretical considerations to provide gu…
PredictionregressionvalidHigh-dimensional near-optimal experiment design for drug discovery via Bayesian sparse sampling
We study the problem of performing automated experiment design for drug screening through Bayesian inference and optimisation. In particular, we compare and contrast the behaviour of linear-Gaussian models and Gaussian p…
Bayesian InferenceDrug DiscoveryGaussian ProcessesThompson SamplingOn Lai's Upper Confidence Bound in Multi-Armed Bandits
In this memorial paper, we honor Tze Leung Lai's seminal contributions to the topic of multi-armed bandits, with a specific focus on his pioneering work on the upper confidence bound. We establish sharp non-asymptotic re…
Multi-Armed Bandits