## Bernoulli

• Bernoulli
• Volume 23, Number 4B (2017), 2951-2987.

### Convergence of sequential quasi-Monte Carlo smoothing algorithms

#### Abstract

Gerber and Chopin [J. R. Stat. Soc. Ser. B. Stat. Methodol. 77 (2015) 509–579] recently introduced Sequential quasi-Monte Carlo (SQMC) algorithms as an efficient way to perform filtering in state–space models. The basic idea is to replace random variables with low-discrepancy point sets, so as to obtain faster convergence than with standard particle filtering. Gerber and Chopin (2015) describe briefly several ways to extend SQMC to smoothing, but do not provide supporting theory for this extension. We discuss more thoroughly how smoothing may be performed within SQMC, and derive convergence results for the so-obtained smoothing algorithms. We consider in particular SQMC equivalents of forward smoothing and forward filtering backward sampling, which are the most well-known smoothing techniques. As a preliminary step, we provide a generalization of the classical result of Hlawka and Mück [Computing (Arch. Elektron. Rechnen) 9 (1972) 127–138] on the transformation of QMC point sets into low discrepancy point sets with respect to non uniform distributions. As a corollary of the latter, we note that we can slightly weaken the assumptions to prove the consistency of SQMC.

#### Article information

Source
Bernoulli, Volume 23, Number 4B (2017), 2951-2987.

Dates
Revised: February 2016
First available in Project Euclid: 23 May 2017

https://projecteuclid.org/euclid.bj/1495505081

Digital Object Identifier
doi:10.3150/16-BEJ834

Mathematical Reviews number (MathSciNet)
MR3654796

Zentralblatt MATH identifier
1382.65010

#### Citation

Gerber, Mathieu; Chopin, Nicolas. Convergence of sequential quasi-Monte Carlo smoothing algorithms. Bernoulli 23 (2017), no. 4B, 2951--2987. doi:10.3150/16-BEJ834. https://projecteuclid.org/euclid.bj/1495505081

#### References

