Goal-oriented optimal approximations of Bayesian linear inverse problems
From MaRDI portal
Abstract: 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.
Recommendations
- Optimal low-rank approximations of Bayesian linear inverse problems
- Scalable posterior approximations for large-scale Bayesian inverse problems via likelihood-informed parameter and state reduction
- Data-free likelihood-informed dimension reduction of Bayesian inverse problems
- Fast algorithms for Bayesian uncertainty quantification in large-scale linear inverse problems based on low-rank partial Hessian approximations
- Likelihood-informed dimension reduction for nonlinear inverse problems
Cites work
- scientific article; zbMATH DE number 3848401 (Why is no real title available?)
- scientific article; zbMATH DE number 5284801 (Why is no real title available?)
- scientific article; zbMATH DE number 3928102 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- scientific article; zbMATH DE number 2221907 (Why is no real title available?)
- scientific article; zbMATH DE number 3023295 (Why is no real title available?)
- scientific article; zbMATH DE number 3070747 (Why is no real title available?)
- scientific article; zbMATH DE number 3106666 (Why is no real title available?)
- A Hessian-based method for uncertainty quantification in global Ocean state estimation
- A Krylov subspace method for covariance approximation and simulation of random processes and fields
- A Riemannian framework for tensor computing
- A Trace Minimization Algorithm for the Generalized Eigenvalue Problem
- A computational framework for infinite-dimensional Bayesian inverse problems. II: stochastic Newton MCMC with application to ice sheet flow inverse problems
- A stochastic Newton MCMC method for large-scale statistical inverse problems with application to seismic inversion
- A truncated-CG style method for symmetric generalized eigenvalue problems
- Adaptive Hessian-Based Nonstationary Gaussian Process Response Surface Method for Probability Density Approximation with Application to Bayesian Solution of Large-Scale Inverse Problems
- An Implicit Riemannian Trust-Region Method for the Symmetric Generalized Eigenproblem
- An Inverse Free Preconditioned Krylov Subspace Method for Symmetric Generalized Eigenvalue Problems
- An efficient approach for computing optimal low-rank regularized inverse matrices
- An explicit link between Gaussian fields and Gaussian Markov random fields: the stochastic partial differential equation approach
- An indefinite variant of LOBPCG for definite matrix pencils
- Analysis of the Hessian for inverse scattering problems. I: Inverse shape scattering of acoustic waves
- Bayesian inference with optimal maps
- Computational Science – ICCS 2005
- Computational Variants of the Lanczos Method for the Eigenproblem
- Convergence analysis of Krylov subspace methods
- Convergence in variance of Chebyshev accelerated Gibbs samplers
- Covariance, subspace, and intrinsic Crame/spl acute/r-Rao bounds
- Designing optimal spectral filters for inverse problems
- Dimension-independent likelihood-informed MCMC
- Dimensionality reduction and polynomial chaos acceleration of Bayesian inference in inverse problems
- Fast algorithms for Bayesian uncertainty quantification in large-scale linear inverse problems based on low-rank partial Hessian approximations
- Fast and Exact Simulation of Stationary Gaussian Processes through Circulant Embedding of the Covariance Matrix
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Generalized Rank-Constrained Matrix Approximations
- Generalizing the Singular Value Decomposition
- Geometric Means in a Novel Vector Space Structure on Symmetric Positive‐Definite Matrices
- Geometry-aware principal component analysis for symmetric positive definite matrices
- Goal-Oriented Inference: Approach, Linear Theory, and Application to Advection Diffusion
- Higher order quasi-Monte Carlo integration for Bayesian PDE inversion
- Inverse problems: a Bayesian perspective
- LSMR: An Iterative Algorithm for Sparse Least-Squares Problems
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- LSRN: A parallel iterative solver for strongly over- or underdetermined systems
- Large-scale Kalman filtering using the limited memory BFGS method
- Likelihood-informed dimension reduction for nonlinear inverse problems
- Methods of conjugate gradients for solving linear systems
- Nonlinear goal-oriented Bayesian inference: application to carbon capture and storage
- Numerical approximation of partial differential equations
- On the sublinear and superlinear rate of convergence of conjugate gradient methods
- Optimal filters from calibration data for image deconvolution with data acquisition error
- Optimal low-rank approximations of Bayesian linear inverse problems
- Optimal regularized low rank inverse approximation
- Parallel implementations of the trace minimization scheme trace{min} for the sparse symmetric eigenvalue problem
- Positive definite matrices
- Posterior exploration for computationally intensive forward models
- Preconditioned Krylov subspace methods for sampling multivariate Gaussian distributions
- Priorconditioners for linear systems
- Randomized algorithms for generalized Hermitian eigenvalue problems with application to computing Karhunen-Loève expansion.
- Randomized algorithms for the low-rank approximation of matrices
- Regularization, GSVD and truncated GSVD
- Riemannian metric and geometric mean for positive semidefinite matrices of fixed rank
- Sampling Gaussian distributions in Krylov spaces with conjugate gradients
- Scalable and efficient algorithms for the propagation of uncertainty from data through inference to prediction for large-scale problems, with application to flow of the antarctic ice sheet
- Scaling limits in computational Bayesian inversion
- Simplified GSVD computations for the solution of linear discrete ill-posed problems
- Sparse, adaptive Smolyak quadratures for Bayesian inverse problems
- Spectral likelihood expansions for Bayesian inference
- Statistical inverse problems: discretization, model reduction and inverse crimes
- Structured low-rank approximation and its applications
- Templates for the Solution of Algebraic Eigenvalue Problems
- The Riemannian geometry of the space of positive-definite matrices and its application to the regularization of positive-definite matrix-valued data
- The block conjugate gradient algorithm and related methods
- The variational Kalman filter and an efficient implementation using limited memory BFGS
- Towards a Generalized Singular Value Decomposition
- Variational ensemble Kalman filtering using limited memory BFGS
Cited in
(21)- Distributionally robust Gaussian process regression and Bayesian inverse problems
- Objective-sensitive principal component analysis for high-dimensional inverse problems
- An approximate empirical Bayesian method for large-scale linear-Gaussian inverse problems
- Uncertainty quantification for goal-oriented inverse problems via variational encoder-decoder networks
- Probabilistic learning constrained by realizations using a weak formulation of Fourier transform of probability measures
- Goal-oriented inference: approach, linear theory, and application to advection diffusion
- Low-Rank Eigenvector Compression of Posterior Covariance Matrices for Linear Gaussian Inverse Problems
- Optimal experimental design: formulations and computations
- Probabilistic learning inference of boundary value problem with uncertainties based on Kullback-Leibler divergence under implicit constraints
- Model reduction of linear dynamical systems via balancing for Bayesian inference
- Goal-Oriented Inference: Approach, Linear Theory, and Application to Advection Diffusion
- An Offline-Online Decomposition Method for Efficient Linear Bayesian Goal-Oriented Optimal Experimental Design: Application to Optimal Sensor Placement
- Inference via low-dimensional couplings
- Optimal projection of observations in a Bayesian setting
- Goal-oriented optimal design of experiments for large-scale Bayesian linear inverse problems
- Optimal low-rank approximations of Bayesian linear inverse problems
- Sampling of Bayesian posteriors with a non-Gaussian probabilistic learning on manifolds from a small dataset
- Transient anisotropic kernel for probabilistic learning on manifolds
- Physics-constrained non-Gaussian probabilistic learning on manifolds
- Probabilistic-learning-based stochastic surrogate model from small incomplete datasets for nonlinear dynamical systems
- Model adaptivity for goal-oriented inference using adjoints
This page was built for publication: Goal-oriented optimal approximations of Bayesian linear inverse problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5372624)
