Optimal State Estimation in the Presence of Non-Gaussian Uncertainty via Wasserstein Distance Minimization
Abstract: This paper presents a novel distribution-agnostic Wasserstein distance-based estimation framework. The goal is to determine an optimal map combining prior estimate with measurement likelihood such that posterior estimation error optimally reaches the Dirac delta distribution with minimal effort. The Wasserstein metric is used to quantify the effort of transporting from one distribution to another. We hypothesize that minimizing the Wasserstein distance between the posterior error and the Dirac delta distribution results in optimal information fusion and posterior state uncertainty. Framework validation is demonstrated by the successful recovery of the classical Kalman filter for linear systems with Gaussian uncertainties. Notably, the proposed Wasserstein filter does not rely on particle representation of uncertainty. Furthermore, the classical result for the Gaussian Sum Filter (GSF) is retrieved from the Wasserstein framework. This approach analytically exhibits the suboptimality of GSF and enables the use of nonlinear optimization techniques to enhance the accuracy of the Gaussian sum estimator.
- Large-scale wasserstein gradient flows. Advances in Neural Information Processing Systems, 34:15243–15256, 2021.
- Approximate inference with wasserstein gradient flows. In International Conference on Artificial Intelligence and Statistics, pages 2581–2590. PMLR, 2020.
- Wasserstein distributionally robust kalman filtering. Advances in Neural Information Processing Systems, 31, 2018.
- Wasserstein distance for the fusion of multisensor multitarget particle filter clouds. In 2009 12th International Conference on Information Fusion, pages 25–32. IEEE, 2009.
- Ensemble filter techniques for intermittent data assimilation. Large Scale Inverse Problems: Computational Methods and Applications in the Earth Sciences, 13:91–134, 2013.
- Sebastian Reich. A nonparametric ensemble transform method for bayesian inference. SIAM Journal on Scientific Computing, 35(4):A2013–A2024, 2013.
- Optimal-transport-based tracking of space objects using range data from a single ranging station. Journal of Guidance, Control, and Dynamics, 42(6):1237–1249, 2019.
- Optimal transport based tracking of space objects in cylindrical manifolds. The Journal of the Astronautical Sciences, 66(4):582–606, 2019.
- An optimal transport formulation of the ensemble kalman filter. IEEE Transactions on Automatic Control, 66(7):3052–3067, 2020.
- Inference with aggregate data in probabilistic graphical models: An optimal transport approach. IEEE Transactions on Automatic Control, 67(9):4483–4497, 2022.
- Optimal transport in systems and control. Annual Review of Control, Robotics, and Autonomous Systems, 4:89–113, 2021.
- An optimal transport formulation of bayes’ law for nonlinear filtering algorithms. In 2022 IEEE 61st Conference on Decision and Control (CDC), pages 6608–6613. IEEE, 2022.
- Differentiable particle filtering via entropy-regularized optimal transport. In International Conference on Machine Learning, pages 2100–2111. PMLR, 2021.
- Optimal transport for applications in control and estimation. IEEE Control Systems Magazine, 41(4):28–33, 2021.
- C. Villani. Topics in optimal transportation, volume 58. Amer Mathematical Society, 2003.
- A. Halder and R. Bhattacharya. Further results on probabilistic model validation in wasserstein metric. In 51st IEEE Conference on Decision and Control, Maui, 2012.
- Sadri Hassani. Mathematical physics, a modern introduction to its foundations, 1999.
- I. Bilik and J. Tabrikian. Optimal recursive filtering using gaussian mixture model. In IEEE/SP 13th Workshop on Statistical Signal Processing, 2005, pages 399–404, 2005.
- Performance and robustness analysis of stochastic jump linear systems using wasserstein metric. Automatica, 51:341–347, 2015.
- Optimal filtering. Prentice Hall, 1979.
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.