Sequential quasi Monte Carlo

We derive and study sequential quasi Monte Carlo (SQMC), 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 and his colleagues. The complexity of SQMC is O{Nlog(N)}, where N is the number of simulations at each iteration, and its error rate is smaller than the Monte Carlo rate OP(N−1/2). The only requirement to implement SQMC algorithms is the ability to write the simulation of particle xtn given xt−1n as a deterministic function of xt−1n 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 and unbiased likelihood evaluation. In particular, SQMC may replace SMC within a particle Markov chain Monte Carlo algorithm. We establish several convergence results. We provide numerical evidence that SQMC may significantly outperform SMC in practical scenarios.