Particle filter

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Particle filters or Sequential Monte Carlo (SMC) methods are a set of genetic-type particle Monte Carlo methodologies to solve the filtering problem. The term "particle filters" was first coined in 1996 by Del Moral[1] in reference to mean field interacting particle methods used in fluid mechanics since the beginning of the 1960s. The terminology "sequential Monte Carlo" was proposed by Liu and Chen in 1998.

From the statistical and probabilistic point of view, particle filters can be interpreted as mean field particle interpretations of Feynman-Kac probability measures.[2][3][4][5][6] These particle integration techniques were developed in molecular chemistry and computational physics by Theodore E. Harris and Herman Kahn in 1951, Marshall. N. Rosenbluth and Arianna. W. Rosenbluth in 1955[7] and more recently by Jack H. Hetherington in 1984.[8] In computational physics, these Feynman-Kac type path particle integration methods are also used in Quantum Monte Carlo, and more specifically Diffusion Monte Carlo methods.[9][10][11] Feynman-Kac interacting particle methods are also strongly related to mutation-selection genetic algorithms currently used in evolutionary computing to solve complex optimization problems.

The particle filter methodology is used to solve Hidden Markov Chain (HMM) and nonlinear filtering problems arising in signal processing and Bayesian statistical inference. The filtering problem consists in estimating the internal states in dynamical systems when partial observations are made, and random perturbations are present in the sensors as well as in the dynamical system. The objective is to compute the conditional probability (a.k.a. posterior distributions) of the states of some Markov process, given some noisy and partial observations. With the notable exception of linear-Gaussian signal-observation models (Kalman filter) or wider classes of models (Benes filter[12]) Mireille Chaleyat-Maurel and Dominique Michel proved in 1984 that the sequence of posterior distributions of the random states of the signal given the observations (a.k.a. optimal filter) have no finitely recursive recursion.[13] Various numerical methods based on fixed grid approximations, Markov Chain Monte Carlo techniques (MCMC), conventional linearization, extended Kalman filters, or determining the best linear system (in expect cost-error sense) have never really coped with large scale systems, unstable processes or when the nonlinearities are not sufficiently smooth.

Particle filtering methodology uses a genetic type mutation-selection sampling approach, with a set of particles (also called individuals, or samples) to represent the posterior distribution of some stochastic process given some noisy and/or partial observations. The state-space model can be nonlinear and the initial state and noise distributions can take any form required. Particle filter techniques provide a well-established methodology[1][14][15] for generating samples from the required distribution without requiring assumptions about the state-space model or the state distributions. However, these methods do not perform well when applied to very high-dimensional systems.

Particle filters implement the prediction-updating transitions of the filtering equation directly by using a genetic type mutation-selection particle algorithm. The samples from the distribution are represented by a set of particles; each particle has a likelihood weight assigned to it that represents the probability of that particle being sampled from the probability density function. Weight disparity leading to weight collapse is a common issue encountered in these filtering algorithms; however it can be mitigated by including a resampling step before the weights become too uneven. Several adaptive resampling criteria can be used, including the variance of the weights and the relative entropy w.r.t. the uniform distribution.[16] In the resampling step, the particles with negligible weights are replaced by new particles in the proximity of the particles with higher weights.

Particle filters and Feynman-Kac particle methodologies find application in signal and image processing, Bayesian inference, machine learning, risk analysis and rare event sampling, engineering and robotics, artificial intelligence, bioinformatics, phylogenetics, computational science, Economics and mathematical finance, molecular chemistry, computational physics, pharmacokinetic and other fields.


Heuristic like algorithms[edit]

From the statistical and probabilistic viewpoint, particle filters belong to the class of branching/genetic type algorithms, and mean field type interacting particle methodologies. The interpretations of these particle methods depends on the scientific discipline. In Evolutionary Computing, mean field genetic type particle methodologies are often used as a heuristic and natural search algorithms (a.k.a. Metaheuristic). In computational physics and molecular chemistry they are used to solve Feynman-Kac path integration problems, or the compute Boltzmann-Gibbs measures, top eigenvalues and ground states of Schrödinger operators. In Biology and Genetics they also represent the evolution of a population of individuals or genes in some environment.

The origins of mean field type evolutionary computational techniques can be traced to 1950 and 1954 with the seminal work of Alan Turing on genetic type mutation-selection learning machines[17] and the articles by Nils Aall Barricelli at the Institute for Advanced Study in Princeton, New Jersey.[18][19] The first trace of particle filters in statistical methodology dates back to the mid-50's; the 'Poor Man's Monte Carlo',[20] that was proposed by Hammersley et al., in 1954, contained hints of the genetic type particle filtering methods used today. In 1963, Nils Aall Barricelli simulated a genetic type algorithm to mimic the ability of individuals to play a simple game.[21] In evolutionary computing literature, genetic type mutation-selection algorithms became popular through the seminal work of John Holland in the early 1970s, and particularly his book[22] published in 1975.

In Biology and Genetics, the Australian geneticist Alex Fraser also published in 1957 a series of papers on the genetic type simulation of artificial selection of organisms.[23] The computer simulation of evolution by biologists became more common in the early 1960s, and the methods were described in books by Fraser and Burnell (1970)[24] and Crosby (1973).[25] Fraser's simulations included all of the essential elements of modern mutation-selection genetic particle algorithms.

From the mathematical viewpoint, the conditional distribution of the random states of a signal given some partial and noisy observations is described by a Feynman-Kac probability on the random trajectories of the signal weighted by a sequence of likelihood potential functions.[2][3] Quantum Monte Carlo, and more specifically Diffusion Monte Carlo methods can also be interpreted as a mean field genetic type particle approximation of Feynman-Kac path integrals.[2][3][4][8][9][26][27] The origins of Quantum Monte Carlo methods are often attributed to Enrico Fermi and Robert Richtmyer who developed in 1948 a mean field particle interpretation of neutron-chain reactions,[28] but the first heuristic-like and genetic type particle algorithm (a.k.a. Resampled or Reconfiguration Monte Carlo methods) for estimating ground state energies of quantum systems (in reduced matrix models) is due to Jack H. Hetherington in 1984.[8] We also quote an earlier seminal works of Theodore E. Harris and Herman Kahn in particle physics, published in 1951, using mean field but heuristic-like genetic methods for estimating particle transmission energies.[29] In molecular chemistry, the use of genetic heuristic-like particle methodologies (a.k.a. pruning and enrichment strategies) can be traced back to 1955 with the seminal work of Marshall. N. Rosenbluth and Arianna. W. Rosenbluth.[7]

The use of genetic particle algorithms in advanced signal processing and Bayesian inference is more recent. It was in 1993, that Gordon et al., published in their seminal work[30] the first application of genetic type algorithm in Bayesian statistical inference. The authors named their algorithm 'the bootstrap filter', and demonstrated that compared to other filtering methods, their bootstrap algorithm does not require any assumption about that state-space or the noise of the system. We also quote another pioneering article in this field of Genshiro Kitagawa on a related "Monte Carlo filter",[31] and the ones by Pierre Del Moral[1] and Himilcon Carvalho, Pierre Del Moral, André Monin and Gérard Salut[32] on particle filters published in the mid-1990s. Particle filters were also developed in signal processing in the early 1989-1992 by P. Del Moral, J.C. Noyer, G. Rigal, and G. Salut in the LAAS-CNRS in a series of restricted and classified research reports with STCAN (Service Technique des Constructions et Armes Navales), the IT company DIGILOG, and the LAAS-CNRS (the Laboratory for Analysis and Architecture of Systems) on RADAR/SONAR and GPS signal processing problems.[33][34][35][36][37][38]

Mathematical foundations[edit]

From 1950 to 1996, all the publications on particle filters, genetic algorithms, including the pruning and resample Monte Carlo methods introduced in computational physics and molecular chemistry, present natural and heuristic-like algorithms applied to different situations without a single proof of their consistency, nor a discussion on the bias of the estimates and on genealogical and ancestral tree based algorithms.

The mathematical foundations and the first rigorous analysis of these particle algorithms are due to Pierre Del Moral[1][14] in 1996. The article[1] also contains a proof of the unbiased properties of a particle approximations of likelihood functions and unnormalized conditional probability measures. The unbiased particle estimator of the likelihood functions presented in this article is used today in Bayesian statistical inference.

Branching type particle methodologies with varying population sizes were also developed toward the end of the 1990s by Dan Crisan, Jessica Gaines and Terry Lyons,[39][40][41] and by Dan Crisan, Pierre Del Moral and Terry Lyons.[42] Further developments in this field were developed in 2000 by P. Del Moral, A. Guionnet and L. Miclo.[3][43][44] The first central limit theorems are due to Pierre Del Moral and Alice Guionnet[45] in 1999 and Pierre Del Moral and Laurent Miclo[3] in 2000. The first uniform convergence results with respect to the time parameter for particle filters were developed in the end of the 1990s by Pierre Del Moral and Alice Guionnet.[43][44] The first rigorous analysis of genealogical tree based particle filter smoothers is due to P. Del Moral and L. Miclo in 2001[46]

The theory on Feynman-Kac particle methodologies and related particle filters algorithms has been developed in 2000 and 2004 in the books.[3][15] These abstract probabilistic models encapsulate genetic type algorithms, particle and bootstrap filters, interacting Kalman filters (a.k.a. Rao–Blackwellized particle filter[47]), importance sampling and resampling style particle filter techniques, including genealogical tree based and particle backward methodologies for solving filtering and smoothing problems. Other classes of particle filtering methodologies includes genealogical tree based models,[5][15][48] backward Markov particle models,[5][49] adaptive mean field particle models,[16] island type particle models,[50][51] and particle Markov chain Monte Carlo methodologies.[52][53]

The filtering problem[edit]


The objective of a particle filter is to estimate the posterior density of the state variables given the observation variables. The particle filter is designed for a hidden Markov Model, where the system consists of hidden and observable variables. The observable variables (observation process) are related to the hidden variables (state-process) by some functional form that is known. Similarly the dynamical system describing the evolution of the state variables is also known probabilistically.

