Coupling-Informed Transport Maps for Bayesian Filtering in Nonlinear Dynamical Systems

• URL: http://arxiv.org/abs/2605.13174v1
• Date: Wed, 13 May 2026 08:36:49 GMT
• Title: Coupling-Informed Transport Maps for Bayesian Filtering in Nonlinear Dynamical Systems
• Abstract summary: A likelihood-free transport filtering approach is proposed based on the couplings between state and observation variables.<n>We provide an analysis for the computation of the MMD between the highd posterior and the posterior domain.
• Score: 0.8420900279981681
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A likelihood-free transport filtering method is proposed based on the couplings between state and observation variables. By exploiting a block-triangular structure in the transport map, the analysis step of filtering is reformulated as the minimization of the maximum mean discrepancy (MMD) between the true joint measure and its transport-based approximation. To circumvent the non-convexity in the MMD optimization, we introduce a training-free transport filter method via gradient flows, which leads to an analytic computation for the transport map that implies the steepest descent direction of the MMD. The proposed approach accurately approximates non-Gaussian filtering posteriors and avoids particle collapse. We provide a convergence analysis for the expectation of the MMD between the approximated posterior and the truth posterior. Finally, we extend the method to high-dimensional problems through domain localization. Numerical examples demonstrate the superior performance of our approach over conventional filtering methods in nonlinear, non-Gaussian scenarios.

Related papers

• Generative models for simulation based filtering: Formulations and Empirical Comparisons [8.069165304041247]
  This letter presents a unified formulation and a controlled numerical comparison of generative-model approaches to the nonlinear filtering problem.<n>We derive three new filters, based on interpolants, their deterministic flow-limit, and Schrdinger bridges realized through forward-matching SDEs.<n>The resulting methods are compared against the optimal transport filter, the Knothe--Rosenblatt filter (KRF), the sequential importance resampling (SIR) particle filter and the ensemble Kalman filter (EnKF)
  arXiv  Detail & Related papers  (2026-09-14T20:31:29Z)
• Total Uncertainty Quantification in Inverse PDE Solutions Obtained with Reduced-Order Deep Learning Surrogate Models [50.90868087591973]
  We propose an approximate Bayesian method for quantifying the total uncertainty in inverse PDE solutions obtained with machine learning surrogate models. We test the proposed framework by comparing it with the iterative ensemble smoother and deep ensembling methods for a non-linear diffusion equation.
  arXiv  Detail & Related papers  (2024-08-20T19:06:02Z)
• Ensemble Transport Filter via Optimized Maximum Mean Discrepancy [0.0]
  We present a new ensemble-based filter method by reconstructing the analysis step of the particle filter through a transport map. The transport map is constructed through an optimization problem described by the Maximum Mean Discrepancy loss function. A few numerical examples are presented to illustrate the advantage of the proposed method over the ensemble Kalman filter.
  arXiv  Detail & Related papers  (2024-07-16T08:54:12Z)
• Closed-form Filtering for Non-linear Systems [83.91296397912218]
  We propose a new class of filters based on Gaussian PSD Models, which offer several advantages in terms of density approximation and computational efficiency. We show that filtering can be efficiently performed in closed form when transitions and observations are Gaussian PSD Models. Our proposed estimator enjoys strong theoretical guarantees, with estimation error that depends on the quality of the approximation and is adaptive to the regularity of the transition probabilities.
  arXiv  Detail & Related papers  (2024-02-15T08:51:49Z)
• Nonlinear Filtering with Brenier Optimal Transport Maps [6.048942663334447]
  This paper is concerned with the problem of nonlinear filtering, i.e., computing the conditional distribution of the state of a dynamical system.<n>Conventional sequential importance resampling (SIR) particle filters suffer from fundamental limitations, in scenarios involving degenerate likelihoods or high-dimensional states.<n>In this paper, we explore an alternative method, which is based on estimating the Brenier optimal transport (OT) map from the current prior distribution of the state to the posterior distribution at the next time step.
  arXiv  Detail & Related papers  (2023-10-21T01:34:30Z)
• Manifold Interpolating Optimal-Transport Flows for Trajectory Inference [64.94020639760026]
  We present a method called Manifold Interpolating Optimal-Transport Flow (MIOFlow) MIOFlow learns, continuous population dynamics from static snapshot samples taken at sporadic timepoints. We evaluate our method on simulated data with bifurcations and merges, as well as scRNA-seq data from embryoid body differentiation, and acute myeloid leukemia treatment.
  arXiv  Detail & Related papers  (2022-06-29T22:19:03Z)
• Computational Doob's h-transforms for Online Filtering of Discretely Observed Diffusions [65.74069050283998]
  We propose a computational framework to approximate Doob's $h$-transforms. The proposed approach can be orders of magnitude more efficient than state-of-the-art particle filters.
  arXiv  Detail & Related papers  (2022-06-07T15:03:05Z)
• An Optimal Transport Formulation of Bayes' Law for Nonlinear Filtering Algorithms [7.919213739992465]
  This paper presents a variational representation of the Bayes' law using optimal transportation theory. By imposing certain structure on the transport map, the solution to the variational problem is used to construct a Brenier-type map. The proposed methodology is used to derive the optimal transport form of the feedback particle filler (FPF) in the continuous-time limit.
  arXiv  Detail & Related papers  (2022-03-22T16:43:33Z)
• Differentiable Annealed Importance Sampling and the Perils of Gradient Noise [68.44523807580438]
  Annealed importance sampling (AIS) and related algorithms are highly effective tools for marginal likelihood estimation. Differentiability is a desirable property as it would admit the possibility of optimizing marginal likelihood as an objective. We propose a differentiable algorithm by abandoning Metropolis-Hastings steps, which further unlocks mini-batch computation.
  arXiv  Detail & Related papers  (2021-07-21T17:10:14Z)
• Continuous Wasserstein-2 Barycenter Estimation without Minimax Optimization [94.18714844247766]
  Wasserstein barycenters provide a geometric notion of the weighted average of probability measures based on optimal transport. We present a scalable algorithm to compute Wasserstein-2 barycenters given sample access to the input measures.
  arXiv  Detail & Related papers  (2021-02-02T21:01:13Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.