TL;DR
This paper introduces a variational Bayesian approach using sparse precision matrices for inverse PDE problems, offering a computationally efficient alternative to MCMC with effective uncertainty quantification.
Contribution
It proposes a Gaussian variational family with sparse precision matrices tailored for inverse PDE problems, improving computational efficiency and uncertainty estimation.
Findings
VB methods are flexible and efficient compared to MCMC.
The approach effectively estimates solution means and uncertainties.
Tests on 1D and 2D Poisson problems demonstrate accuracy.
Abstract
Inverse problems involving partial differential equations (PDEs) are widely used in science and engineering. Although such problems are generally ill-posed, different regularisation approaches have been developed to ameliorate this problem. Among them is the Bayesian formulation, where a prior probability measure is placed on the quantity of interest. The resulting posterior probability measure is usually analytically intractable. The Markov Chain Monte Carlo (MCMC) method has been the go-to method for sampling from those posterior measures. MCMC is computationally infeasible for large-scale problems that arise in engineering practice. Lately, Variational Bayes (VB) has been recognised as a more computationally tractable method for Bayesian inference, approximating a Bayesian posterior distribution with a simpler trial distribution by solving an optimisation problem. In this work, 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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
