Abstract
We develop a new class of algorithms, SQMC (Sequential Quasi-Monte Carlo), as a variant of SMC (Sequential Monte Carlo) based on low-discrepancy point sets. 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(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. These convergence results also apply, as a corollary, to the array-RQMC algorithm of L'Ecuyer et al. (2006). We provide numerical evidence that SQMC may significantly outperform SMC in terms of approximation error in practical scenarios.

This publication has 19 references indexed in Scilit: