Self-Supervised Laplace Approximation for Bayesian Uncertainty Quantification
Julian Rodemann, Alexander Marquard, Thomas Augustin, Michele Caprio

TL;DR
This paper introduces a novel self-supervised Laplace approximation method for Bayesian uncertainty quantification that directly approximates the posterior predictive distribution without parameter sampling.
Contribution
It proposes a simple, deterministic approach inspired by self-training to estimate predictive uncertainty, bypassing expensive posterior sampling.
Findings
Outperforms classical Laplace approximations in predictive calibration.
Applicable to models from Bayesian linear to neural networks.
Efficient and effective across various regression tasks.
Abstract
Approximate Bayesian inference typically revolves around computing the posterior parameter distribution. In practice, however, the main object of interest is often a model's predictions rather than its parameters. In this work, we propose to bypass the parameter posterior and focus directly on approximating the posterior predictive distribution. We achieve this by drawing inspiration from self-training within self-supervised and semi-supervised learning. Essentially, we quantify a Bayesian model's predictive uncertainty by refitting on self-predicted data. The idea is strikingly simple: If a model assigns high likelihood to self-predicted data, these predictions are of low uncertainty, and vice versa. This yields a deterministic, sampling-free approximation of the posterior predictive. The modular structure of our Self-Supervised Laplace Approximation (SSLA) further allows us to plug in…
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.
