An Optimal Transport Formulation of the Ensemble Kalman Filter

• Published in: IEEE transactions on automatic control Vol. 66; no. 7; pp. 3052 - 3067
• Main Authors: Taghvaei, Amirhossein, Mehta, Prashant G.
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.07.2021; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Approximation algorithms; Control systems; Control theory; Convergence; Empirical equations; Error analysis; Feedback control; Filtering algorithms; Importance sampling; Kalman filter; Kalman filters; Monte Carlo methods; Optimal control; stochastic processes; Symmetric matrices; Transportation problem
• ISSN: 0018-9286; 1558-2523
• DOI: 10.1109/TAC.2020.3015410

Controlled interacting particle systems such as the ensemble Kalman filter (EnKF) and the feedback particle filter (FPF) are numerical algorithms to approximate the solution of the nonlinear filtering problem in continuous time. The distinguishing feature of these algorithms is that the Bayesian update step is implemented using a feedback control law. It has been noted in the literature that the control law is not unique. This is the main problem addressed in this article. To obtain a unique control law, the filtering problem is formulated here as an optimal transportation problem. An explicit formula for the (mean-field type) optimal control law is derived in the linear Gaussian setting. Comparisons are made with the control laws for different types of EnKF algorithms described in the literature. Via empirical approximation of the mean-field control law, a finite-<inline-formula><tex-math notation="LaTeX">N</tex-math></inline-formula> controlled interacting particle algorithm is obtained. For this algorithm, the equations for empirical mean and covariance are derived and shown to be identical to the Kalman filter. This allows strong conclusions on convergence and error properties based on the classical filter stability theory for the Kalman filter. It is shown that, under certain technical conditions, the mean squared error converges to zero even with a finite number of particles. A detailed propagation of chaos analysis is carried out for the finite-<inline-formula><tex-math notation="LaTeX">N</tex-math></inline-formula> algorithm. The analysis is used to prove weak convergence of the empirical distribution as <inline-formula><tex-math notation="LaTeX">N\rightarrow \infty</tex-math></inline-formula>. For a certain simplified filtering problem, analytical comparison of the mse with the importance sampling-based algorithms is described. The analysis helps explain the favorable scaling properties of the control-based algorithms reported in several numerical studies in recent literature.