Gaussian process optimization with adaptive sketching: Scalable and no regret - Archive ouverte HAL Access content directly
Conference Papers Year :

Gaussian process optimization with adaptive sketching: Scalable and no regret

(1) , (2) , (3) , (4) , (1)
1
2
3
4

Abstract

Gaussian processes (GP) are a stochastic processes, used as Bayesian approach for the optimization of black-box functions. Despite their effectiveness in simple problems, GP-based algorithms hardly scale to high-dimensional functions, as their per-iteration time and space cost is at least quadratic in the number of dimensions d and iterations t. Given a set of A alternatives to choose from, the overall runtime O(t 3 A) is prohibitive. In this paper, we introduce BKB (budgeted kernelized bandit), a new approximate GP algorithm for optimization under bandit feedback that achieves near-optimal regret (and hence near-optimal convergence rate) with near-constant per-iteration complexity and remarkably no assumption on the input space or covariance of the GP. We combine a kernelized linear bandit algorithm (GP-UCB) leverage score sampling as a randomized matrix sketching and prove that selecting inducing points based on their posterior variance gives an accurate low-rank approximation of the GP, preserving variance estimates and confidence intervals. As a consequence, BKB does not suffer from variance starvation, an important problem faced by many previous sparse GP approximations. Moreover, we show that our procedure selects at most O(d eff) points, where d eff is the effective dimension of the explored space, which is typically much smaller than both d and t. This greatly reduces the dimensionality of the problem, thus leading to a O(T Ad 2 eff) runtime and O(Ad eff) space complexity.
Fichier principal
Vignette du fichier
calandriello2019gaussian.pdf (623.24 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02144311 , version 1 (30-05-2019)

Identifiers

  • HAL Id : hal-02144311 , version 1

Cite

Daniele Calandriello, Luigi Carratino, Alessandro Lazaric, Michal Valko, Lorenzo Rosasco. Gaussian process optimization with adaptive sketching: Scalable and no regret. Conference on Learning Theory, 2019, Phoenix, United States. ⟨hal-02144311⟩
51 View
230 Download

Share

Gmail Facebook Twitter LinkedIn More