On resampling schemes for particle filters with weakly informative observations
Chopin, N., Singh, S. S., Soto, T., & Vihola, M. (2022). On resampling schemes for particle filters with weakly informative observations. Annals of Statistics, 50(6), 3197-3222. https://doi.org/10.1214/22-aos2222
Julkaistu sarjassa
Annals of StatisticsPäivämäärä
2022Tekijänoikeudet
© 2022 Institute of Mathematical Statistics
We consider particle filters with weakly informative observations (or ‘potentials’) relative to the latent state dynamics. The particular focus of this work is on particle filters to approximate time-discretisations of continuous-time Feynman–Kac path integral models—a scenario that naturally arises when addressing filtering and smoothing problems in continuous time—but our findings are indicative about weakly informative settings beyond this context too. We study the performance of different resampling schemes, such as systematic resampling, SSP (Srinivasan sampling process) and stratified resampling, as the time-discretisation becomes finer and also identify their continuous-time limit, which is expressed as a suitably defined ‘infinitesimal generator.’ By contrasting these generators, we find that (certain modifications of) systematic and SSP resampling ‘dominate’ stratified and independent ‘killing’ resampling in terms of their limiting overall resampling rate. The reduced intensity of resampling manifests itself in lower variance in our numerical experiment. This efficiency result, through an ordering of the resampling rate, is new to the literature. The second major contribution of this work concerns the analysis of the limiting behaviour of the entire population of particles of the particle filter as the time discretisation becomes finer. We provide the first proof, under general conditions, that the particle approximation of the discretised continuous-time Feynman–Kac path integral models converges to a (uniformly weighted) continuous-time particle system.
...
Julkaisija
Institute of Mathematical StatisticsISSN Hae Julkaisufoorumista
0090-5364Asiasanat
Julkaisu tutkimustietojärjestelmässä
https://converis.jyu.fi/converis/portal/detail/Publication/164639007
Metadata
Näytä kaikki kuvailutiedotKokoelmat
Rahoittaja(t)
Suomen AkatemiaRahoitusohjelmat(t)
Akatemiahanke, SALisätietoja rahoituksesta
TS and MV were supported by Academy of Finland grant 315619 and the Finnish Centre of Excellence in Randomness and Structures.Lisenssi
Samankaltainen aineisto
Näytetään aineistoja, joilla on samankaltainen nimeke tai asiasanat.
-
Statistical analysis of life sequence data
Helske, Satu (University of Jyväskylä, 2016) -
Coupled conditional backward sampling particle filter
Lee, Anthony; Singh, Sumeetpal S.; Vihola, Matti (Institute of Mathematical Statistics, 2020)The conditional particle filter (CPF) is a promising algorithm for general hidden Markov model smoothing. Empirical evidence suggests that the variant of CPF with backward sampling (CBPF) performs well even with long time ... -
Unbiased Inference for Discretely Observed Hidden Markov Model Diffusions
Chada, Neil K.; Franks, Jordan; Jasra, Ajay; Law, Kody J.; Vihola, Matti (Society for Industrial & Applied Mathematics (SIAM), 2021)We develop a Bayesian inference method for diffusions observed discretely and with noise, which is free of discretization bias. Unlike existing unbiased inference methods, our method does not rely on exact simulation ... -
Conditional particle filters with diffuse initial distributions
Karppinen, Santeri; Vihola, Matti (Springer, 2021)Conditional particle filters (CPFs) are powerful smoothing algorithms for general nonlinear/non-Gaussian hidden Markov models. However, CPFs can be inefficient or difficult to apply with diffuse initial distributions, which ... -
Conditional particle filters with bridge backward sampling
Karppinen, Santeri; Singh, Sumeetpal S.; Vihola, Matti (Taylor & Francis, 2024)Conditional particle filters (CPFs) with backward/ancestor sampling are powerful methods for sampling from the posterior distribution of the latent states of a dynamic model such as a hidden Markov model. However, the ...
Ellei toisin mainittu, julkisesti saatavilla olevia JYX-metatietoja (poislukien tiivistelmät) saa vapaasti uudelleenkäyttää CC0-lisenssillä.