Randomised Gaussian Process Upper Confidence Bound for Bayesian Optimisation

06/08/2020
by   Julian Berk, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/03/2023

Randomized Gaussian Process Upper Confidence Bound with Tight Bayesian Regret Bounds

Gaussian process upper confidence bound (GP-UCB) is a theoretically prom...
research
10/12/2019

Bayesian Optimization using Pseudo-Points

Bayesian optimization (BO) is a popular approach for expensive black-box...
research
06/21/2019

Sparse Spectrum Gaussian Process for Bayesian Optimisation

We propose a novel sparse spectrum approximation of Gaussian process (GP...
research
06/30/2014

Theoretical Analysis of Bayesian Optimisation with Unknown Gaussian Process Hyper-Parameters

Bayesian optimisation has gained great popularity as a tool for optimisi...
research
05/30/2021

Periodic-GP: Learning Periodic World with Gaussian Process Bandits

We consider the sequential decision optimization on the periodic environ...
research
09/08/2020

Sequential Subspace Search for Functional Bayesian Optimization Incorporating Experimenter Intuition

We propose an algorithm for Bayesian functional optimisation - that is, ...

Please sign up or login with your details

Forgot password? Click here to reset