Goal-oriented optimal approximations of Bayesian linear inverse problems
Not on the map. Why?
Abstract (arXiv)
We propose optimal dimensionality reduction techniques for the solution of goal-oriented linear-Gaussian inverse problems, where the quantity of interest (QoI) is a function of the inversion parameters. These approximations are suitable for large-scale applications. In particular, we study the approximation of the posterior covariance of the QoI as a low-rank negative update of its prior covariance, and prove optimality of this update with respect to the natural geodesic distance on the manifold of symmetric positive definite matrices. Assuming exact knowledge of the posterior mean of the QoI, the optimality results extend to optimality in distribution with respect to the Kullback-Leibler divergence and the Hellinger distance between the associated distributions. We also propose approximation of the posterior mean of the QoI as a low-rank linear function of the data, and prove optimality of this approximation with respect to a weighted Bayes risk. Both of these optimal approximations avoid the explicit computation of the full posterior distribution of the parameters and instead focus on directions that are well informed by the data and relevant to the QoI. These directions stem from a balance among all the components of the goal-oriented inverse problem: prior information, forward model, measurement noise, and ultimate goals. We illustrate the theory using a high-dimensional inverse problem in heat transfer.
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). First posted on arXiv 7 Jul 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 2; 2023: 1; 2024: 1; 2025: 1; 2026: 2.
7 papers.
- 2024Transient anisotropic kernel for probabilistic learning on manifoldscited by 3
- 2022Probabilistic learning inference of boundary value problem with uncertainties based on Kullback-Leibler divergence under implicit constraintscited by 2
- 2022Probabilistic learning constrained by realizations using a weak formulation of Fourier transform of probability measurescited by 1
- 2023Goal-oriented Uncertainty Quantification for Inverse Problems via Variational Encoder-Decoder Networkscited by 1
- 2025Supervised Learning of Random Neural Architectures Structured by Latent Random Fields on Compact Boundaryless Multiply-Connected Manifoldscited by 0
- 2026ShaplEIG: Bayesian Experimental Design for Shapley Value Estimationcited by 0
- 2026SCOPE Before You Sample: Conformal Scores Guide Posterior Exploration for Fast and Calibrated Bayesian Predictive Inferencecited by 0
- 2026SCOPE Before You Sample: Conformal Scores Guide Posterior Exploration for Fast and Calibrated Bayesian Predictive Inference12 Oct 2026
- 2026ShaplEIG: Bayesian Experimental Design for Shapley Value Estimation1 Jun 2026
- 2025Supervised Learning of Random Neural Architectures Structured by Latent Random Fields on Compact Boundaryless Multiply-Connected Manifolds11 Dec 2025
- 2024Transient anisotropic kernel for probabilistic learning on manifolds31 Jul 2024
- 2023Goal-oriented Uncertainty Quantification for Inverse Problems via Variational Encoder-Decoder Networks17 Apr 2023
- 2022Probabilistic learning constrained by realizations using a weak formulation of Fourier transform of probability measures6 May 2022
- 2022Probabilistic learning inference of boundary value problem with uncertainties based on Kullback-Leibler divergence under implicit constraints10 Feb 2022