SearcharxivSearch

arXiv · 2107.01855

A theoretical analysis of one-dimensional discrete generation ensemble Kalman particle filters

Abstract

Despite the widespread usage of discrete generation Ensemble Kalman particle filtering methodology to solve nonlinear and high dimensional filtering and inverse problems, little is known about their mathematical foundations. As genetic-type particle filters (a.k.a. sequential Monte Carlo), this ensemble-type methodology can also be interpreted as mean-field particle approximations of the Kalman-Bucy filtering equation. In contrast with conventional mean-field type interacting particle methods equipped with a globally Lipschitz interacting drift-type function, Ensemble Kalman filters depend on a nonlinear and quadratic-type interaction function defined in terms of the sample covariance of the particles. Most of the literature in applied mathematics and computer science on these sophisticated interacting particle methods amounts to designing different classes of useable observer-type particle methods. These methods are based on a variety of inconsistent but judicious ensemble auxiliary transformations or include additional inflation/localisationtype algorithmic innovations, in order to avoid the inherent time-degeneracy of an insufficient particle ensemble size when solving a filtering problem with an unstable signal. To the best of our knowledge, the first and the only rigorous mathematical analysis of these sophisticated discrete generation particle filters is developed in the pioneering articles by Le Gland-Monbet-Tran and by Mandel-Cobb-Beezley, which were published in the early 2010s. Nevertheless, besides the fact that these studies prove the asymptotic consistency of the Ensemble Kalman filter, they provide exceedingly pessimistic meanerror estimates that grow exponentially fast with respect to the time horizon, even for linear Gaussian filtering problems with stable one dimensional signals. In the present article we develop a novel self-contained and complete stochastic perturbation analysis of the fluctuations, the stability, and the long-time performance of these discrete generation ensemble Kalman particle filters, including time-uniform and non-asymptotic mean-error estimates that apply to possibly unstable signals. To the best of our knowledge, these are the first results of this type in the literature on discrete generation particle filters, including the class of genetic-type particle filters and discrete generation ensemble Kalman filters. The stochastic Riccati difference equations considered in this work are also of interest in their own right, as a prototype of a new class of stochastic rational difference equation.

Explore related subjects

Keep this discovery

BibTeXRIS

Pierre del Moral, Emma Horton. 2021-07-05. A theoretical analysis of one-dimensional discrete generation ensemble Kalman particle filters. https://arxiv.org/abs/2107.01855

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR