Multilevel adaptive sparse Leja approximations for Bayesian inverse problems

Abstract

Deterministic interpolation and quadrature methods are often unsuitable to address Bayesian inverse problems depending on computationally expensive forward mathematical models. While interpolation may give precise posterior approximations, deterministic quadrature is usually unable to efficiently investigate an informative and thus concentrated likelihood. This leads to a large number of required expensive evaluations of the mathematical model. To overcome these challenges, we formulate and test a multilevel adaptive sparse Leja algorithm. At each level, adaptive sparse grid interpolation and quadrature are used to approximate the posterior and perform all quadrature operations, respectively. Specifically, our algorithm uses coarse discretizations of the underlying mathematical model to investigate the parameter space and to identify areas of high posterior probability. Adaptive sparse grid algorithms are then used to place points in these areas, and ignore other areas of small posterior probability. The points are weighted Leja points. As the model discretization is coarse, the construction of the sparse grid is computationally efficient. On this sparse grid, the posterior measure can be approximated accurately with few expensive, fine model discretizations. The efficiency of the algorithm can be enhanced further by exploiting more than two discretization levels. We apply the proposed multilevel adaptive sparse Leja algorithm in numerical experiments involving elliptic inverse problems in 2D and 3D space, in which we compare it with Markov chain Monte Carlo sampling and a standard multilevel approximation.

24 pages, 9 figures

References in corpus (18)

• MCMC using Hamiltonian dynamics
• An introduction to sampling via measure transport
• Adaptive multi-fidelity polynomial chaos approach to Bayesian inference in inverse problems
• Adaptive construction of surrogates for the Bayesian solution of inverse problems
• Multilevel Sequential Monte Carlo Samplers
• Sparse Deterministic Approximation of Bayesian Inverse Problems
• Adaptive Leja sparse grid constructions for stochastic collocation and high-dimensional approximation
• Multi-Index Stochastic Collocation for random PDEs
• Multilevel Sequential${}^2$ Monte Carlo for Bayesian Inverse Problems
• On the well-posedness of Bayesian inverse problems
• Hessian-based adaptive sparse quadrature for infinite-dimensional Bayesian inverse problems
• Coordinate Transformation and Polynomial Chaos for the Bayesian Inference of a Gaussian Process with Parametrized Prior Covariance Function
• Fast sampling of parameterised Gaussian random fields
• Assessing the Performance of Leja and Clenshaw-Curtis Collocation for Computational Electromagnetics with Random Input Data
• Higher order Quasi-Monte Carlo integration for Bayesian Estimation
• Goal-oriented adaptive surrogate construction for stochastic inversion
• Quasi-Monte Carlo and Multilevel Monte Carlo Methods for Computing Posterior Expectations in Elliptic Inverse Problems
• Sensitivity-driven adaptive sparse stochastic approximations in plasma microinstability analysis

Cited by in corpus (6)

• Calibrate, Emulate, Sample
• An $hp$-adaptive multi-element stochastic collocation method for surrogate modeling with information re-use
• Variational Inference for Nonlinear Inverse Problems via Neural Net Kernels: Comparison to Bayesian Neural Networks, Application to Topology Optimization
• Enhanced adaptive surrogate models with applications in uncertainty quantification for nanoplasmonics
• Adaptive Sparse Polynomial Chaos Expansions via Leja Interpolation
• Stein variational reduced basis Bayesian inversion