On dimension reduction in Gaussian filters
From MaRDI portal
Publication:2806026
DOI10.1088/0266-5611/32/4/045003zbMATH Open1361.65036arXiv1508.06452OpenAlexW1902776040WikidataQ58650089 ScholiaQ58650089MaRDI QIDQ2806026FDOQ2806026
Authors: Antti Solonen, Tiangang Cui, Janne Hakkarainen, Youssef M. Marzouk 
Publication date: 13 May 2016
Published in: Inverse Problems (Search for Journal in Brave)
Abstract: A priori dimension reduction is a widely adopted technique for reducing the computational complexity of stationary inverse problems. In this setting, the solution of an inverse problem is parameterized by a low-dimensional basis that is often obtained from the truncated Karhunen-Loeve expansion of the prior distribution. For high-dimensional inverse problems equipped with smoothing priors, this technique can lead to drastic reductions in parameter dimension and significant computational savings. In this paper, we extend the concept of a priori dimension reduction to non-stationary inverse problems, in which the goal is to sequentially infer the state of a dynamical system. Our approach proceeds in an offline-online fashion. We first identify a low-dimensional subspace in the state space before solving the inverse problem (the offline phase), using either the method of "snapshots" or regularized covariance estimation. Then this subspace is used to reduce the computational complexity of various filtering algorithms - including the Kalman filter, extended Kalman filter, and ensemble Kalman filter - within a novel subspace-constrained Bayesian prediction-and-update procedure (the online phase). We demonstrate the performance of our new dimension reduction approach on various numerical examples. In some test cases, our approach reduces the dimensionality of the original problem by orders of magnitude and yields up to two orders of magnitude in computational savings.
Full work available at URL: https://arxiv.org/abs/1508.06452
Recommendations
- Dimensional reduction for a Bayesian filter
- Likelihood-informed dimension reduction for nonlinear 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
- Dimensionality reduction and polynomial chaos acceleration of Bayesian inference in inverse problems
Bayesian inference (62F15) Inference from stochastic processes and prediction (62M20) Numerical solution to inverse problems in abstract spaces (65J22)
Cited In (15)
- A marginalized unscented Kalman filter for efficient parameter estimation with applications to finite element models
- Rényi dimension and Gaussian filtering. II.
- Ensemble transport smoothing. II: Nonlinear updates
- Enhancing compressed sensing 4D photoacoustic tomography by simultaneous motion estimation
- Title not available (Why is that?)
- Model reduction of linear dynamical systems via balancing for Bayesian inference
- Eliminating beta-continuation from Heaviside projection and density filter algorithms
- Multi-Dimensional Filtering: Reducing the Dimension Through Rotation
- An ensemble score filter for tracking high-dimensional nonlinear dynamical systems
- Dimensional reduction for a Bayesian filter
- A Defensive Marginal Particle Filtering Method for Data Assimilation
- Bayesian inverse regression for supervised dimension reduction with small datasets
- Uniqueness of the Gaussian Kernel for Scale-Space Filtering
- Accelerating inverse inference of ensemble Kalman filter via reduced-order model trained using adaptive sparse observations
- Efficient state/parameter estimation in nonlinear unsteady PDEs by a reduced basis ensemble Kalman filter
Uses Software
This page was built for publication: On dimension reduction in Gaussian filters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2806026)
