On Lower Bounds for Standard and Robust Gaussian Process Bandit Optimization

08/20/2020
by   Xu Cai, et al.
0

In this paper, we consider algorithm-independent lower bounds for the problem of black-box optimization of functions having a bounded norm is some Reproducing Kernel Hilbert Space (RKHS), which can be viewed as a non-Bayesian Gaussian process bandit problem. In the standard noisy setting, we provide a novel proof technique for deriving lower bounds on the regret, with benefits including simplicity, versatility, and an improved dependence on the error probability. In a robust setting in which every sampled point may be perturbed by a suitably-constrained adversary, we provide a novel lower bound for deterministic strategies, demonstrating an inevitable joint dependence of the cumulative regret on the corruption level and the time horizon, in contrast with existing lower bounds that only characterize the individual dependencies. Furthermore, in a distinct robust setting in which the final point is perturbed by an adversary, we strengthen an existing lower bound that only holds for target success probabilities very close to one, by allowing for arbitrary success probabilities in (0,1).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/31/2017

Lower Bounds on Regret for Noisy Gaussian Process Bandit Optimization

In this paper, we consider the problem of sequentially optimizing a blac...
research
11/09/2021

Misspecified Gaussian Process Bandit Optimization

We consider the problem of optimizing a black-box function based on nois...
research
03/04/2020

Corruption-Tolerant Gaussian Process Bandit Optimization

We consider the problem of optimizing an unknown (typically non-convex) ...
research
02/22/2022

Order-Optimal Error Bounds for Noisy Kernel-Based Bayesian Quadrature

In this paper, we study the sample complexity of noisy Bayesian quadratu...
research
09/16/2019

Bayesian Optimization under Heavy-tailed Payoffs

We consider black box optimization of an unknown function in the nonpara...
research
04/26/2023

Adaptation to Misspecified Kernel Regularity in Kernelised Bandits

In continuum-armed bandit problems where the underlying function resides...
research
10/25/2018

Adversarially Robust Optimization with Gaussian Processes

In this paper, we consider the problem of Gaussian process (GP) optimiza...

Please sign up or login with your details

Forgot password? Click here to reset