Gaussian Process Regression with a Student-t Likelihood

06/22/2011
by   Pasi Jylänki, et al.
0

This paper considers the robust and efficient implementation of Gaussian process regression with a Student-t observation model. The challenge with the Student-t model is the analytically intractable inference which is why several approximative methods have been proposed. The expectation propagation (EP) has been found to be a very accurate method in many empirical studies but the convergence of the EP is known to be problematic with models containing non-log-concave site functions such as the Student-t distribution. In this paper we illustrate the situations where the standard EP fails to converge and review different modifications and alternative algorithms for improving the convergence. We demonstrate that convergence problems may occur during the type-II maximum a posteriori (MAP) estimation of the hyperparameters and show that the standard EP may not converge in the MAP values in some difficult cases. We present a robust implementation which relies primarily on parallel EP updates and utilizes a moment-matching-based double-loop algorithm with adaptively selected step size in difficult cases. The predictive performance of the EP is compared to the Laplace, variational Bayes, and Markov chain Monte Carlo approximations.

READ FULL TEXT
research
12/20/2017

Laplace approximation and the natural gradient for Gaussian process regression with the heteroscedastic Student-t model

This paper considers the Laplace method to derive approximate inference ...
research
11/01/2012

Laplace approximation for logistic Gaussian process density estimation and regression

Logistic Gaussian process (LGP) priors provide a flexible alternative fo...
research
04/27/2020

Hamiltonian Monte Carlo using an embedded Laplace approximation

Latent Gaussian models are a popular class of hierarchical models with a...
research
07/16/2012

Nested Expectation Propagation for Gaussian Process Classification with a Multinomial Probit Likelihood

We consider probabilistic multinomial probit classification using Gaussi...
research
02/28/2013

A New Monte Carlo Based Algorithm for the Gaussian Process Classification Problem

Gaussian process is a very promising novel technology that has been appl...
research
03/22/2013

Robust and Trend Following Student's t Kalman Smoothers

We present a Kalman smoothing framework based on modeling errors using t...
research
01/15/2020

Newtonian Monte Carlo: single-site MCMC meets second-order gradient methods

Single-site Markov Chain Monte Carlo (MCMC) is a variant of MCMC in whic...

Please sign up or login with your details

Forgot password? Click here to reset