Fast Gibbs sampling for high-dimensional Bayesian inversion
Felix Lucka

TL;DR
This paper introduces a fast, generalized Gibbs sampling method for high-dimensional Bayesian inverse problems, enabling efficient posterior sampling with complex priors like total variation, demonstrated on CT data.
Contribution
It extends existing Gibbs samplers to a broad class of priors, including TV, using a novel slice sampling approach for efficient high-dimensional Bayesian inference.
Findings
Enables sample-based Bayesian inference with complex priors in high dimensions.
Achieves efficient sampling for CT inversion with total variation prior.
Demonstrates practical performance through computed examples.
Abstract
Solving ill-posed inverse problems by Bayesian inference has recently attracted considerable attention. Compared to deterministic approaches, the probabilistic representation of the solution by the posterior distribution can be exploited to explore and quantify its uncertainties. In applications where the inverse solution is subject to further analysis procedures, this can be a significant advantage. Alongside theoretical progress, various new computational techniques allow to sample very high dimensional posterior distributions: In [Lucka2012], a Markov chain Monte Carlo (MCMC) posterior sampler was developed for linear inverse problems with -type priors. In this article, we extend this single component Gibbs-type sampler to a wide range of priors used in Bayesian inversion, such as general priors with additional hard constraints. Besides a fast computation of the…
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.
