English

Bandit optimisation of functions in the Mat\'ern kernel RKHS

Machine Learning 2023-02-28 v3 Machine Learning

Abstract

We consider the problem of optimising functions in the reproducing kernel Hilbert space (RKHS) of a Mat\'ern kernel with smoothness parameter ν\nu over the domain [0,1]d[0,1]^d under noisy bandit feedback. Our contribution, the π\pi-GP-UCB algorithm, is the first practical approach with guaranteed sublinear regret for all ν>1\nu>1 and d1d \geq 1. Empirical validation suggests better performance and drastically improved computational scalablity compared with its predecessor, Improved GP-UCB.

Cite

@article{arxiv.2001.10396,
  title  = {Bandit optimisation of functions in the Mat\'ern kernel RKHS},
  author = {David Janz and David R. Burt and Javier González},
  journal= {arXiv preprint arXiv:2001.10396},
  year   = {2023}
}

Comments

Included an errata highlighting an omission in the proof of lemma 1 and pointing to a fix in the author's thesis; the omission does not affect the main result

R2 v1 2026-06-23T13:23:02.573Z