On MCMC for variationally sparse Gaussian processes: A pseudo-marginal approach

Abstract

Gaussian processes (GPs) are frequently used in machine learning and statistics to construct powerful models. However, when employing GPs in practice, important considerations must be made, regarding the high computational burden, approximation of the posterior, choice of the covariance function and inference of its hyperparmeters. To address these issues, Hensman et al. (2015) combine variationally sparse GPs with Markov chain Monte Carlo (MCMC) to derive a scalable, flexible and general framework for GP models. Nevertheless, the resulting approach requires intractable likelihood evaluations for many observation models. To bypass this problem, we propose a pseudo-marginal (PM) scheme that offers asymptotically exact inference as well as computational gains through doubly stochastic estimators for the intractable likelihood and large datasets. In complex models, the advantages of the PM scheme are particularly evident, and we demonstrate this on a two-level GP regression model with a nonparametric covariance function to capture non-stationarity.

References in corpus (5)

• The pseudo-marginal approach for efficient Monte Carlo computations
• MCMC for Variationally Sparse Gaussian Processes
• Firefly Monte Carlo: Exact MCMC with Subsets of Data
• Deep Gaussian Processes for Multi-fidelity Modeling
• Banded Matrix Operators for Gaussian Markov Models in the Automatic Differentiation Era