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.
| Comments: | 29 pages, 14 figures |
| Subjects: | Machine Learning (stat.ML); Machine Learning (cs.LG); Computation (stat.CO) |
| MSC classes: | 65C20, 93E11, 62F15 |
| Cite as: | arXiv:2605.13174 [stat.ML] |
| (or arXiv:2605.13174v1 [stat.ML] for this version) | |
| https://doi.org/10.48550/arXiv.2605.13174 arXiv-issued DOI via DataCite (pending registration) |
Submission history
From: Dengfei Zeng [view email]
[v1]
Wed, 13 May 2026 08:36:49 UTC (2,766 KB)