• [1] Aistleitner, C. and Dick, J. (2014). Low-discrepancy point sets for non-uniform measures. Acta Arith. 163 345–369.
• [2] Aistleitner, C. and Dick, J. (2015). Functions of bounded variation, signed measures, and a general Koksma–Hlawka inequality. Acta Arith. 167 143–171.
• [3] Andrieu, C., Doucet, A. and Holenstein, R. (2010). Particle Markov chain Monte Carlo methods. J. R. Stat. Soc. Ser. B. Stat. Methodol. 72 269–342.
• [4] Briers, M., Doucet, A. and Maskell, S. (2010). Smoothing algorithms for state–space models. Ann. Inst. Statist. Math. 62 61–89.
• [5] Briers, M., Doucet, A. and Singh, S.S. (2005). Sequential auxiliary particle belief propagation. In Proc. 8th International Conference on Information Fusion 1. IEEE. DOI:10.1109/icif.2005.1591923.
• [6] Cappé, O., Moulines, E. and Rydén, T. (2005). Inference in Hidden Markov Models. Springer Series in Statistics. New York: Springer.
• [7] Carpenter, J., Clifford, P. and Fearnhead, P. (1999). Improved particle filter for nonlinear problems. IEE Proc. Radar, Sonar Navigation 146 2–7.
• [8] Chan, D., Kohn, R. and Kirby, C. (2006). Multivariate stochastic volatility models with correlated errors. Econometric Rev. 25 245–274.
• [9] Del Moral, P. (2004). Feynman–Kac Formulae: Genealogical and Interacting Particle Systems with Applications. Probability and Its Applications (New York). New York: Springer.
• [10] Del Moral, P., Doucet, A. and Singh, S.S. (2010). A backward particle interpretation of Feynman–Kac formulae. ESAIM Math. Model. Numer. Anal. 44 947–975.
• [11] Dick, J. and Pillichshammer, F. (2010). Digital Nets and Sequences: Discrepancy Theory and Quasi-Monte Carlo Integration. Cambridge: Cambridge Univ. Press.
• [12] Douc, R., Garivier, A., Moulines, E. and Olsson, J. (2011). Sequential Monte Carlo smoothing for general state space hidden Markov models. Ann. Appl. Probab. 21 2109–2145.
• [13] Doucet, A., de Freitas, N. and Gordon, N.J., eds. (2001). Sequential Monte Carlo Methods in Practice. Statistics for Engineering and Information Science. New York: Springer.
• [14] Doucet, A., Godsill, S. and Andrieu, C. (2000). On sequential Monte Carlo sampling methods for Bayesian filtering. Stat. Comput. 10 197–208.
• [15] El Haddad, R., Lécot, C. and L’Ecuyer, P. (2008). Quasi-Monte Carlo simulation of discrete-time Markov chains on multidimensional state spaces. In Monte Carlo and Quasi-Monte Carlo Methods 2006 413–429. Berlin: Springer.
• [16] Fearnhead, P., Wyncoll, D. and Tawn, J. (2010). A sequential smoothing algorithm with linear computational cost. Biometrika 97 447–464.
• [17] Gerber, M. and Chopin, N. (2015). Sequential quasi Monte Carlo. J. R. Stat. Soc. Ser. B. Stat. Methodol. 77 509–579.
• [18] Godsill, S.J., Doucet, A. and West, M. (2004). Monte Carlo smoothing for nonlinear times series. J. Amer. Statist. Assoc. 99 156–168.
• [19] Gordon, N.J., Salmond, D.J. and Smith, A.F.M. (1993). Novel approach to nonlinear/non-Gaussian Bayesian state estimation. IEE Proc. F, Comm., Radar, Signal Proc. 140 107–113.
• [20] Hamilton, C.H. and Rau-Chaplin, A. (2008). Compact Hilbert indices for multi-dimensional data. In Proceedings of the First International Conference on Complex, Intelligent and Software Intensive Systems. IEEE. DOI:10.1109/CISIS.2007.16.
• [21] He, Z. and Owen, A.B. (2014). Extensible grids: Uniform sampling on a space-flling curve. Preprint. Available at arXiv:1406.4549.
• [22] Hlawka, E. and Mück, R. (1972). Über eine Transformation von gleichverteilten Folgen. II. Computing (Arch. Elektron. Rechnen) 9 127–138.
• [23] L’Ecuyer, P., Lécot, C. and L’Archevêque-Gaudet, A. (2009). On array-RQMC for Markov chains: Mapping alternatives and convergence rates. In Monte Carlo and Quasi-Monte Carlo Methods 2008 485–500. Berlin: Springer.
• [24] L’Ecuyer, P., Lécot, C. and Tuffin, B. (2006). A randomized quasi-Monte Carlo simulation method for Markov chain. In Monte Carlo and Quasi-Monte Carlo Methods 2004 331–342. Berlin: Springer.
• [25] L’Ecuyer, P., Lécot, C. and Tuffin, B. (2008). A randomized quasi-Monte Carlo simulation method for Markov chains. Oper. Res. 56 958–975.
• [26] Lemieux, C. (2009). Monte Carlo and Quasi-Monte Carlo Sampling. Springer Series in Statistics. New York: Springer.
• [27] Leobacher, G. and Pillichshammer, F. (2014). Introduction to Quasi-Monte Carlo Integration and Applications. Compact Textbook in Mathematics. Cham: Birkhäuser/Springer.
• [28] Niederreiter, H. (1992). Random number generation and quasi-Monte Carlo methods. CBMS-NSF Regional Conference Series in Applied Mathematics.
• [29] Ökten, G., Tuffin, B. and Burago, V. (2006). A central limit theorem and improved error bounds for a hybrid-Monte Carlo sequence with applications in computational finance. J. Complexity 22 435–458.
• [30] Owen, A.B. (1995). Randomly permuted $(t,m,s)$-nets and $(t,s)$-sequences. In Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing (Las Vegas, NV, 1994). Lecture Notes in Statist. 106 299–317. New York: Springer.
• [31] Owen, A.B. (1997). Monte Carlo variance of scrambled net quadrature. SIAM J. Numer. Anal. 34 1884–1910.
• [32] Owen, A.B. (1998). Scrambling Sobol’ and Niederreiter–Xing points. J. Complexity 14 466–489.
• [33] Poyiadjis, G., Doucet, A. and Singh, S.S. (2011). Particle approximations of the score and observed information matrix in state space models with application to parameter estimation. Biometrika 98 65–80.
• [34] Sagan, H. (1994). Space-Filling Curves. Universitext. New York: Springer.
• [35] Schretter, C., He, Z., Gerber, M. and Niederreiter, H. (2016). Van der Corput and golden ratio sequences along the Hilbert space-filling curve. In Monte Carlo and Quasi-Monte Carlo Methods 2014. Berlin: Springer.
• [36] Van der Vaart, A.W. (2007). Asymptotic Statistics. Cambridge Series on Statistical and Probabilistic Mathematics, Number 3.
• [37] Wächter, C. and Keller, A. (2008). Efficient simultaneous simulation of Markov chains. In Monte Carlo and Quasi-Monte Carlo Methods 2006 669–684. Berlin: Springer.