Cover image.

research

Path Storage in the Particle Filter

P.E. Jacob, L.M. Murray and S. Rubenthaler

DOI Online

This article considers the problem of storing the paths generated by a particle filter and more generally by a sequential Monte Carlo algorithm. It provides a theoretical result bounding the expected memory cost by T+CNlogNT+CN\log N where TT is the time horizon, NN is the number of particles and CC is a constant, as well as an efficient algorithm to realise this. The theoretical result and the algorithm are illustrated with numerical experiments.

P.E. Jacob, L.M. Murray and S. Rubenthaler (2015). Path Storage in the Particle Filter. Statistics and Computing. 25(2):487--496.

P.E. Jacob, L.M. Murray and S. Rubenthaler (2015). <a href="https://indii.org/research/path-storage-in-the-particle-filter/">Path Storage in the Particle Filter</a>. <em>Statistics and Computing</em>. <strong>25</strong>(2):487--496.

@Article{Jacob2015,
  title = {Path storage in the particle filter},
  author = {Pierre E. Jacob and Lawrence M. Murray and Sylvain Rubenthaler},
  journal = {Statistics and Computing},
  year = {2015},
  volume = {25},
  number = {2},
  pages = {487--496},
  doi = {10.1007/s11222-013-9445-x}
}
blog Latest
GPU Programming in the Cloud
How to develop on remote cloud instances, and a roundup of cloud service providers.

Lawrence Murray

22 Nov 22

GPU Programming in the Cloud
research Related
Probabilistic learning of nonlinear dynamical systems using sequential Monte Carlo

T.B. Schön, A. Svensson, L.M. Murray, and F. Lindsten

photography Next
El Tunco
photography Previous
Stradbroke Island