Practical Hilbert space approximate Bayesian Gaussian processes for probabilistic programming

Abstract

Gaussian processes are powerful non-parametric probabilistic models for stochastic functions. However, the direct implementation entails a complexity that is computationally intractable when the number of observations is large, especially when estimated with fully Bayesian methods such as Markov chain Monte Carlo. In this paper, we focus on a low-rank approximate Bayesian Gaussian processes, based on a basis function approximation via Laplace eigenfunctions for stationary covariance functions. The main contribution of this paper is a detailed analysis of the performance, and practical recommendations for how to select the number of basis functions and the boundary factor. Intuitive visualizations and recommendations, make it easier for users to improve approximation accuracy and computational performance. We also propose diagnostics for checking that the number of basis functions and the boundary factor are adequate given the data. The approach is simple and exhibits an attractive computational complexity due to its linear structure, and it is easy to implement in probabilistic programming frameworks. Several illustrative examples of the performance and applicability of the method in the probabilistic programming language Stan are presented together with the underlying Stan model code.

arXiv comment27 pages, 18 figures

References in corpus (9)

• Practical Bayesian model evaluation using leave-one-out cross-validation and WAIC
• MCMC using Hamiltonian dynamics
• Expectation Propagation for approximate Bayesian inference
• Gaussian Processes for Data-Efficient Learning in Robotics and Control
• A Conceptual Introduction to Hamiltonian Monte Carlo
• Sparsity information and regularization in the horseshoe and other shrinkage priors
• Monte Carlo Implementation of Gaussian Process Models for Bayesian Regression and Classification
• Variational Fourier features for Gaussian processes
• Improving the Gaussian Process Sparse Spectrum Approximation by Representing Uncertainty in Frequency Inputs

Cited by in corpus (9)

• Pathfinder: Parallel quasi-Newton variational inference
• A Tutorial on Sparse Gaussian Processes and Variational Inference
• Efficient Exploration in Binary and Preferential Bayesian Optimization
• On Information Gain and Regret Bounds in Gaussian Process Bandits
• Scalable Thompson Sampling using Sparse Gaussian Process Models
• Contextual Bayesian optimization with binary outputs
• Modeling the Marked Presence-only Data: A Case Study of Estimating the Female Sex Worker Size in Malawi
• GaussED: A Probabilistic Programming Language for Sequential Experimental Design
• No-Regret Algorithms for Time-Varying Bayesian Optimization