Mean field limit of Ensemble Square Root Filters -- discrete and continuous time

Abstract

Consider the class of Ensemble Square Root filtering algorithms for the numerical approximation of the posterior distribution of nonlinear Markovian signals partially observed with linear observations corrupted with independent measurement noise. We analyze the asymptotic behavior of these algorithms in the large ensemble limit both in discrete and continuous time. We identify limiting mean-field processes on the level of the ensemble members, prove corresponding propagation of chaos results and derive associated convergence rates in terms of the ensemble size. In continuous time we also identify the stochastic partial differential equation driving the distribution of the mean-field process and perform a comparison with the Kushner-Stratonovich equation.

Accepted for publication in Foundations of Data Science. Revised version: corrected typos, added more explanations, updated Theorem 3.1 (holds for all p >=2)

References in corpus (1)

• Convergence of the Square Root Ensemble Kalman Filter in the Large Ensemble Limit

Cited by in corpus (4)

• Non-Asymptotic Analysis of Ensemble Kalman Updates: Effective Dimension and Localization
• Gradient flow structure and convergence analysis of the ensemble Kalman inversion for nonlinear forward models
• Uniform error bounds of the ensemble transform Kalman filter for infinite-dimensional dynamics with multiplicative covariance inflation
• Analysis of the Ensemble Kalman--Bucy Filter for correlated observation noise