On Lower Bounds for Standard and Robust Gaussian Process Bandit Optimization

Cited by: 0|Views3

Abstract:

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 ...More

Code:

Data:

Full Text
Bibtex
Your rating :
0

 

Tags
Comments