Sparse Deterministic Approximation of Bayesian Inverse Problems
Ch. Schwab, A. M. Stuart

TL;DR
This paper develops a deterministic, sparse polynomial chaos approach to efficiently approximate the posterior density in Bayesian inverse problems involving infinite-dimensional parameters, enabling better uncertainty quantification.
Contribution
It introduces a generalized polynomial chaos representation for the posterior density and establishes conditions for algebraic convergence rates based on prior sparsity.
Findings
Posterior density can be approximated with algebraic convergence under certain prior conditions.
Sparsity of the input data's coefficients influences the approximation accuracy.
Efficient uncertainty quantification is achieved through the proposed deterministic formulation.
Abstract
We present a parametric deterministic formulation of Bayesian inverse problems with input parameter from infinite dimensional, separable Banach spaces. In this formulation, the forward problems are parametric, deterministic elliptic partial differential equations, and the inverse problem is to determine the unknown, parametric deterministic coefficients from noisy observations comprising linear functionals of the solution. We prove a generalized polynomial chaos representation of the posterior density with respect to the prior measure, given noisy observational data. We analyze the sparsity of the posterior density in terms of the summability of the input data's coefficient sequence. To this end, we estimate the fluctuations in the prior. We exhibit sufficient conditions on the prior model in order for approximations of the posterior density to converge at a given algebraic rate, 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.