A generic particle filter estimates the posterior distribution of the hidden states using the observation measurement process. Consider a state-space shown in the diagram below.

{\displaystyle \begin{array}{cccccccccc}

The filtering problem is to estimate sequentially the values of the hidden states {\textstyle X_k}, given the values of the observation process ' Y_0,\ldots,Y_k~, at any time step k.

All Bayesian estimates of X_k follow from the posterior density p(xk | y0,y1,…,yk). The particle filter methodology provides an approximation of these conditional probabilities using the empirical measure associated with a genetic type particle algorithm. In contrast, the MCMC or importance sampling approach would model the full posterior p(x0,x1,…,xk | y0,y1,…,yk).

An illustration in Tracking and RADAR processing[edit]

In a 3d-simplified Singer's tracking model[54] the target is represented by a Markov chain with 3 coordinates{\displaystyle X_n=\left(

The first coordinate {\textstyle X^{(1)}_n} represents the acceleration of the target at time {\textstyle n}, the second and the third {\textstyle X^{(2)}_n,~X^{(3)}_n} stands for the speed and the position of the target at time {\textstyle n}.

The maneuver equation are often derived from a time discretization of a continuous time model given by the equations

{\displaystyle \left\{
\end{array}\right.}for some viscosity coefficients \alpha,~\beta~>0, some time step \Delta>0. In the above display, the unknown acceleration jump times are modeled by a sequence of independent and identically distributed \{0,1\}-valued Bernoulli variables \epsilon_n. The unknown speed-up changes are modeled by a sequence of independent and identically distributed variables W_n. The RADAR sensor delivers at each time step some noisy information on the position of the target. This observation model is given the equation

{\displaystyle \forall n\geq 0\, \qquad
Y_n=X_n^{(3)}+\Delta~V_n}The random perturbations of the sensors coming from the thermic noise of the uncertainty of the model are represented by a sequence of independent random variable V_n with a prescribed probability density. The objective of the filtering problem consists of computing sequentially the conditional distribution of the signal X_n~ given an observation sequence Y_0=y_0,\ldots,Y_n=y_n~, at any time step n. A more complex problem is to compute the conditional distribution of the random paths of the signal (X_0,\ldots,X_n)~ given an observation sequence Y_0=y_0,\ldots,Y_n=y_n~, at any time step n. In filtering literature, these state estimation problems can be given different names:

  • The optimal filter is the conditional probability distribution of the signal X_n~ given the observation sequence Y_0=y_0,\ldots,Y_{n-1}=y_{n-1},Y_n=y_n~.
  • The one step optimal predictor is the conditional probability distribution of the signal X_n~ given the observation sequence Y_0=y_0,\ldots,Y_{n-1}=y_{n-1}.
  • The smoothing problem consists of estimating the conditional probability distribution of the signal X_n~ given the observation sequence Y_0=y_0,\ldots,Y_n:y_n,\ldots,Y_{m}=y_m, for some m>n.

The Signal-Observation Model[edit]

Particle methods often assume X_k and the observations Y_k can be modeled in this form:

  • X_0, X_1, \ldots is a Markov process on {\textstyle \mathbb R^{d_x}} (for some d_x\geq 1) that evolves according to the transition probability density p(x_k|x_{k-1}). This model is also often written in a synthetic way as
    {\displaystyle X_k|X_{k-1}=x_{k-1} \sim p(x_k|x_{k-1})}with an initial probability density p(x_0).
  • The observations Y_0, Y_1, \ldots take values in some state space on {\textstyle \mathbb R^{d_y}} (for some d_y\geq 1) are conditionally independent provided that X_0, X_1, \ldots are known. In other words, each Y_k only depends on X_k. In addition, we assume conditional distribution for Y_k given X_k=x_k are absolutely continuous, and in a synthetic way we have
  • {\displaystyle Y_k|X_k=x_k \sim p(y_k|x_k)}

An example of system with these properties is:

X_k = g(X_{k-1}) + W_k \,
Y_k = h(X_k) + V_k \,

where both W_k and V_k are mutually independent sequences with known probability density functions and g(\cdot) and h(\cdot) are known functions. These two equations can be viewed as state space equations and look similar to the state space equations for the Kalman filter. If the functions g(\cdot) and h(\cdot) in the above example are linear, and if both W_k and V_k are Gaussian, the Kalman filter finds the exact Bayesian filtering distribution. If not, Kalman filter based methods are a first-order approximation (EKF) or a second-order approximation (UKF in general, but if probability distribution is Gaussian a third-order approximation is possible).

The assumption that the initial distribution and the transitions of the Markov chain are absolutely continuous with respect to the Lebesgue measure can be relaxed. To design a particle filter we simply need to assume that we can sample the transitions X_{k-1}~\rightarrow~ X_k of the Markov chain X_k, and to compute the likelihood function {\textstyle x_k\mapsto p(y_k|x_k)} (see for instance the genetic selection mutation description of the particle filter given below). The absolutely continuous assumption on the Markov transitions of X_k are only used to derive in an informal (and rather abusive) way different formulae between posterior distributions using the Bayes' rule for conditional densities.

Approximate Bayesian Computation models[edit]

In some important problems, the conditional distribution of the observations given the random states of the signal may fail to have a density or may be impossible or too complex to compute. In this situation, we need to resort to an additional level of approximation. One strategy is to replace the signal X_k by the Markov chain \mathcal X_k=\left(X_k,Y_k\right) and to introduce a virtual observation of the form

{\displaystyle \mathcal Y_k=Y_k+\epsilon~\mathcal V_k\quad\mbox{for some parameter}\quad\epsilon\in [0,1]}

for some sequence of independent sequences with known probability density functions. The central idea is to observe that

{\displaystyle \mbox{Law}\left(X_k~|~\mathcal Y_0=y_0,\ldots, \mathcal Y_k=y_k\right)\approx_{\epsilon\downarrow 0}~
\mbox{Law}\left(X_k~|~Y_0=y_0,\ldots, Y_k=y_k\right)}The particle filter associated with the Markov process \mathcal X_k=\left(X_k,Y_k\right) given the partial observations \mathcal Y_0=y_0,\ldots, \mathcal Y_k=y_k , is defined in terms of particles evolving in {\textstyle \mathbb R^{d_x+d_y}} with a likelihood function given with some obvious abusive notation by p(\mathcal Y_k~|~\mathcal X_k). These probabilistic techniques are closely related to Approximate Bayesian Computation (ABC). In the context of particle filters, these ABC particle filtering techniques were introduced in 1998 by P. Del Moral, J. Jacod and P. Protter in the article.[55] They were further developed by P. Del Moral, A. Doucet and A. Jasra.[56][57]

The nonlinear filtering equation[edit]

The conditional probability densities p(x0,x1,…,xk | y0,y1,…,yk) are given by the Bayes' rule

{\displaystyle p(x_0,...,x_k|y_0,\dots,y_k) =\frac{p(y_0,\dots,y_k|x_0,...,x_k)\times p(x_0,...,x_k)}{p(y_0,\dots,y_k)}\quad\mbox{with}\quad p(y_0,\dots,y_k)=\int
p(y_0,\dots,y_k|x_0,...,x_k)~p(x_0,...,x_k)~dx_0\ldots dx_k}

and the likelihood functions are defined by the product formulae

{\displaystyle p(y_0,\dots,y_k|x_0,...,x_k)=\prod_{0\leq l\leq k} p(y_l|x_l)\qquad \mbox{with} \qquad
p(x_0,...,x_k)=p_0(x_0)\prod_{1\leq l\leq k} p(x_l|x_{l-1})}

Particle filters are also an approximation, but with enough particles they can be much more accurate[1][14][15][43][44].. The nonlinear filtering equation is given by the recursion

{\displaystyle p(x_k|y_0,\ldots,y_{k-1})\stackrel{\mbox{updating}}{-\!\!\!\!-\!\!\!\!-\!\!\!\!-\!\!\!\!-\!\!\!\!-\!\!\!\!-\!\!\!\!-\!\!\!\!-\!\!\!\!-\!\!\!\!\longrightarrow}~~~ p(x_k|y_0,\ldots,y_{k})=\displaystyle\frac{p(y_k|x_k)p(x_k|y_0,\ldots,y_{k-1})}{\int p(y_k|x'_k)p(x'_k|y_0,\ldots,y_{k-1})dx'_k}~~\stackrel{\mbox{prediction}}{-\!\!\!\!-\!\!\!\!-\!\!\!\!-\!\!\!\!-\!\!\!\!-\!\!\!\!-\!\!\!\!-\!\!\!\!-\!\!\!\!-\!\!\!\!\longrightarrow}~~~p(x_{k+1}|y_0,\ldots,y_{k})=\int~p(x_{k+1}|x_k)~p(x_k|y_0,\ldots,y_{k})~dx_k}





(Eq. 1)

with the convention p(x_0|y_0,\ldots,y_{-1})=p(x_0) for k=0. The nonlinear filtering problem consists in computing sequentially these sequence of conditional distributions.

Feynman-Kac formulation[edit]

We fix a time horizon n and a sequence of observations Y_0=y_0,\ldots,Y_n=y_n, and we set G_k(x_k)=p(y_k|x_k),~\mbox{for each}~k=0,\ldots,n. In this notation, for any bounded function F(.) on the set of trajectories of X_k from the origin k=0 up to time k=n, we have the Feynman-Kac formula

{\displaystyle \begin{array}{rcl}
\displaystyle\int F(x_0,\ldots,x_n)~p(x_0,\ldots,x_n|y_0,\ldots,y_n)~dx_0\ldots dx_n&=&\displaystyle\frac{\int F(x_0,\ldots,x_n)~\left\{\prod_{0\leq k\leq n}p(y_k|x_k)\right\}p(x_0,\ldots,x_n)~dx_0\ldots dx_n}{\int~\left\{\prod_{0\leq k\leq n}p(y_k|x_k)\right\}p(x_0,\ldots,x_n)~dx_0\ldots dx_n}\\
&=&\displaystyle\frac{E\left(F(X_0,\ldots,X_n)\prod_{0\leq k\leq n}G_k(X_k)\right)}{E\left(\prod_{0\leq k\leq n}G_k(X_k)\right)}
\end{array}}These Feynman-Kac path integration models arise in a variety of scientific disciplines, including in computational physics, biology, information theory and computer sciences.[3][5][15] Their interpretations depend on the application domain. For instance, if we choose the indicator function G_n(x_n)=1_A(x_n) of some subset of the state space, they represent the conditional distribution of a Markov chain given it stays in a given tube; that is, we have that

{\displaystyle E\left(F(X_0,\ldots,X_n)~|~X_0\in A,~\ldots, X_n\in A\right)
=\displaystyle\frac{E\left(F(X_0,\ldots,X_n)\prod_{0\leq k\leq n}G_k(X_k)\right)}{E\left(\prod_{0\leq k\leq n}G_k(X_k)\right)}
\quad\mbox{and}\quad P\left(X_0\in A,~\ldots, X_n\in A\right)=E\left(\prod_{0\leq k\leq n}G_k(X_k)\right)}as soon as the normalizing constant is strictly positive.

Particle filters[edit]

A Genetic type particle algorithm[edit]

Initially we start with {\textstyle N} independent random variable {\textstyle \left(\xi^i_0\right)_{1\leq i\leq N}} with common probability density {\textstyle p(x_0)} . The genetic algorithm selection-mutation transitions

{\displaystyle \xi_k:=\left(\xi^i_{k}\right)_{1\leq i\leq N}\stackrel{\mbox{selection}}{-\!\!\!\!-\!\!\!\!-\!\!\!\!-\!\!\!\!-\!\!\!\!-\!\!\!\!-\!\!\!\!-\!\!\!\!-\!\!\!\!-\!\!\!\!\longrightarrow} ~\widehat{\xi}_k:=\left(\widehat{\xi}^i_{k}\right)_{1\leq i\leq N}\stackrel{\mbox{mutation}}{-\!\!\!\!-\!\!\!\!-\!\!\!\!-\!\!\!\!-\!\!\!\!-\!\!\!\!-\!\!\!\!-\!\!\!\!-\!\!\!\!-\!\!\!\!\longrightarrow} ~\xi_{k+1}:=\left(\xi^i_{k+1}\right)_{1\leq i\leq N}}

mimic/approximate the updating-prediction transitions of the optimal filter evolution (Eq. 1):

  • During the selection-updating transition we sample N (conditionally) independent random variables {\textstyle \widehat{\xi}_k:=\left(\widehat{\xi}^i_{k}\right)_{1\leq i\leq N}} with common (conditional) distribution{\displaystyle \sum_{1\leq i\leq N}~\frac{p(y_k~|~\xi^i_k)}{\sum_{1\leq j\leq N}p(y_k~|~\xi^j_k)}~\delta_{\xi^i_k}(dx_k)}
  • During the mutation-prediction transition, from each selected particle \widehat{\xi}^i_k we sample independently a transition \widehat{\xi}^i_k~\longrightarrow\xi^i_{k+1}~~\sim~~p(x_{k+1}|\widehat{\xi}^i_k) , for i=1,\ldots,N.

In the above displayed formulae p(y_k~|~\xi^i_k) stands for the likelihood function x_k\mapsto p(y_k~|~x_k) evaluated at x_k=\xi^i_k, and p(x_{k+1}~|~\widehat{\xi}^i_k) stands for the conditional density p(x_{k+1}~|~x_k) evaluated at x_k=\widehat{\xi}^i_k.

At each time k, we have the particle approximations

{\displaystyle \widehat{p}(dx_k~|~y_0,\ldots,y_k):=\frac{1}{N}\sum_{1\leq i\leq N}\delta_{\widehat{\xi}^i_k}(dx_k)~~\approx_{N\uparrow\infty}~~p(dx_k~|~y_0,\ldots,y_k)~~\approx_{N\uparrow\infty}~~
\sum_{1\leq i\leq N}~\frac{p(y_k~|~\xi^i_k)}{\sum_{1\leq j\leq N}p(y_k~|~\xi^j_k)}~\delta_{\xi^i_k}(dx_k)}and

{\displaystyle \widehat{p}(dx_k~|~y_0,\ldots,y_{k-1}):=\frac{1}{N}\sum_{1\leq i\leq N}\delta_{\xi^i_k}(dx_k)~~\approx_{N\uparrow\infty}~~p(dx_k~|~y_0,\ldots,y_{k-1})}

A detailed proof of these convergence results can be found in,[1][14] see also the more recent developments provided in the books.[5][15] In Genetic algorithms and Evolutionary computing community, the mutation-selection

Markov chain described above is often called the genetic algorithm with proportional selection. Several branching variants, including with random population sizes have also been proposed in the articles.[15][39][42]

Monte Carlo principles[edit]

Particle methods, like all sampling-based approaches (e.g., MCMC), generate a set of samples that approximate the filtering density p(x_k|y_0,\dots,y_k). For example, we may have N samples from the approximate posterior distribution of X_k, where the samples are labeled with superscripts as \widehat{\xi}_k^{1}, \widehat{\xi}_k^{2}, \ldots, \widehat{\xi}_k^{N}. Then, expectations with respect to the filtering distribution are approximated by

{\displaystyle \int f(x_k)p(x_k|y_0,\dots,y_k) \, dx_k\approx_{N\uparrow\infty}\frac1N \sum_{i=1}^Nf\left(\widehat{\xi}_k^{i}\right)=\int f(x_k)~\widehat{p}(dx_k|y_0,\dots,y_k)\quad with\quad 
\widehat{p}(dx_k|y_0,\dots,y_k)=\frac{1}{N}\sum_{1\leq i\leq N}\delta_{\widehat{\xi}^{i}_k}(dx_k)}





(Eq. 2)

In the above display {\textstyle 
} stands for the Dirac measure at a given state a. The function f(\cdot), in the usual way for Monte Carlo, can give all the moments etc. of the distribution up to some degree of approximation. When the approximation equation (Eq. 2) is satisfied for any bounded function f(\cdot) we write

{\displaystyle p(dx_k|y_0,\dots,y_k):=p(x_k|y_0,\dots,y_k)~ dx_k~\approx_{N\uparrow\infty}
\widehat{p}(dx_k|y_0,\dots,y_k)=\frac{1}{N}\sum_{1\leq i\leq N}\delta_{\widehat{\xi}^{i}_k}(dx_k)}

Particle filters can be interpreted as a genetic type particle algorithm evolving with mutation and selection transitions. We can keep track of the ancestral lines {\textstyle \left(\widehat{\xi}^{i}_{0,k},\widehat{\xi}^{i}_{1,k},...,\widehat{\xi}^{i}_{k-1,k},\widehat{\xi}^i_{k,k}\right)} of the particles {\textstyle i=1,...,N}. The random states {\textstyle \widehat{\xi}^{i}_{l,k}} , with the lower indices l=0,...,k, stands for the ancestor of the individual {\textstyle \widehat{\xi}^{i}_{k,k}=\widehat{\xi}^i_k} at level l=0,...,k. In his situation, we have the approximation formula

{\displaystyle \int F(x_0,...,x_k)p(x_0,...,x_k|y_0,\dots,y_k) \, dx_0...dx_k\approx_{N\uparrow\infty} \frac1N \sum_{i=1}^NF\left(
\widehat{\xi}_{0,k}^{i},\widehat{\xi}_{1,k}^{i},...,\widehat{\xi}_{k,k}^{i}\right)=\int F(x_0,...,x_k)\widehat{p}(d(x_0,...,x_k)|y_0,\dots,y_k)}with the empirical measure{\displaystyle \widehat{p}(d(x_0,\ldots,x_k)|y_0,\dots,y_k):=\frac{1}{N}\sum_{1\leq i\leq N}\delta_{\left(\widehat{\xi}^{i}_{0,k},\widehat{\xi}^{i}_{1,k},\ldots,\widehat{\xi}^{i}_{k,k}\right)}(d(x_0,\ldots,x_k))}





(Eq. 3)

Here F stands for any founded function on the path space of the signal. In a more synthetic form (Eq. 3) is equivalent to

{\displaystyle p(d(x_0,...,x_k)|y_0,\dots,y_k):=p(x_0,...,x_k|y_0,\dots,y_k) \, dx_0...dx_k\approx_{N\uparrow\infty} \widehat{p}(d(x_0,\ldots,x_k)|y_0,\dots,y_k):=\frac{1}{N}\sum_{1\leq i\leq N}\delta_{\left(\widehat{\xi}^{i}_{0,k},\widehat{\xi}^{i}_{1,k},\ldots,\widehat{\xi}^{i}_{k,k}\right)}(d(x_0,\ldots,x_k))}Particle filters can be interpreted in many different ways. From the probabilistic point of view they coincide with a mean field particle interpretation of the nonlinear filtering equation. The updating-prediction transitions of the optimal filter evolution can also be interpreted as the classical genetic type selection-mutation transitions of individuals. The sequential importance resampling technique provides another interpretation of the filtering transitions coupling importance sampling with the bootstrap resampling step. Last, but not least, particle filters can be seen as an acceptance-rejection methodology equipped with a recycling mechanism.[5][15]

Mean field particle simulation[edit]

The general probabilistic principle[edit]

The nonlinear filtering evolution can be interpreted as a dynamical system in the set of probability measures of the following form{\displaystyle \eta_{n+1}=\Phi_{n+1}\left(\eta_{n}\right)}where \Phi_{n+1} stands for some mapping from the set of probability distribution into itself. For instance, the evolution of the one-step optimal predictor {\textstyle \eta_n(dx_n)=p(x_n|y_0,\ldots,y_{n-1})dx_n}

satisfies a nonlinear evolution starting with the probability distribution {\textstyle \eta_0(dx_0)=p(x_0)dx_0} . One of the simplest way to approximate these probability measures is to start with {\textstyle N} independent random variables {\textstyle \left(\xi^i_0\right)_{1\leq i\leq N}} with common probability distribution {\textstyle \eta_0(dx_0)=p(x_0)dx_0} . Suppose we have defined a sequence of {\textstyle N} random variables {\textstyle \left(\xi^i_n\right)_{1\leq i\leq N}} such that {\displaystyle \frac{1}{N}\sum_{1\leq i\leq N}\delta_{\xi^i_n}(dx_n)~\approx_{N\uparrow\infty}~\eta_n(dx_n)} At the next step we sample {\textstyle N} (conditionally) independent random variables {\textstyle \xi_{n+1}:=\left(\xi^i_{n+1}\right)_{1\leq i\leq N}} with common law .

{\displaystyle \Phi_{n+1}\left(\frac{1}{N}\sum_{1\leq i\leq N}\delta_{\xi^i_n}\right)~\approx_{N\uparrow\infty}~\Phi_{n+1}\left(\eta_{n}\right)=\eta_{n+1}}

A particle interpretation of the filtering equation[edit]

We illustrate this mean field particle principle in the context of the evolution of the one step optimal predictors

\boldsymbol{p(x_{k}|y_0,\ldots,y_{k-1})~dx_k}\quad\longrightarrow\quad p(x_{k+1}|y_0,\ldots,y_k)=\int~p(x_{k+1}|x'_{k})~\displaystyle\frac{p(y_k|x_k')~\boldsymbol{p(x'_k|y_0,\dots,y_{k-1})}~dx'_k}{\displaystyle\int~p(y_k|x''_k)~\boldsymbol{p(x''_k|y_0,\ldots,y_{k-1})}~dx''_{k}}





(Eq. 4)

For k=0 we use the convention p(x_0|y_0,\dots,y_{-1}):=p(x_0).

By the law of large numbers, we have

{\displaystyle \widehat{p}(dx_0)=\frac{1}{N}\sum_{1\leq i\leq N}\delta_{\xi^{i}_0}(dx_0)\approx_{N\uparrow\infty}~p(x_0)dx_0
\quad \mbox{in the sense that}\quad
\int f(x_0)\widehat{p}(dx_0)=\frac{1}{N}\sum_{1\leq i\leq N}f(\xi^i_0)\approx_{N\uparrow\infty} \int f(x_0)p(dx_0)dx_0}for any bounded function f. We further assume that we have constructed a sequence of particles {\textstyle \left(\xi^i_k\right)_{1\leq i\leq N}} at some rank k such that

{\displaystyle \widehat{p}(dx_k|y_0,\ldots,y_{k-1}):=\frac{1}{N}\sum_{1\leq i\leq N}\delta_{\xi^{i}_k}(dx_k)\approx_{N\uparrow\infty}~p(x_k~|~y_0,\ldots,y_{k-1})dx_k}in the sense that for any bounded function f we have{\displaystyle \int f(x_k)\widehat{p}(dx_k~|~y_0,\ldots,y_{k-1})=\frac{1}{N}\sum_{1\leq i\leq N}f(\xi^i_k)\approx_{N\uparrow\infty} \int f(x_k)p(dx_k|y_0,\ldots,y_{k-1})}In this situation, replacing p(x_k~|~y_0,\ldots,y_{k-1})~dx_k by the empirical measure \widehat{p}(dx_k~|~y_0,\ldots,y_{k-1}) in the evolution equation of the one-step optimal filter stated in (Eq. 4) we find that

{\displaystyle p(x_{k+1}|y_0,\ldots,y_k)\approx_{N\uparrow\infty} \int~p(x_{k+1}|x'_{k})~\displaystyle\frac{p(y_k|x_k')~\widehat{p}(dx'_k|y_0,\dots,y_{k-1})}{\displaystyle\int~p(y_k|x''_k)~\widehat{p}(dx''_k|y_0,\ldots,y_{k-1})}}Notice that the right hand side in the above formula is a weighted probability mixture

{\displaystyle \int~p(x_{k+1}|x'_{k})~\displaystyle\frac{p(y_k|x_k')~\widehat{p}(dx'_k|y_0,\dots,y_{k-1})}{\displaystyle\int~p(y_k|x''_k)~\widehat{p}(dx''_k|y_0,\ldots,y_{k-1})}=\sum_{1\leq i\leq N}~\frac{p(y_k~|~\xi^i_k)}{\sum_{1\leq j\leq N}p(y_k~|~\xi^j_k)}~~p(x_{k+1}~|~\xi^i_k)=:\widehat{q}(x_{k+1}|y_0,\ldots,y_k)}

where p(y_k~|~\xi^i_k) stands for the density p(y_k~|~x_k) evaluated at x_k=\xi^i_k, and p(x_{k+1}~|~\xi^i_k) stands for the density p(x_{k+1}~|~x_k) evaluated at x_k=\xi^i_k, for i=1,\ldots,N.

Then, we sample {\textstyle N} independent random variable {\textstyle \left(\xi^i_{k+1}\right)_{1\leq i\leq N}} with common probability density {\textstyle \widehat{q}(x_{k+1}|y_0,\ldots,y_k)} so that

{\displaystyle \widehat{p}(dx_{k+1}|y_0,\ldots,y_{k}):=\frac{1}{N}\sum_{1\leq i\leq N}\delta_{\xi^{i}_{k+1}}(dx_{k+1})\approx_{N\uparrow\infty}~
\widehat{q}(x_{k+1}~|~y_0,\ldots,y_{k})dx_{k+1}\approx_{N\uparrow\infty}~p(x_{k+1}~|~y_0,\ldots,y_{k})dx_{k+1}}Iterating this procedure, we design a Markov chain such that

{\displaystyle \widehat{p}(dx_k|y_0,\ldots,y_{k-1}):=\frac{1}{N}\sum_{1\leq i\leq N}\delta_{\xi^{i}_k}(dx_k)\approx_{N\uparrow\infty}~p(dx_k~|~y_0,\ldots,y_{k-1}):=p(x_k~|~y_0,\ldots,y_{k-1})dx_k}

Notice that the optimal filter is approximated at each time step k using the Bayes' formulae

{\displaystyle p(dx_{k}|y_0,\ldots,y_{k})~
\approx_{N\uparrow\infty}~\displaystyle\frac{p(y_{k}|x_{k})~\widehat{p}(dx_{k}|y_0,\ldots,y_{k-1})}{\displaystyle\int p(y_{k}|x'_{k})\widehat{p}(dx'_{k}|y_0,\ldots,y_{k-1})}=\sum_{1\leq i\leq N}~\frac{p(y_k~|~\xi^i_k)}{\sum_{1\leq j\leq N}p(y_k~|~\xi^j_k)}~\delta_{\xi^i_k}(dx_k)}The terminology "mean field approximation" comes from the fact that we replace at each time step the probability measure p(dx_k~|~y_0,\ldots,y_{k-1}) by the empirical approximation \widehat{p}(dx_k~|~y_0,\ldots,y_{k-1}). The mean field particle approximation of the filtering problem is far from being unique. Several strategies are developed in the books.[5][15]

Some convergence results[edit]

The analysis of the convergence of particle filters has been started in 1996[1][14] and in 2000 in the book[3] and the series of articles.[42][43][44][45][46][58][59] More recent developments can be found in the books,[5][15] When the filtering equation is stable (in the sense that it corrects any erroneous initial condition), the bias and the variance of the particle particle estimates

{\displaystyle I_k(f):=\int f(x_k)~p(dx_k|y_0,\ldots,y_{k-1})~\approx_{N\uparrow\infty}~\widehat{I}_k(f):=\int f(x_k)~\widehat{p}(dx_k|y_0,\ldots,y_{k-1})~} are controlled by the non asymptotic uniform estimates{\displaystyle \sup_{k\geq 0}\left\vert E\left(\widehat{I}_k(f)\right)-I_k(f)\right\vert\leq {c_1}/{N}\quad\mbox{and}\quad \sup_{k\geq 0}E\left(\left[\widehat{I}_k(f)-I_k(f)\right]^2\right)\leq {c_2}/{N}}for any function f(.) bounded by 1, and for some finite constants c_1,c_2<\infty~. In addition, for any x\geq 0, the probability that{\displaystyle \left\vert \widehat{I}_k(f)-I_k(f)\right\vert\leq c_1~\frac{x}{N}+c_2~\sqrt{\frac{x}{N}}\quad\mbox{and}\quad
\sup_{0\leq k\leq n}\left\vert \widehat{I}_k(f)-I_k(f)\right\vert\leq c~\sqrt{\frac{x\log(n)}{N}}}is larger than 1-e^{-x} , for some finite constants c_1~\mbox{and}~c_2<\infty~ related to the asymptotic bias and variance of the particle estimate, and some finite constant c. The same results are satisfied if we replace the one step optimal predictor by the optimal filter approximation.

Genealogical trees and Unbiasedness properties[edit]

Genealogical tree based particle smoothing[edit]

Tracing back in time the ancestral lines {\textstyle \left(\widehat{\xi}^i_{0,k},\widehat{\xi}^i_{1,k},\ldots,\widehat{\xi}^i_{k-1,k},\widehat{\xi}^i_{k,k}\right)} and {\textstyle \left(\xi^i_{0,k},\xi^i_{1,k},\ldots,\xi^i_{k-1,k},\xi_{k,k}\right)} of the individuals {\textstyle \widehat{\xi}^i_{k}\left(=\widehat{\xi}^i_{k,k}\right)} and {\xi}^i_{k}\left(={\xi}^i_{k,k}\right) at every time step k, we also have the particle approximations

{\displaystyle \widehat{p}(d(x_0,\ldots,x_k)~|~y_0,\ldots,y_k):=\frac{1}{N}\sum_{1\leq i\leq N}\delta_{\left(\widehat{\xi}^i_{0,k},\ldots,\widehat{\xi}^i_{0,k}\right)}(d(x_0,\ldots,x_k))~~\approx_{N\uparrow\infty}~~p(d(x_0,\ldots,x_k)~|~y_0,\ldots,y_k)}and

{\displaystyle p(d(x_0,\ldots,x_k)~|~y_0,\ldots,y_k)~\approx_{N\uparrow\infty}~~
\sum_{1\leq i\leq N}~\frac{p(y_k~|~\xi^i_{k,k})}{\sum_{1\leq j\leq N}p(y_k~|~\xi^j_{k,k})}~\delta_{\left(\xi^i_{0,k},\ldots,\xi^i_{0,k}\right)}(d(x_0,\ldots,x_k))}and finally

{\displaystyle \widehat{p}(d(x_0,\ldots,x_k)~|~y_0,\ldots,y_{k-1}):=\frac{1}{N}\sum_{1\leq i\leq N}\delta_{\left(\xi^i_{0,k},\ldots,\xi^i_{k,k}\right)}(d(x_0,\ldots,x_k))~~\approx_{N\uparrow\infty}~~p(d(x_0,\ldots,x_k)~|~y_0,\ldots,y_{k-1}):=p(x_0,\ldots,x_k~|~y_0,\ldots,y_{k-1})~dx_0,\ldots,dx_k}These empirical approximations are equivalent to the particle integral approximations

{\displaystyle \int F(x_0,\ldots,x_n)~\widehat{p}(d(x_0,\ldots,x_k)~|~y_0,\ldots,y_k):=\frac{1}{N}\sum_{1\leq i\leq N}F\left(\widehat{\xi}^i_{0,k},\ldots,\widehat{\xi}^i_{0,k}\right)~~\approx_{N\uparrow\infty}~~\int~F(x_0,\ldots,x_n)~p(d(x_0,\ldots,x_k)~|~y_0,\ldots,y_k)}and

{\displaystyle \int F(x_0,\ldots,x_n)~p(d(x_0,\ldots,x_k)~|~y_0,\ldots,y_k)~\approx_{N\uparrow\infty}~~
\sum_{1\leq i\leq N}~\frac{p(y_k~|~\xi^i_{k,k})}{\sum_{1\leq j\leq N}p(y_k~|~\xi^j_{k,k})}~F\left(\xi^i_{0,k},\xi^i_{1,k},\ldots,\xi^i_{k,k}\right)}and finally

{\displaystyle \int~F(x_0,\ldots,x_n)~\widehat{p}(d(x_0,\ldots,x_k)~|~y_0,\ldots,y_{k-1}):=\frac{1}{N}\sum_{1\leq i\leq N}F\left(\xi^i_{0,k},\ldots,\xi^i_{k,k}\right)~~\approx_{N\uparrow\infty}~~\int~F(x_0,\ldots,x_n)~p(d(x_0,\ldots,x_k)~|~y_0,\ldots,y_{k-1})}

for any bounded function F on the random trajectories of the signal. As shown in[48] the evolution of the genealogical tree coincides with a mean field particle interpretation of the evolution equations associated with the posterior densities of the signal trajectories. For more details on these path space models, we refer to the books.[5][15]

Unbiased particle estimates of likelihood functions[edit]

We use the product formula{\displaystyle p(y_0,\ldots,y_n)=\prod_{0\leq k\leq n}p(y_k|y_0,\ldots,y_{k-1})\quad\mbox{with}\quad p(y_k|y_0,\ldots,y_{k-1})=\int~p(y_k|x_k)~p(dx_k|y_0,\ldots,y_{k-1})}with the conventions p(y_0|y_0,\ldots,y_{-1})=p(y_0) and p(x_0|y_0,\ldots,y_{-1})=p(x_0) , for k=0. Replacing p(x_k|y_0,\ldots,y_{k-1})dx_k by the empirical approximation

{\displaystyle \widehat{p}(dx_k~|~y_0,\ldots,y_{k-1}):=\frac{1}{N}\sum_{1\leq i\leq N}\delta_{\xi^i_k}(dx_k)~~\approx_{N\uparrow\infty}~~p(dx_k~|~y_0,\ldots,y_{k-1})}in the above displayed formula, we design the following unbiased particle approximation of the likelihood function

{\displaystyle p(y_0,\ldots,y_n)~~\approx_{N\uparrow\infty}~~\widehat{p}(y_0,\ldots,y_n)=\prod_{0\leq k\leq n}\widehat{p}(y_k|y_0,\ldots,y_{k-1})\quad\mbox{with}\quad \widehat{p}(y_k|y_0,\ldots,y_{k-1})=\int~p(y_k|x_k)~\widehat{p}(dx_k|y_0,\ldots,y_{k-1})=\frac{1}{N}\sum_{1\leq i\leq N}~p(y_k|\xi^i_k)}where p(y_k~|~\xi^i_k) stands for the density p(y_k~|~x_k) evaluated at x_k=\xi^i_k. The design of this particle estimate and the unbiasedness property has been proved in 1996 in the article.[1] Refined variance estimates can be found in[15] and.[5]

Backward particle smoothers[edit]

Using Bayes' rule, we have the formula

{\displaystyle \begin{array}{l}
= p(x_n~|~(y_0,\ldots,y_{n-1}))~p(x_{n-1}~|~x_n,(y_0,\ldots,y_{n-1}))~ \times p(x_{n-2}~|~x_{n-1},(y_0,\ldots,y_{n-2}))~~\ldots~~
\end{array}}Notice that

{\displaystyle p(x_{k-1}~|~x_{k},(y_0,\ldots,y_{k-1}))
\propto p(x_{k}~|~x_{k-1})~p(x_{k-1}~|~(y_0,\ldots,y_{k-1}))\quad\mbox{and}\quad
p(x_{k-1}~|~(y_0,\ldots,y_{k-1})\propto p(y_{k-1}|x_{k-1})~p(x_{k-1}~|~(y_0,\ldots,y_{k-2})}This implies that

{\displaystyle p(x_{k-1}~|~x_{k},(y_0,\ldots,y_{k-1}))=\frac{ p(y_{k-1}|x_{k-1})~p(x_{k}~|~x_{k-1})~p(x_{k-1}|y_0,\ldots,y_{k-2})}{\int~

Replacing the one-step optimal predictors p(x_{k-1}~|~(y_0,\ldots,y_{k-2}))dx_{k-1} by the particle empirical measures {\displaystyle \widehat{p}(dx_{k-1}~|~(y_0,\ldots,y_{k-2}))=\frac{1}{N}\sum_{1\leq i\leq N}\delta_{\xi^i_{k-1}}(dx_{k-1})~\left(\approx_{N\uparrow\infty}~{p}(dx_{k-1}~|~(y_0,\ldots,y_{k-2})):={p}(x_{k-1}~|~(y_0,\ldots,y_{k-2}))~dx_{k-1}\right)} we find that

{\displaystyle p(dx_{k-1}~|~x_{k},(y_0,\ldots,y_{k-1}))\approx_{N\uparrow\infty}~
\begin{array}[t]{rcl}\widehat{p}(dx_{k-1}~|~x_{k},(y_0,\ldots,y_{k-1}))&:=&\displaystyle\frac{ p(y_{k-1}|x_{k-1})~p(x_{k}~|~x_{k-1})~\widehat{p}(dx_{k-1}|y_0,\ldots,y_{k-2})}{\int~
&=&\displaystyle\sum_{1\leq i\leq N}\frac{p(y_{k-1}|\xi^i_{k-1})~p(x_{k}~|~\xi^i_{k-1})}{\sum_{1\leq j\leq N}p(y_{k-1}|\xi^j_{k-1})~p(x_{k}~|~\xi^j_{k-1})}~\delta_{\xi^i_{k-1}}(dx_{k-1})

We conclude that{\displaystyle p(d(x_0,\ldots,x_n)~|~(y_0,\ldots,y_{n-1}))
\widehat{p}_{backward}(d(x_0,\ldots,x_n)~|~(y_0,\ldots,y_{n-1}))}with the backward particle approximation

{\displaystyle \begin{array}{l}
= \widehat{p}(dx_n~|~(y_0,\ldots,y_{n-1}))~\widehat{p}(dx_{n-1}~|~x_n,(y_0,\ldots,y_{n-1}))~ \times \widehat{p}(dx_{n-2}~|~x_{n-1},(y_0,\ldots,y_{n-2}))~~\ldots~~

The probability measure \widehat{p}_{backward}(d(x_0,\ldots,x_n)~|~(y_0,\ldots,y_{n-1})) is the probability of the random paths of a Markov chain \left(\mathbb X^{\flat}_{k,n}\right)_{0\leq k\leq n}running backward in time from time k=n to time k=0, and evolving at each time step k in the state space associated with the population of particles \xi^i_k,~\mbox{with}~i=1,\ldots,N.

  • Initially (at time k=n) the chain \mathbb X^{\flat}_{n,n} chooses randomly a state with the distribution{\displaystyle \widehat{p}(dx_{n}~|~(y_0,\ldots,y_{n-1}))=\frac{1}{N}\sum_{1\leq i\leq N}\delta_{\xi^i_{n}}(dx_{n})}
  • From time k to the time (k-1), the chain starting at some state \mathbb X^{\flat}_{k,n}=\xi^i_k~(\mbox{for some}~i=1,\ldots,N) at time k moves at time (k-1) to a random state \mathbb X^{\flat}_{k-1,n} chosen with the discrete weighted probability{\displaystyle \widehat{p}(dx_{k-1}~|~\xi^i_{k},(y_0,\ldots,y_{k-1}))=\displaystyle\sum_{1\leq j\leq N}\frac{p(y_{k-1}|\xi^j_{k-1})~p(\xi^i_{k}~|~\xi^j_{k-1})}{\displaystyle\sum_{1\leq l\leq N}p(y_{k-1}|\xi^l_{k-1})~p(\xi^i_{k}~|~\xi^l_{k-1})}~\delta_{\xi^j_{k-1}}(dx_{k-1})}In the above displayed formula, {\textstyle \widehat{p}(dx_{k-1}~|~\xi^i_{k},(y_0,\ldots,y_{k-1}))} stands for the conditional distribution {\textstyle \widehat{p}(dx_{k-1}~|~x_k,(y_0,\ldots,y_{k-1}))} evaluated at x_k=\xi^i_{k}. In the same vein, {\textstyle p(y_{k-1}|\xi^j_{k-1})} and {\textstyle p(\xi^i_{k}~|~\xi^j_{k-1})} stand for the conditional densities {\textstyle p(y_{k-1}|x_{k-1})} and {\textstyle p(x_{k}~|~x_{k-1})} evaluated at {\textstyle x_k=\xi^i_{k}} and {\textstyle x_{k-1}=\xi^j_{k-1}.}

These models allows to reduce integration with respect to the densities p((x_0,\ldots,x_n)~|~(y_0,\ldots,y_{n-1})) in terms of matrix operations with respect to the Markov transitions of the chain described above.[49] For instance, for any function f_k(.) we have the particle estimates

{\displaystyle \begin{array}{l}
\widehat{p}(dx_n~|~(y_0,\ldots,y_{n-1}))~\widehat{p}(dx_{n-1}~|~x_n,(y_0,\ldots,y_{n-1}))~ \times \widehat{p}(dx_{n-2}~|~x_{n-1},(y_0,\ldots,y_{n-2}))~~\ldots~~
=\underbrace{\left[\frac{1}{N},\ldots,\frac{1}{N}\right]}_{\mbox{N times}}\mathbb M_{n-1}\mathbb M_{n-2}\ldots\mathbb M_{k}\left[\begin{array}{c}
\end{array}}with the (N\times N)-matrices \mathbb M_k=\left(\mathbb M_k(i,j)\right)_{1\leq i,j\leq N} with entries{\displaystyle \mathbb M_k(i,j)=\frac{p(\xi^i_{k}~|~\xi^j_{k-1})~p(y_{k-1}|\xi^j_{k-1})~}{\displaystyle\sum_{1\leq l\leq N}~p(\xi^i_{k}~|~\xi^l_{k-1})~p(y_{k-1}|\xi^l_{k-1})}}This also show that

{\displaystyle \overline{F}(x_0,\ldots,x_n):=\frac{1}{n+1}\sum_{0\leq k\leq n}f_k(x_k)\quad\Longrightarrow\quad
\displaystyle=\frac{1}{n+1}\sum_{0\leq k\leq n}
\underbrace{\left[\frac{1}{N},\ldots,\frac{1}{N}\right]}_{\mbox{N times}}\mathbb M_{n-1}\mathbb M_{n-2}\ldots\mathbb M_{k}\left[\begin{array}{c}

Some convergence results[edit]

We shall assume that filtering equation is stable, in the sense that it corrects any erroneous initial condition.

In this situation, the particle approximations of the likelihood functions are unbiased and the relative variance is controlled by

{\displaystyle E\left(\widehat{p}(y_0,\ldots,y_n)\right)=
p(y_0,\ldots,y_n)\quad\mbox{and}\quad E\left(\left[\frac{\widehat{p}(y_0,\ldots,y_n)}{p(y_0,\ldots,y_n)}-1\right]^2\right)\leq {c}~n/{N}}for some finite constant c. In addition, for any x\geq 0, the probability that{\displaystyle \left\vert \frac{1}{n}\log{\widehat{p}(y_0,\ldots,y_n)}-\frac{1}{n}\log{\widehat{p}(y_0,\ldots,y_n)}\right\vert\leq c_1~\frac{x}{N}+c_2~\sqrt{\frac{x}{N}}}is larger than 1-e^{-x} , for some finite constants c_1~\mbox{and}~c_2<\infty~ related to the asymptotic bias and variance of the particle estimate, and for some finite constant c.

The bias and the variance of the particle particle estimates based on the ancestral lines of the genealogical trees

{\displaystyle I^{path}_k(F):=\int F(x_0,\ldots,x_k)~p(d(x_0,\ldots,x_k)|y_0,\ldots,y_{k-1})~\approx_{N\uparrow\infty}~\widehat{I}^{path}_k(F):=\int F(x_0,\ldots,x_k)~\widehat{p}(d(x_0,\ldots,x_k)|y_0,\ldots,y_{k-1})~=\frac{1}{N}\sum_{1\leq i\leq N}F\left(\xi^i_{0,k},\ldots,\xi^i_{k,k}\right)} are controlled by the non asymptotic uniform estimates{\displaystyle \left\vert E\left(\widehat{I}^{path}_k(F)\right)-I_k^{path}(F)\right\vert\leq {c_1}~k/{N}\quad\mbox{and}\quad E\left(\left[\widehat{I}^{path}_k(F)-I_k^{path}(F)\right]^2\right)\leq {c_2}~k/{N}}for any function F(.) bounded by 1, and for some finite constants c_1,c_2<\infty~. In addition, for any x\geq 0, the probability that{\displaystyle \left\vert \widehat{I}^{path}_k(F)-I_k^{path}(F)\right\vert\leq c_1~\frac{k~x}{N}+c_2~\sqrt{\frac{k~x}{N}}\quad\mbox{and}\quad
\sup_{0\leq k\leq n}\left\vert \widehat{I}_k^{path}(F)-I^{path}_k(F)\right\vert\leq c~\sqrt{\frac{x~n~\log(n)}{N}}}is larger than 1-e^{-x} , for some finite constants c_1~\mbox{and}~c_2<\infty~ related to the asymptotic bias and variance of the particle estimate, and for some finite constant c. The same type of bias and variance estimates hold for the backward particle smoothers. For additive functionals of the form

{\displaystyle \overline{F}(x_0,\ldots,x_n):=\frac{1}{n+1}\sum_{0\leq k\leq n}f_k(x_k)\quad\mbox{with}\quad
~\approx_{N\uparrow\infty}~I^{\flat, path}_n(\overline{F}):=\displaystyle\int
\overline{F}(x_0,\ldots,x_n)~\widehat{p}_{backward}(d(x_0,\ldots,x_n)~|~(y_0,\ldots,y_{n-1}))}with functions f_k(.) bounded by 1, we have

{\displaystyle \sup_{n\geq 0}{\left\vert E\left(\widehat{I}^{\flat,path}_n(\overline{F})\right)-I_n^{path}(\overline{F})\right\vert}~\leq {c_1}/{N}\quad\mbox{and}\quad E\left(\left[\widehat{I}^{\flat,path}_n(F)-I_n^{path}(F)\right]^2\right)\leq {c_2}/{(nN)}+{c_3}/{N^2}}for some finite constants c_1,c_2,c_3<\infty. More refined estimates including exponentially small probability of errors are developed in.[5]

Sequential importance sampling (SIS)[edit]

The bootstrap filter[edit]

Sequential importance sampling (SIS), the original bootstrap filtering algorithm (Gordon et al. 1993), is also a very commonly used filtering algorithm, which approximates the filtering probability density p(x_k|y_0,\ldots,y_k) by a weighted set of N samples


The importance weights w^{(i)}_k are approximations to the relative posterior probabilities (or densities) of the samples such that \sum_{i=1}^N w^{(i)}_k = 1.

SIS is a sequential (i.e., recursive) version of importance sampling. As in importance sampling, the expectation of a function f(\cdot) can be approximated as a weighted average

\int f(x_k) p(x_k|y_0,\dots,y_k) dx_k \approx
\sum_{i=1}^N w_k^{(i)} f(x_k^{(i)}).

For a finite set of samples, the algorithm performance is dependent on the choice of the proposal distribution

\pi(x_k|x_{0:k-1},y_{0:k})\, .

The "optimal" proposal distribution is given as the target distribution

\pi(x_k|x_{0:k-1},y_{0:k}) = p(x_k|x_{k-1},y_{k})=\frac{p(y_k|x_k)}{\int~p(y_k|x_k)p(x_k|x_{k-1})dx_k}~p(x_k|x_{k-1}). \,

This particular choice of proposal transition has been proposed by P. Del Moral in[14] in 1996 and 1998. When it is difficult to sample transitions according to the distribution 
one natural strategy is to use the following particle approximation

\frac{p(y_k|x_k)}{\int~p(y_k|x_k)p(x_k|x_{k-1})dx_k}~p(x_k|x_{k-1})dx_k\simeq_{N\uparrow\infty} \frac{p(y_k|x_k)}{\int~p(y_k|x_k)\widehat{p}(dx_k|x_{k-1})}~\widehat{p}(dx_k|x_{k-1})=\sum_{1\leq i\leq N}\frac{p(y_k|X^i_{k}(x_{k-1}))}{\sum_{1\leq j\leq N}p(y_k|X^{j}_k(x_{k-1}))}~\delta_{X^i_k(x_{k-1})}(dx_k)

with the empirical approximation

\frac{1}{N}\sum_{i=1}^{N} \delta_{X^i_k(x_{k-1})}(dx_k)~\simeq_{N\uparrow\infty}~p(x_k|x_{k-1})dx_k

associated with 
(or any other large number of samples) independent random samples 
with the conditional distribution of the random state 
. The consistency of the resulting particle filter of this approximation and other extensions are developed in.[14] In the above display {\textstyle 
} stands for the Dirac measure at a given state a.

However, the transition prior probability distribution is often used as importance function, since it is easier to draw particles (or samples) and perform subsequent importance weight calculations:

\pi(x_k|x_{0:k-1},y_{0:k}) = p(x_k|x_{k-1}). \,

Sequential Importance Resampling (SIR) filters with transition prior probability distribution as importance function are commonly known as bootstrap filter and condensation algorithm.

Resampling is used to avoid the problem of degeneracy of the algorithm, that is, avoiding the situation that all but one of the importance weights are close to zero. The performance of the algorithm can be also affected by proper choice of resampling method. The stratified sampling proposed by Kitagawa (1996) is optimal in terms of variance.

A single step of sequential importance resampling is as follows:

1) For i=1,\ldots,N draw samples from the proposal distribution

x^{(i)}_k \sim \pi(x_k|x^{(i)}_{0:k-1},y_{0:k})
2) For i=1,\ldots,N update the importance weights up to a normalizing constant:

\hat{w}^{(i)}_k = w^{(i)}_{k-1}
\frac{p(y_k|x^{(i)}_k) p(x^{(i)}_k|x^{(i)}_{k-1})}
Note that when we use the transition prior probability distribution as the importance function,  \pi(x_k^{(i)}|x^{(i)}_{0:k-1},y_{0:k}) = p(x^{(i)}_k|x^{(i)}_{k-1}), this simplifies to the following  :
 \hat{w}^{(i)}_k = w^{(i)}_{k-1} p(y_k|x^{(i)}_k),
3) For i=1,\ldots,N compute the normalized importance weights:

w^{(i)}_k = \frac{\hat{w}^{(i)}_k}{\sum_{j=1}^N \hat{w}^{(j)}_k}
4) Compute an estimate of the effective number of particles as

\hat{N}_\mathit{eff} = \frac{1}{\sum_{i=1}^N\left(w^{(i)}_k\right)^2}

This criteria reflects the variance of the weights, other criteria can be found in the article,[16] including their rigorous analysis and central limit theorems.

5) If the effective number of particles is less than a given threshold \hat{N}_\mathit{eff} < N_{thr}, then perform resampling:
a) Draw N particles from the current particle set with probabilities proportional to their weights. Replace the current particle set with this new one.
b) For i=1,\ldots,N set w^{(N)}_k = 1/N.

The term Sampling Importance Resampling is also sometimes used when referring to SIR filters.

Sequential importance sampling (SIS)[edit]

  • Is the same as sequential importance resampling, but without the resampling stage.

"direct version" algorithm[edit]

The "direct version" algorithm[citation needed] is rather simple (compared to other particle filtering algorithms) and it uses composition and rejection. To generate a single sample x at k from p_{x_k|y_{1:k}}(x|y_{1:k}):

1) Set n=0 (This will count the number of particles generated so far)
2) Uniformly choose an index i from the range \{1,..., N\}
3) Generate a test \hat{x} from the distribution p(x_k|x_{k-1}),~\mbox{with}~x_{k-1}=x_{k-1|k-1}^{(i)}
4) Generate the probability of \hat{y} using \hat{x} from p(y_k|x_k),~\mbox{with}~x_k=\hat{x} where y_k is the measured value
5) Generate another uniform u from [0, m_k] where m_k = \sup_{x_k} p(y_k|x_k)
6) Compare u and p\left(\hat{y}\right)
6a) If u is larger then repeat from step 2
6b) If u is smaller then save \hat{x} as x_{k|k}^{(i)} and increment n
7) If n == N then quit

The goal is to generate P "particles" at k using only the particles from k-1. This requires that a Markov equation can be written (and computed) to generate a x_k based only upon x_{k-1}. This algorithm uses composition of the P particles from k-1 to generate a particle at k and repeats (steps 2–6) until P particles are generated at k.

This can be more easily visualized if x is viewed as a two-dimensional array. One dimension is k and the other dimensions is the particle number. For example, x(k,i) would be the ith particle at k and can also be written x_k^{(i)} (as done above in the algorithm). Step 3 generates a potential x_k based on a randomly chosen particle (x_{k-1}^{(i)}) at time k-1 and rejects or accepts it in step 6. In other words, the x_k values are generated using the previously generated x_{k-1}.

Other particle filters[edit]

See also[edit]


  1. ^ a b c d e f g h i j Del Moral, Pierre (1996). "Non Linear Filtering: Interacting Particle Solution." (PDF). Markov Processes and Related Fields 2 (4): 555–580. 
  2. ^ a b c Del Moral, Pierre (2004). Feynman-Kac formulae. Genealogical and interacting particle approximations. Springer. p. 575. Series: Probability and Applications 
  3. ^ a b c d e f g h Del Moral, Pierre; Miclo, Laurent (2000). Branching and Interacting Particle Systems Approximations of Feynman-Kac Formulae with Applications to Non-Linear Filtering. (PDF). Lecture Notes in Mathematics 1729. pp. 1–145. doi:10.1007/bfb0103798. 
  4. ^ a b Del Moral, Pierre; Miclo, Laurent (2000). "A Moran particle system approximation of Feynman-Kac formulae.". Stochastic Processes and their Applications 86 (2): 193–216. doi:10.1016/S0304-4149(99)00094-0. 
  5. ^ a b c d e f g h i j k l Del Moral, Pierre (2013). Mean field simulation for Monte Carlo integration. Chapman & Hall/CRC Press. p. 626. Monographs on Statistics & Applied Probability 
  6. ^ "Particle methods: An introduction with applications | ESAIM: Proc.". 
  7. ^ a b Rosenbluth, Marshall, N.; Rosenbluth, Arianna, W. (1955). "Monte-Carlo calculations of the average extension of macromolecular chains". J. Chem. Phys 23: 356–359. 
  8. ^ a b c Hetherington, Jack, H. (1984). "Observations on the statistical iteration of matrices". Phys. Rev. A. 30 (2713): 2713–2719. doi:10.1103/PhysRevA.30.2713. 
  9. ^ a b Del Moral, Pierre (2003). "Particle approximations of Lyapunov exponents connected to Schrödinger operators and Feynman-Kac semigroups" (PDF). ESAIM Probability & Statistics 7: 171–208. doi:10.1051/ps:2003001. 
  10. ^ Assaraf, Roland; Caffarel, Michel; Khelif, Anatole (2000). "Diffusion Monte Carlo Methods with a fixed number of walkers" (PDF). Phys. Rev. E 61: 4566–4575. Bibcode:2000PhRvE..61.4566A. doi:10.1103/physreve.61.4566. 
  11. ^ Caffarel, Michel; Ceperley, David; Kalos, Malvin (1993). "Comment on Feynman-Kac Path-Integral Calculation of the Ground-State Energies of Atoms". Phys. Rev. Lett. 71. Bibcode:1993PhRvL..71.2159C. doi:10.1103/physrevlett.71.2159. 
  12. ^ Ocone, D. L. (January 1, 1999). "Asymptotic stability of beneš filters". Stochastic Analysis and Applications 17 (6): 1053–1074. doi:10.1080/07362999908809648. ISSN 0736-2994. 
  13. ^ Maurel, Mireille Chaleyat; Michel, Dominique (January 1, 1984). "Des resultats de non existence de filtre de dimension finie". Stochastics 13 (1-2): 83–102. doi:10.1080/17442508408833312. ISSN 0090-9491. 
  14. ^ a b c d e f g Del Moral, Pierre (1998). "Measure Valued Processes and Interacting Particle Systems. Application to Non Linear Filtering Problems". Annals of Applied Probability (Publications du Laboratoire de Statistique et Probabilités, 96-15 (1996) ed.) 8 (2): 438–495. doi:10.1214/aoap/1028903535. 
  15. ^ a b c d e f g h i j k l m Del Moral, Pierre (2004). Feynman-Kac formulae. Genealogical and interacting particle approximations. Springer. Series: Probability and Applications. p. 556. ISBN 978-0-387-20268-6. 
  16. ^ a b c Del Moral, Pierre; Doucet, Arnaud; Jasra, Ajay (2012). "On Adaptive Resampling Procedures for Sequential Monte Carlo Methods" (PDF). Bernoulli 18 (1): 252–278. doi:10.3150/10-bej335. 
  17. ^ Turing, Alan M. "Computing machinery and intelligence". Mind LIX (238): 433–460. doi:10.1093/mind/LIX.236.433. 
  18. ^ Barricelli, Nils Aall (1954). "Esempi numerici di processi di evoluzione". Methodos: 45–68. 
  19. ^ Barricelli, Nils Aall (1957). "Symbiogenetic evolution processes realized by artificial methods". Methodos: 143–182. 
  20. ^ "Poor Man's Monte Carlo on JSTOR". Retrieved 2015-06-07. 
  21. ^ Barricelli, Nils Aall (1963). "Numerical testing of evolution theories. Part II. Preliminary tests of performance, symbiogenesis and terrestrial life". Acta Biotheoretica (16): 99–126. 
  22. ^ "Adaptation in Natural and Artificial Systems | The MIT Press". Retrieved 2015-06-06. 
  23. ^ Fraser, Alex (1957). "Simulation of genetic systems by automatic digital computers. I. Introduction". Aust. J. Biol. Sci. 10: 484–491. 
  24. ^ Fraser, Alex; Burnell, Donald (1970). Computer Models in Genetics. New York: McGraw-Hill. ISBN 0-07-021904-4. 
  25. ^ Crosby, Jack L. (1973). Computer Simulation in Genetics. London: John Wiley & Sons. ISBN 0-471-18880-8. 
  26. ^ Assaraf, Roland; Caffarel, Michel; Khelif, Anatole (2000). "Diffusion Monte Carlo Methods with a fixed number of walkers" (PDF). Phys. Rev. E 61: 4566–4575. doi:10.1103/physreve.61.4566. 
  27. ^ Caffarel, Michel; Ceperley, David; Kalos, Malvin (1993). "Comment on Feynman-Kac Path-Integral Calculation of the Ground-State Energies of Atoms". Phys. Rev. Lett. 71. doi:10.1103/physrevlett.71.2159. 
  28. ^ Fermi, Enrique; Richtmyer, Robert, D. (1948). "Note on census-taking in Monte Carlo calculations" (PDF). LAM 805 (A). Declassified report Los Alamos Archive 
  29. ^ Herman, Kahn; Harris, Theodore, E. (1951). "Estimation of particle transmission by random sampling" (PDF). Natl. Bur. Stand. Appl. Math. Ser. 12: 27–30. 
  30. ^ Gordon, N.J.; Salmond, D.J.; Smith, A.F.M. (April 1993). "Novel approach to nonlinear/non-Gaussian Bayesian state estimation". Radar and Signal Processing, IEE Proceedings F 140 (2): 107–113. ISSN 0956-375X. 
  31. ^ Kitagawa, G. (1996). "Monte carlo filter and smoother for non-Gaussian nonlinear state space models". Journal of Computational and Graphical Statistics 5 (1): 1–25. doi:10.2307/1390750. JSTOR 1390750. 
  32. ^ Carvalho, Himilcon; Del Moral, Pierre; Monin, André; Salut, Gérard (July 1997). "Optimal Non-linear Filtering in GPS/INS Integration." (PDF). IEEE-Trans. on Aerospace and electronic systems 33 (3). 
  33. ^ P. Del Moral, G. Rigal, and G. Salut. Estimation and nonlinear optimal control : An unified framework for particle solutions
    LAAS-CNRS, Toulouse, Research Report no. 91137, DRET-DIGILOG- LAAS/CNRS contract, April (1991).
  34. ^ P. Del Moral, G. Rigal, and G. Salut. Nonlinear and non Gaussian particle filters applied to inertial platform repositioning.
    LAAS-CNRS, Toulouse, Research Report no. 92207, STCAN/DIGILOG-LAAS/CNRS Convention STCAN no. A.91.77.013, (94p.) September (1991).
  35. ^ P. Del Moral, G. Rigal, and G. Salut. Estimation and nonlinear optimal control : Particle resolution in filtering and estimation. Experimental results.
    Convention DRET no. 89.34.553.00.470.75.01, Research report no.2 (54p.), January (1992).
  36. ^ P. Del Moral, G. Rigal, and G. Salut. Estimation and nonlinear optimal control : Particle resolution in filtering and estimation. Theoretical results
    Convention DRET no. 89.34.553.00.470.75.01, Research report no.3 (123p.), October (1992).
  37. ^ P. Del Moral, J.-Ch. Noyer, G. Rigal, and G. Salut. Particle filters in radar signal processing : detection, estimation and air targets recognition.
    LAAS-CNRS, Toulouse, Research report no. 92495, December (1992).
  38. ^ P. Del Moral, G. Rigal, and G. Salut. Estimation and nonlinear optimal control : Particle resolution in filtering and estimation.
    Studies on: Filtering, optimal control, and maximum likelihood estimation. Convention DRET no. 89.34.553.00.470.75.01. Research report no.4 (210p.), January (1993).
  39. ^ a b Crisan, Dan; Gaines, Jessica; Lyons, Terry (1998). "Convergence of a branching particle method to the solution of the Zakai". SIAM Journal on Applied Mathematics 58 (5): 1568–1590. doi:10.1137/s0036139996307371. 
  40. ^ Crisan, Dan; Lyons, Terry (1997). "Nonlinear filtering and measure-valued processes". Probability Theory and Related Fields 109 (2): 217–244. doi:10.1007/s004400050131. 
  41. ^ Crisan, Dan; Lyons, Terry (1999). "A particle approximation of the solution of the Kushner–Stratonovitch equation". Probability Theory and Related Fields 115 (4): 549–578. doi:10.1007/s004400050249. 
  42. ^ a b c Crisan, Dan; Del Moral, Pierre; Lyons, Terry (1999). "Discrete filtering using branching and interacting particle systems" (PDF). Markov Processes and Related Fields 5 (3): 293–318. 
  43. ^ a b c d Del Moral, Pierre; Guionnet, Alice (1999). "On the stability of Measure Valued Processes with Applications to filtering". C.R. Acad. Sci. Paris 39 (1): 429–434. 
  44. ^ a b c d Del Moral, Pierre; Guionnet, Alice (2001). "On the stability of interacting processes with applications to filtering and genetic algorithms". Annales de l'Institut Henri Poincaré, 37 (2): 155–194. doi:10.1016/s0246-0203(00)01064-5. 
  45. ^ a b Del Moral, P.; Guionnet, A. (1999). "Central limit theorem for nonlinear filtering and interacting particle systems". The Annals of Applied Probability 9 (2): 275–297. doi:10.1214/aoap/1029962742. ISSN 1050-5164. 
  46. ^ a b Del Moral, Pierre; Miclo, Laurent (2001). "Genealogies and Increasing Propagation of Chaos For Feynman-Kac and Genetic Models". The Annals of Applied Probability 11 (4): 1166–1198. doi:10.1214/aoap/1015345399. ISSN 1050-5164. 
  47. ^ a b Doucet, A.; De Freitas, N. and Murphy, K. and Russell, S. (2000). Rao–Blackwellised particle filtering for dynamic Bayesian networks. Proceedings of the Sixteenth conference on Uncertainty in artificial intelligence. pp. 176–183. CiteSeerX: 
  48. ^ a b Del Moral, Pierre; Miclo, Laurent (2001). "Genealogies and Increasing Propagations of Chaos for Feynman-Kac and Genetic Models". Annals of Applied Probability 11 (4): 1166–1198. 
  49. ^ a b Del Moral, Pierre; Doucet, Arnaud; Singh, Sumeetpal, S. (2010). "A Backward Particle Interpretation of Feynman-Kac Formulae" (PDF). M2AN 44 (5): 947–976. doi:10.1051/m2an/2010048. 
  50. ^ Vergé, Christelle; Dubarry, Cyrille; Del Moral, Pierre; Moulines, Eric (2013). "On parallel implementation of Sequential Monte Carlo methods: the island particle model". Statistics and Computing 25: 243–260. doi:10.1007/s11222-013-9429-x. 
  51. ^ Chopin, Nicolas; Jacob, Pierre, E.; Papaspiliopoulos, Omiros. "SMC^2: an efficient algorithm for sequential analysis of state-space models" (PDF). arXiv:1101.1528v3. 
  52. ^ Andrieu, Christophe; Doucet, Arnaud; Holenstein, Roman (2010). "Particle Markov chain Monte Carlo methods". Journal Royal Statistical Society B 72 (3): 269–342. doi:10.1111/j.1467-9868.2009.00736.x. 
  53. ^ Del Moral, Pierre; Patras, Frédéric; Kohn, Robert (2014). "On Feynman-Kac and particle Markov chain Monte Carlo models" (PDF). arXiv preprint arXiv:1404.5733. 
  54. ^ Singer, R.A. (July 1970). "Estimating Optimal Tracking Filter Performance for Manned Maneuvering Targets". IEEE Transactions on Aerospace and Electronic Systems. AES-6 (4): 473–483. doi:10.1109/TAES.1970.310128. ISSN 0018-9251. 
  55. ^ Del Moral, Pierre; Jacod, Jean; Protter, Philip (2001-07-01). "The Monte-Carlo method for filtering with discrete-time observations". Probability Theory and Related Fields 120 (3): 346–368. doi:10.1007/PL00008786. ISSN 0178-8051. 
  56. ^ Del Moral, Pierre; Doucet, Arnaud; Jasra, Ajay (2011). "An adaptive sequential Monte Carlo method for approximate Bayesian computation". Statistics and Computing 22 (5): 1009–1020. doi:10.1007/s11222-011-9271-y. ISSN 0960-3174. 
  57. ^ Martin, James S.; Jasra, Ajay; Singh, Sumeetpal S.; Whiteley, Nick; Del Moral, Pierre; McCoy, Emma (May 4, 2014). "Approximate Bayesian Computation for Smoothing". Stochastic Analysis and Applications 32 (3): 397–420. doi:10.1080/07362994.2013.879262. ISSN 0736-2994. 
  58. ^ Del Moral, Pierre; Rio, Emmanuel (2011). "Concentration inequalities for mean field particle models". The Annals of Applied Probability 21 (3): 1017–1052. doi:10.1214/10-AAP716. ISSN 1050-5164. 
  59. ^ Del Moral, Pierre; Hu, Peng; Wu, Liming (2012). On the Concentration Properties of Interacting Particle Processes. Hanover, MA, USA: Now Publishers Inc. ISBN 1601985126. 
  60. ^ Pitt, M.K.; Shephard, N. (1999). "Filtering Via Simulation: Auxiliary Particle Filters". Journal of the American Statistical Association (American Statistical Association) 94 (446): 590–591. doi:10.2307/2670179. JSTOR 2670179. Retrieved 2008-05-06. 
  61. ^ Liu, J.; Wang, W.; Ma, F. (2011). "A Regularized Auxiliary Particle Filtering Approach for System State Estimation and Battery Life Prediction". Smart Materials and Structures 20 (7): 1–9. doi:10.1088/0964-1726/20/7/075021. 
  62. ^ Canton-Ferrer, C.; Casas, J.R.; Pardàs, M. (2011). "Human Motion Capture Using Scalable Body Models". Computer Vision and Image Understanding (Elsevier) 115 (10): 1363–1374. doi:10.1016/j.cviu.2011.06.001. 
  63. ^ Blanco, J.L.; Gonzalez, J.; Fernandez-Madrigal, J.A. (2008). An Optimal Filtering Algorithm for Non-Parametric Observation Models in Robot Localization. IEEE International Conference on Robotics and Automation (ICRA'08). pp. 461–466. CiteSeerX: 
  64. ^ Blanco, J.L.; Gonzalez, J.; Fernandez-Madrigal, J.A. (2010). "Optimal Filtering for Non-Parametric Observation Models: Applications to Localization and SLAM" (PDF). The International Journal of Robotics Research (IJRR) 29 (14): 1726–1742. doi:10.1177/0278364910364165. 


  • Liu, J.S. (2001). Monte Carlo strategies in Scientific Computing. Springer. 
  • Ristic, B.; Arulampalam, S.; Gordon, N. (2004). Beyond the Kalman Filter: Particle Filters for Tracking Applications. Artech House. 
  • Cappe, O.; Godsill, S.; Moulines, E. (2007). "An overview of existing methods and recent advances in sequential Monte Carlo". Proceedings of IEEE 95 (5): 899–924. doi:10.1109/JPROC.2007.893250. 
  • Kitagawa, G. (1996). "Monte carlo filter and smoother for non-Gaussian nonlinear state space models". Journal of Computational and Graphical Statistics 5 (1): 1–25. doi:10.2307/1390750. JSTOR 1390750. 
  • Kotecha, J.H.; Djuric, P. (2003). "Gaussian Particle filtering". IEEE Transactions Signal Processing 51 (10). 
  • Chen, Z. (2003). "Bayesian Filtering: From Kalman Filters to Particle Filters, and Beyond". CiteSeerX: 
  • Vaswani, N.; Rathi, Y. Yezzi, A., Tannenbaum, A. (2007). "Tracking deforming objects using particle filtering for geometric active contours". IEEE Trans. on Pattern Analysis and Machine Intelligence 29 (8): 1470–1475. doi:10.1109/tpami.2007.1081. 

External links[edit]