2021
Lenient Regret and Good-Action Identification in Gaussian Process Bandits
ICML 2021spotlight
In this paper, we study the problem of Gaussian process (GP) bandits under relaxed optimization criteria stating that any function value above a certain threshold is “good enough”. On the theoretical side, we study various {\em lenient regret} notions in which all near-optimal actions incur zero pen…