A Caltech Library Service

Ergodicity and Accuracy of Optimal Particle Filters for Bayesian Data Assimilation

Kelly, David and Stuart, Andrew M. (2019) Ergodicity and Accuracy of Optimal Particle Filters for Bayesian Data Assimilation. Chinese Annals of Mathematics, Series B, 40 (5). pp. 811-842. ISSN 0252-9599. doi:10.1007/s11401-019-0161-5.

[img] PDF - Submitted Version
See Usage Policy.


Use this Persistent URL to link to this item:


Data assimilation refers to the methodology of combining dynamical models and observed data with the objective of improving state estimation. Most data assimilation algorithms are viewed as approximations of the Bayesian posterior (filtering distribution) on the signal given the observations. Some of these approximations are controlled, such as particle filters which may be refined to produce the true filtering distribution in the large particle number limit, and some are uncontrolled, such as ensemble Kalman filter methods which do not recover the true filtering distribution in the large ensemble limit. Other data assimilation algorithms, such as cycled 3DVAR methods, may be thought of as controlled estimators of the state, in the small observational noise scenario, but are also uncontrolled in general in relation to the true filtering distribution. For particle filters and ensemble Kalman filters it is of practical importance to understand how and why data assimilation methods can be effective when used with a fixed small number of particles, since for many large-scale applications it is not practical to deploy algorithms close to the large particle limit asymptotic. In this paper, the authors address this question for particle filters and, in particular, study their accuracy (in the small noise limit) and ergodicity (for noisy signal and observation) without appealing to the large particle number limit. The authors first overview the accuracy and minorization properties for the true filtering distribution, working in the setting of conditional Gaussianity for the dynamics-observation model. They then show that these properties are inherited by optimal particle filters for any fixed number of particles, and use the minorization to establish ergodicity of the filters. For completeness we also prove large particle number consistency results for the optimal particle filters, by writing the update equations for the underlying distributions as recursions. In addition to looking at the optimal particle filter with standard resampling, they derive all the above results for (what they term) the Gaussianized optimal particle filter and show that the theoretical properties are favorable for this method, when compared to the standard optimal particle filter.

Item Type:Article
Related URLs:
URLURL TypeDescription ReadCube access Paper
Additional Information:© 2019 The Editorial Office of CAM and Springer-Verlag Berlin Heidelberg. First Online: 10 September 2019. This work was supported by EPSRC (EQUIPS Program Grant), DARPA (contract W911NF-15-2-0121) and ONR (award N00014-17-1-2079). DK was supported as an NYU-Courant instructor. The authors are grateful to an anonymous referee for comments on an earlier version of this paper which have led to a correction of the presentation in Subsection 2.2, and pointers to relevant literature that were previously omitted; they are also grateful to Jonathan Mattingly for discussions relating to ergodicity of nonlinear Markov processes, and to Arnaud Doucet and Adam Johansen for helpful pointers to the literature. The authors also highlight, on the occasion of his 70th birthday, the inspirational work of Andy Majda, in applied mathematics in general, and in the area of data assimilation and filtering (the subject of this paper) in particular.
Funding AgencyGrant Number
Courant InstituteUNSPECIFIED
Engineering and Physical Sciences Research Council (EPSRC)UNSPECIFIED
Defense Advanced Research Projects Agency (DARPA)W911NF-15-2-0121
Office of Naval Research (ONR)N00014-17-1-2079
Subject Keywords:Particle filters; Data assimilation; Ergodic theory
Issue or Number:5
Classification Code:2000 MR Subject Classification: 60G35; 62M20; 37H99; 60F99
Record Number:CaltechAUTHORS:20161221-161911353
Persistent URL:
Official Citation:Kelly, D. & Stuart, A.M. Chin. Ann. Math. Ser. B (2019) 40: 811.
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:73108
Deposited By: Linda Taddeo
Deposited On:22 Dec 2016 00:26
Last Modified:11 Nov 2021 05:11

Repository Staff Only: item control page