arXiv:2208.10810 [math.OC]AbstractReferencesReviewsResources
Probing robustness of nonlinear filter stability numerically using Sinkhorn divergence
Pinak Mandal, Shashank Kumar Roy, Amit Apte
Published 2022-08-23Version 1
Using the recently developed Sinkhorn algorithm for approximating the Wasserstein distance between probability distributions represented by Monte Carlo samples, we demonstrate exponential filter stability of two commonly used nonlinear filtering algorithms, namely, the particle filter and the ensemble Kalman filter, for deterministic dynamical systems. We also establish numerically a relation between filter stability and filter convergence by showing that the Wasserstein distance between filters with two different initial conditions is proportional to the bias or the RMSE of the filter.
Comments: 14 pages, 2 figures, 2 tables
Categories: math.OC
Related articles: Most relevant | Search more
arXiv:2006.08172 [math.OC] (Published 2020-06-15)
Faster Wasserstein Distance Estimation with the Sinkhorn Divergence
arXiv:1604.02199 [math.OC] (Published 2016-04-08)
Distributionally Robust Stochastic Optimization with Wasserstein Distance
Distributionally Fair Stochastic Optimization using Wasserstein Distance