2000 character limit reached
Probing robustness of nonlinear filter stability numerically using Sinkhorn divergence
Published 23 Aug 2022 in math.OC | (2208.10810v2)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.