Accelerating MCMC with active subspaces

Abstract

The Markov chain Monte Carlo (MCMC) method is the computational workhorse for Bayesian inverse problems. However, MCMC struggles in high-dimensional parameter spaces, since its iterates must sequentially explore the high-dimensional space. This struggle is compounded in physical applications when the nonlinear forward model is computationally expensive. One approach to accelerate MCMC is to reduce the dimension of the state space. Active subspaces are part of an emerging set of tools for subspace-based dimension reduction. An active subspace in a given inverse problem indicates a separation between a low-dimensional subspace that is informed by the data and its orthogonal complement that is constrained by the prior. With this information, one can run the sequential MCMC on the active variables while sampling independently according to the prior on the inactive variables. However, this approach to increase efficiency may introduce bias. We provide a bound on the Hellinger distance between the true posterior and its active subspace- exploiting approximation. And we demonstrate the active subspace-accelerated MCMC on two computational examples: (i) a two-dimensional parameter space with a quadratic forward model and one-dimensional active subspace and (ii) a 100-dimensional parameter space with a PDE-based forward model and a two-dimensional active subspace.

References in corpus (5)

• Markov Chain Monte Carlo: Can We Trust the Third Significant Figure?
• Dimension-independent likelihood-informed MCMC
• Exploiting Active Subspaces to Quantify Uncertainty in the Numerical Simulation of the HyShot II Scramjet
• Likelihood-informed dimension reduction for nonlinear inverse problems
• Solving Large-Scale PDE-constrained Bayesian Inverse Problems with Riemann Manifold Hamiltonian Monte Carlo

Cited by in corpus (16)

• Simulator-free Solution of High-Dimensional Stochastic Elliptic Partial Differential Equations using Deep Neural Networks
• Geometric MCMC for Infinite-Dimensional Inverse Problems
• Bayesian calibration and sensitivity analysis for a karst aquifer model using active subspaces
• Residual-based error correction for neural operator accelerated infinite-dimensional Bayesian inverse problems
• Functional Tucker approximation using Chebyshev interpolation
• Adaptive Dimension Reduction to Accelerate Infinite-Dimensional Geometric Markov Chain Monte Carlo
• Strategic model reduction by analysing model sloppiness: a case study in coral calcification
• Data-Free Likelihood-Informed Dimension Reduction of Bayesian Inverse Problems
• Multi-fidelity data fusion through parameter space reduction with applications to automotive engineering
• Efficient parameter estimation for a methane hydrate model with active subspaces
• Variational Inference for Nonlinear Inverse Problems via Neural Net Kernels: Comparison to Bayesian Neural Networks, Application to Topology Optimization
• Discovering Active Subspaces for High-Dimensional Computer Models
• Generalized bounds for active subspaces
• TAEN: A Model-Constrained Tikhonov Autoencoder Network for Forward and Inverse Problems
• Analysis of sloppiness in model simulations: unveiling parameter uncertainty when mathematical models are fitted to data
• Identifying sensitivity-dominant parameters via active subspaces in reduced-order modeling of fluid dynamics