Abstract
We propose a new algorithm for approximating the non-asymptotic second moment of the marginal likelihood estimate, or normalizing constant, provided by a particle filter. The computational cost of the new method is O(M) per time step, independently of the number of particles N in the particle filter, where M is a parameter controlling the quality of the approximation. This is in contrast to O(M N) for a simple averaging technique using M i.i.d. replicates of a particle filter with N particles. We establish that the approximation delivered by the new algorithm is unbiased, strongly consistent and, under standard regularity conditions, increasing M linearly with time is sufficient to prevent growth of the relative variance of the approximation, whereas for the simple averaging technique it can be necessary to increase M exponentially with time in order to achieve the same effect. This makes the new algorithm useful as part of strategies for estimating Monte Carlo variance. Numerical examples illustrate performance in the context of a stochastic Lotka–Volterra system and a simple AR(1) model.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Andrieu C, Doucet A, Holenstein R (2010) Particle Markov chain Monte Carlo methods. J R Stat Soc Ser B 72(3):269–342
Bhadra A, Ionides EL (2014) Adaptive particle allocation in iterated sequential Monte Carlo via approximating meta-models. Stat Comput 1–15
Cérou F, Del Moral P, Guyader A (2011) A nonasymptotic theorem for unnormalized Feynman-Kac particle models. Annales de L’Institut Henri Poincare Section Physique Theorique 47:629–649. doi:10.1214/10-AIHP358
Chan HP, Lai TL (2013) A general theory of particle filters in hidden Markov models and some applications. Ann Stat 41(6):2877–2904
Del Moral P (2004) Feynman-Kac Formulae. Genealogical and Interacting Particle Systems with Applications. Probability and its Applications. Springer Verlag, New York
Doucet A, de Freitas N, Gordon N (2001) Sequential Monte Carlo Methods in Practice (Information Science and Statistics). Springer-Verlag New York, Inc.
Golightly A, Wilkinson DJ (2011) Bayesian parameter inference for stochastic biochemical network models using particle Markov chain Monte Carlo. Interface Focus 1(6):807–820
Golightly A, Henderson DA, Sherlock C (2015) Delayed acceptance particle MCMC for exact inference in stochastic kinetic models. Stat Comput 25(5):1039–1055
Lee A, Whiteley N (2015) Variance estimation and allocation in the particle filter. arXiv:150900394
Whiteley N (2013) Stability properties of some particle filters. Ann Appl Probab 23(6):2500–2537
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Kostov, S., Whiteley, N. An Algorithm for Approximating the Second Moment of the Normalizing Constant Estimate from a Particle Filter. Methodol Comput Appl Probab 19, 799–818 (2017). https://doi.org/10.1007/s11009-016-9513-8
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11009-016-9513-8