Bandit optimisation of functions in the Matérn kernel RKHS

01/28/2020
by   David Janz, et al.
0

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

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/09/2021

Misspecified Gaussian Process Bandit Optimization

We consider the problem of optimizing a black-box function based on nois...
research
07/14/2023

On the Sublinear Regret of GP-UCB

In the kernelized bandit problem, a learner aims to sequentially compute...
research
02/01/2023

Bandit Convex Optimisation Revisited: FTRL Achieves Õ(t^1/2) Regret

We show that a kernel estimator using multiple function evaluations can ...
research
10/27/2022

Lifelong Bandit Optimization: No Prior and No Regret

In practical applications, machine learning algorithms are often repeate...
research
03/04/2020

Corruption-Tolerant Gaussian Process Bandit Optimization

We consider the problem of optimizing an unknown (typically non-convex) ...
research
10/28/2021

Open Problem: Tight Online Confidence Intervals for RKHS Elements

Confidence intervals are a crucial building block in the analysis of var...
research
07/16/2022

Kernel-based Federated Learning with Personalization

We consider federated learning with personalization, where in addition t...

Please sign up or login with your details

Forgot password? Click here to reset