Dimension-Independent MCMC Sampling for Inverse Problems with Non-Gaussian Priors
From MaRDI portal
Bayesian inverse problemscomputational complexityelliptic inverse problemgroundwater flowMarkov chain Monte Carlo methodsMetropolis-Hastings algorithmnon-Gaussian prior measures
Inverse problems for PDEs (35R30) Computational methods in Markov chains (60J22) Monte Carlo methods (65C05) Numerical analysis or methods applied to Markov chains (65C40) Numerical methods for inverse problems for boundary value problems involving PDEs (65N21) Probabilistic methods, particle methods, etc. for boundary value problems involving PDEs (65N75) Complexity and performance of numerical algorithms (65Y20) Flows in porous media; filtration; seepage (76S05)
Abstract: The computational complexity of MCMC methods for the exploration of complex probability measures is a challenging and important problem. A challenge of particular importance arises in Bayesian inverse problems where the target distribution may be supported on an infinite dimensional space. In practice this involves the approximation of measures defined on sequences of spaces of increasing dimension. Motivated by an elliptic inverse problem with non-Gaussian prior, we study the design of proposal chains for the Metropolis-Hastings algorithm with dimension independent performance. Dimension-independent bounds on the Monte-Carlo error of MCMC sampling for Gaussian prior measures have already been established. In this paper we provide a simple recipe to obtain these bounds for non-Gaussian prior measures. To illustrate the theory we consider an elliptic inverse problem arising in groundwater flow. We explicitly construct an efficient Metropolis-Hastings proposal based on local proposals, and we provide numerical evidence which supports the theory.
Recommendations
- A Randomized Maximum A Posteriori Method for Posterior Sampling of High Dimensional Nonlinear Bayesian Inverse Problems
- A Metropolis-Hastings-within-Gibbs sampler for nonlinear hierarchical-Bayesian inverse problems
- Efficient Marginalization-Based MCMC Methods for Hierarchical Bayesian Inverse Problems
- Randomized approaches to accelerate MCMC algorithms for Bayesian inverse problems
- Randomize-then-optimize: a method for sampling from posterior distributions in nonlinear inverse problems
- Low-rank independence samplers in hierarchical Bayesian inverse problems
- An efficient sampling method for stochastic inverse problems
- Geometric MCMC for infinite-dimensional inverse problems
- Sequential implicit sampling methods for Bayesian inverse problems
Cites work
- A note on Metropolis-Hastings kernels for general state spaces
- Bayesian inverse problems for functions and applications to fluid mechanics
- Besov priors for Bayesian inverse problems
- Central limit theorem for additive functionals of reversible Markov processes and applications to simple exclusions
- CLTs and asymptotic variance of time-sampled Markov chains
- Comparison theorems for reversible Markov chains
- Complexity analysis of accelerated MCMC methods for Bayesian inversion
- Convergence properties of the Gibbs sampler for perturbations of Gaussians
- Convergence rates of best \(N\)-term Galerkin approximations for a class of elliptic SPDEs
- Diffusion limits of the random walk Metropolis algorithm in high dimensions
- Dirichlet forms and symmetric Markov processes.
- Dirichlet forms: Some infinite‐dimensional examples
- Error estimates of finite element methods for parameter identifications in elliptic and parabolic systems
- Explicit error bounds for Markov chain Monte Carlo
- Exponential convergence of Langevin distributions and their discrete approximations
- Fixed Precision MCMC Estimation by Median of Products of Averages
- Fixed-Width Output Analysis for Markov Chain Monte Carlo
- Functional inequalities for Markov semigroups
- Galerkin Finite Element Approximations of Stochastic Elliptic Partial Differential Equations
- General state space Markov chains and MCMC algorithms
- Geometric L2 and L1 convergence are equivalent for reversible Markov chains
- Geometric ergodicity and hybrid Markov chains
- Geometric ergodicity of Metropolis algorithms
- Handbook of Markov Chain Monte Carlo
- scientific article; zbMATH DE number 3504209 (Why is no real title available?)
- scientific article; zbMATH DE number 1195779 (Why is no real title available?)
- scientific article; zbMATH DE number 1223843 (Why is no real title available?)
- scientific article; zbMATH DE number 1262778 (Why is no real title available?)
- scientific article; zbMATH DE number 578421 (Why is no real title available?)
- scientific article; zbMATH DE number 1821202 (Why is no real title available?)
- scientific article; zbMATH DE number 834533 (Why is no real title available?)
- Inverse problems: a Bayesian perspective
- MAP estimators and their consistency in Bayesian nonparametric inverse problems
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Markov Chains and Stochastic Stability
- Nonasymptotic mixing of the MALA algorithm
- On variance conditions for Markov chain CLTs
- Optimal scaling of random walk Metropolis algorithms with discontinuous target densities
- Positivity of hit-and-run and related algorithms
- Random Fields and Geometry
- Rates of convergence of the Hastings and Metropolis algorithms
- Rigorous confidence bounds for MCMC under a geometric drift condition
- Sparse deterministic approximation of Bayesian inverse problems
- Sparse tensor discretizations of high-dimensional parametric and stochastic PDEs
- Spectral gaps for a Metropolis-Hastings algorithm in infinite dimensions
- Statistical and computational inverse problems.
- Séminaire de Probabilités XXXVI
- Uncertainty Quantification and Weak Approximation of an Elliptic Inverse Problem
Cited in
(24)- Geometric MCMC for infinite-dimensional inverse problems
- Ensemble sampler for infinite-dimensional inverse problems
- Randomized approaches to accelerate MCMC algorithms for Bayesian inverse problems
- Rate-optimal refinement strategies for local approximation MCMC
- On the convergence of the Laplace approximation and noise-level-robustness of Laplace-based Monte Carlo methods for Bayesian inverse problems
- Nonlocal TV-Gaussian prior for Bayesian inverse problems with applications to limited CT reconstruction
- Dimension-independent likelihood-informed MCMC
- Efficient parameter estimation for a methane hydrate model with active subspaces
- Optimization based methods for partially observed chaotic systems
- Accelerated dimension-independent adaptive metropolis
- Complexity analysis of accelerated MCMC methods for Bayesian inversion
- Analysis of the Gibbs Sampler for Hierarchical Inverse Problems
- A Randomized Maximum A Posteriori Method for Posterior Sampling of High Dimensional Nonlinear Bayesian Inverse Problems
- An MCMC method for uncertainty quantification in nonnegativity constrained inverse problems
- MALA-within-Gibbs samplers for high-dimensional distributions with sparse conditional structure
- Inverse sampling for multivariate ninparametric two-sample problems
- A Bayesian Approach to Estimating Background Flows from a Passive Scalar
- Two Metropolis--Hastings Algorithms for Posterior Measures with Non-Gaussian Priors in Infinite Dimensions
- Sequential Monte Carlo methods for Bayesian elliptic inverse problems
- MCMC methods for functions: modifying old algorithms to make them faster
- Cost free hyper-parameter selection/averaging for Bayesian inverse problems with vanilla and Rao-blackwellized SMC samplers
- Dimension‐independent Markov chain Monte Carlo on the sphere
- Conditional sampling with monotone GANs: from generative models to likelihood-free inference
- Bayesian inversion for electrical impedance tomography by sparse interpolation
This page was built for publication: Dimension-Independent MCMC Sampling for Inverse Problems with Non-Gaussian Priors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2945165)
