Name
Abstract | ||
|---|---|---|
This work brings together two powerful concepts in Gaussian processes: the variational approach to sparse approximation and the spectral representation of Gaussian processes. This gives rise to an approximation that inherits the benefits of the variational approach but with the representational power and computational scalability of spectral representations. The work hinges on a key result that there exist spectral features related to a finite domain of the Gaussian process which exhibit almost-independent covariances. We derive these expressions for Matern kernels in one dimension, and generalize to more dimensions using kernels with specific structures. Under the assumption of additive Gaussian noise, our method requires only a single pass through the data set, making for very fast and accurate computation. We fit a model to 4 million training points in just a few minutes on a standard laptop. With non-conjugate likelihoods, our MCMC scheme reduces the cost of computation from O(NM2) (for a sparse Gaussian process) to O(NM) per iteration, where N is the number of data and M is the number of features. |
Year | Venue | Keywords |
|---|---|---|
2017 | JOURNAL OF MACHINE LEARNING RESEARCH | Gaussian processes,Fourier features,variational inference |
Field | DocType | Volume |
Gaussian filter,Gaussian random field,Sparse approximation,Fourier transform,Artificial intelligence,Gaussian process,Gaussian function,Gaussian noise,Mathematics,Machine learning,Computation | Journal | 18 |
ISSN | Citations | PageRank |
1532-4435 | 11 | 0.63 |
References | Authors | |
34 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| James Hensman | 1 | 265 | 20.05 |
| N. Durrande | 2 | 21 | 4.39 |
| Arno Solin | 3 | 136 | 17.38 |