Improved Regret Bounds for Gaussian Process Upper Confidence Bound in Bayesian Optimization

TL;DR

This paper addresses the Bayesian optimization problem (also referred to as the Bayesian setting of the Gaussian process bandit), where the learner seeks to minimize the regret under a function drawn from a known Gaussian process (GP). Under a Mat\'ern kernel with some extent of smoothness, we show that the Gaussian process upper confidence bound (…

Opening excerpt from the authors’ abstract. source