Laplace approximation and the natural gradient for Gaussian process regression with the heteroscedastic Student-t model
Marcelo Hartmann, Jarno Vanhatalo

TL;DR
This paper develops a novel Laplace approximation method combined with the natural gradient for Gaussian process regression using a heteroscedastic Student-t model, enabling robust inference of mean and variance functions.
Contribution
It introduces an alternative Laplace approximation leveraging Fisher information and applies natural gradient methods, improving inference for non-log-concave models.
Findings
Alternative Laplace approximation performs similarly to traditional methods.
Natural gradient adaptation enhances estimation efficiency.
Comparison shows the model's robustness over Gaussian counterparts.
Abstract
This paper considers the Laplace method to derive approximate inference for the Gaussian process (GP) regression in the location and scale parameters of the Student-t probabilistic model. This allows both mean and variance of the data to vary as a function of covariates with the attractive feature that the Student-t model has been widely used as a useful tool for robustifying data analysis. The challenge in the approximate inference for the GP regression with the Student-t probabilistic model, lies in the analytical intractability of the posterior distribution and the lack of concavity of the log-likelihood function. We present the natural gradient adaptation for the estimation process which primarily relies on the property that the Student-t model naturally has orthogonal parametrization with respect to the location and scale paramaters. Due to this particular property of the model, we…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGaussian Processes and Bayesian Inference · Probabilistic and Robust Engineering Design · Advanced Multi-Objective Optimization Algorithms
