A Framework for Evaluating Approximation Methods for Gaussian Process Regression
arXiv:1205.6326
Abstract
Gaussian process (GP) predictors are an important component of many Bayesian approaches to machine learning. However, even a straightforward implementation of Gaussian process regression (GPR) requires O(n^2) space and O(n^3) time for a dataset of n examples. Several approximation methods have been proposed, but there is a lack of understanding of the relative merits of the different approximations, and in what situations they are most useful. We recommend assessing the quality of the predictions obtained as a function of the compute time taken, and comparing to standard baselines (e.g., Subset of Data and FITC). We empirically investigate four different approximation algorithms on four different prediction problems, and make our code available to encourage future comparisons.
19 pages, 4 figures
Cited by in corpus (6)
- A Survey of Bayesian Statistical Approaches for Big Data
- Efficient dynamic modal load reconstruction using physics-informed Gaussian processes based on frequency-sparse Fourier basis functions
- A Framework of Zero-Inflated Bayesian Negative Binomial Regression Models For Spatiotemporal Data
- A Global-Local Approximation Framework for Large-Scale Gaussian Process Modeling
- Fast increased fidelity approximate Gibbs samplers for Bayesian Gaussian process regression
- Adaptive Cholesky Gaussian Processes