Sequential Quasi-Monte Carlo
Authors:
Preprint
Abstract
We derive and study SQMC (Sequential Quasi-Monte Carlo), a class of algorithms obtained by introducing QMC point sets in particle filtering. SQMC is related to, and may be seen as an extension of, the array-RQMC algorithm of L'Ecuyer et al. (2006). The complexity of SQMC is $O(N \log N)$, where $N$ is the number of simulations at each iteration, and its error rate is smaller than the Monte Carlo rate $O_P(N^{-1/2})$. The only requirement to implement SQMC is the ability to write the simulation of particle $x_t^n$ given $x_{t-1}^n$ as a deterministic function of $x_{t-1}^n$ and a fixed number of uniform variates. We show that SQMC is amenable to the same extensions as standard SMC, such as forward smoothing, backward smoothing, unbiased likelihood evaluation, and so on. In particular, SQMC may replace SMC within a PMCMC (particle Markov chain Monte Carlo) algorithm. We establish several convergence results. We provide numerical evidence that SQMC may significantly outperform SMC in practical scenarios.
Keywords
All Related Versions
This publication has 26 references indexed in Scilit:
- On integration methods based on scrambled nets of arbitrary sizeJournal of Complexity, 2015
- Particle approximations of the score and observed information matrix in state space models with application to parameter estimationBiometrika, 2011
- Smoothing algorithms for state–space modelsAnnals of the Institute of Statistical Mathematics, 2009
- A note on auxiliary particle filtersStatistics & Probability Letters, 2008
- Multivariate Stochastic Volatility Models with Correlated ErrorsEconometric Reviews, 2006
- A sequential particle filter method for static modelsBiometrika, 2002
- Annealed importance samplingStatistics and Computing, 2001
- Scrambling Sobol' and Niederreiter–Xing PointsJournal of Complexity, 1998
- Über eine Transformation von gleichverteilten Folgen IIComputing, 1972
- Convergence with Hilbert's space filling curveJournal of Computer and System Sciences, 1969