Math 2.0

Statistics Definition

Particle filter

Builds on Hidden Markov modelBayes' theoremConditional probabilityMarkov chain

Definition

Consider a state-space model: a Markov chain (Xt)t≥0(X_t)_{t \ge 0} with initial density μ\mu and transition density f(xt∣xt−1)f(x_t \mid x_{t-1}). The observations YtY_t are conditionally independent given the states, with density g(yt∣xt)g(y_t \mid x_t). Fix a number N≥1N \ge 1 of particles and observed values y1,y2,…y_1, y_2, \dots. The bootstrap particle filter (sequential importance resampling) runs as follows.

  1. Draw x0(1),…,x0(N)x_0^{(1)}, \dots, x_0^{(N)} independently from μ\mu.
  2. At time t≥1t \ge 1, draw x~t(i)\tilde x_t^{(i)} from f(⋅∣xt−1(i))f(\cdot \mid x_{t-1}^{(i)}) for each ii.
  3. Compute the weights wt(i)=g(yt∣x~t(i))/∑k=1Ng(yt∣x~t(k))w_t^{(i)} = g(y_t \mid \tilde x_t^{(i)}) / \sum_{k=1}^{N} g(y_t \mid \tilde x_t^{(k)}).
  4. Draw xt(1),…,xt(N)x_t^{(1)}, \dots, x_t^{(N)} from the weighted points, choosing x~t(i)\tilde x_t^{(i)} with probability wt(i)w_t^{(i)}.

The filtering distribution of XtX_t given y1,…,yty_1, \dots, y_t is approximated by the weighted empirical measure ∑i=1Nwt(i)δx~t(i)\sum_{i=1}^{N} w_t^{(i)} \delta_{\tilde x_t^{(i)}}.

Remarks

Steps 2 and 3 are a Monte Carlo version of the prediction step and of the update by Bayes' theorem in the exact filtering recursion. General particle filters draw x~t(i)\tilde x_t^{(i)} from another proposal density qq and multiply the weight by f/qf / q. As N→∞N \to \infty, integrals against the particle approximation converge to the exact filtering integrals under mild conditions.

Example: let Xt=Xt−1+UtX_t = X_{t-1} + U_t and Yt=Xt+VtY_t = X_t + V_t with independent standard normal Ut,VtU_t, V_t. Then g(y∣x)g(y \mid x) is proportional to e−(y−x)2/2e^{-(y - x)^2 / 2}, so particles close to yty_t get the largest weights in step 3. For this linear Gaussian model the exact filter is the Kalman filter, and the particle filter approximates it.

Non-example: if step 4 is left out, the method is sequential importance sampling. Then after a few steps almost all the weight sits on one particle, which is why the resampling step is part of the definition.

Reading path

To understand this page from the ground up, read these 43 pages in order. The foundations come first.

  1. Conditional probability concept
  2. Construction of the reals from Cauchy sequences concept
  3. Element definition
  4. Hidden Markov model concept
  5. Integers object
  6. Markov chain concept
  7. Ordered field definition
  8. Proposition concept
  9. Random experiment concept
  10. Rational numbers object
  11. Set definition
  12. Ring of integers statement
  13. Conjunction definition
  14. Disjunction definition
  15. Implication definition
  16. Predicate definition
  17. Empty set object
  18. Family of sets definition
  19. Intersection definition
  20. Union definition
  21. Sample space definition
  22. Existential quantifier definition
  23. The rationals form a field statement
  24. Universal quantifier definition
  25. Disjoint sets definition
  26. Union of a family of sets definition
  27. Subset definition
  28. The rationals form an ordered field statement
  29. Partition of a set definition
  30. Universal set definition
  31. Order on the reals definition
  32. Power set definition
  33. Complement definition
  34. Interval definition
  35. Sigma-algebra definition
  36. Event definition
  37. Probability axioms concept
  38. Probability measure definition
  39. Probability space definition
  40. Conditional probability definition
  41. Law of total probability statement
  42. Bayes' theorem statement
  43. Particle filter definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Particle_filter
About this page
TagW8R4A5D4N8
URIm2://W8R4A5D4N8
Kinddefinition
WritingW0 stub
MSC62M20, 65C35, 60G35
DefinesParticle filter
UsesHidden Markov model, Bayes' theorem, Conditional probability, Markov chain

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.