## Bernoulli

• Bernoulli
• Volume 24, Number 3 (2018), 1726-1786.

### Unbiased Monte Carlo: Posterior estimation for intractable/infinite-dimensional models

#### Abstract

We provide a general methodology for unbiased estimation for intractable stochastic models. We consider situations where the target distribution can be written as an appropriate limit of distributions, and where conventional approaches require truncation of such a representation leading to a systematic bias. For example, the target distribution might be representable as the $L^{2}$-limit of a basis expansion in a suitable Hilbert space; or alternatively the distribution of interest might be representable as the weak limit of a sequence of random variables, as in MCMC. Our main motivation comes from infinite-dimensional models which can be parameterised in terms of a series expansion of basis functions (such as that given by a Karhunen–Loeve expansion). We introduce and analyse schemes for direct unbiased estimation along such an expansion. However, a substantial component of our paper is devoted to the study of MCMC schemes which, due to their infinite dimensionality, cannot be directly implemented, but which can be effectively estimated unbiasedly. For all our methods we give theory to justify the numerical stability for robust Monte Carlo implementation, and in some cases we illustrate using simulations. Interestingly the computational efficiency of our methods is usually comparable to simpler methods which are biased. Crucial to the effectiveness of our proposed methodology is the construction of appropriate couplings, many of which resonate strongly with the Monte Carlo constructions used in the coupling from the past algorithm.

#### Article information

Source
Bernoulli Volume 24, Number 3 (2018), 1726-1786.

Dates
Revised: July 2016
First available in Project Euclid: 2 February 2018

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

Digital Object Identifier
doi:10.3150/16-BEJ911

#### Citation

Agapiou, Sergios; Roberts, Gareth O.; Vollmer, Sebastian J. Unbiased Monte Carlo: Posterior estimation for intractable/infinite-dimensional models. Bernoulli 24 (2018), no. 3, 1726--1786. doi:10.3150/16-BEJ911. https://projecteuclid.org/euclid.bj/1517540459

#### References

• [1] Adler, R.J. (1990). An Introduction to Continuity, Extrema, and Related Topics for General Gaussian Processes. Institute of Mathematical Statistics Lecture Notes – Monograph Series, 12. Hayward, CA: IMS.
• [2] Agapiou, S., Larsson, S. and Stuart, A.M. (2013). Posterior contraction rates for the Bayesian approach to linear ill-posed inverse problems. Stochastic Process. Appl. 123 3828–3860.
• [3] Agapiou, S., Roberts, G.O. and Vollmer, S.J. Supplement to “Unbiased Monte Carlo: Posterior estimation for intractable/infinite-dimensional models.” DOI:10.3150/16-BEJ911SUPP.
• [4] Agapiou, S., Stuart, A.M. and Zhang, Y.-X. (2014). Bayesian posterior contraction rates for linear severely ill-posed inverse problems. J. Inverse Ill-Posed Probl. 22 297–321.
• [5] Beskos, A., Papaspiliopoulos, O., Roberts, G.O. and Fearnhead, P. (2006). Exact and computationally efficient likelihood-based estimation for discretely observed diffusion processes. J. R. Stat. Soc. Ser. B. Stat. Methodol. 68 333–382.
• [6] Beskos, A., Roberts, G., Stuart, A. and Voss, J. (2008). MCMC methods for diffusion bridges. Stoch. Dyn. 8 319–350.
• [7] Cotter, S.L., Dashti, M. and Stuart, A.M. (2010). Approximation of Bayesian inverse problems for PDEs. SIAM J. Numer. Anal. 48 322–345.
• [8] Dashti, M. and Stuart, A.M. The Bayesian approach to inverse problems. In Handbook of Uncertainty Quantification (R. Ghanem, D. Higdon and H. Owhadi, eds.). Springer.
• [9] Dodwell, T.J., Ketelsen, C., Scheichl, R. and Teckentrup, A.L. (2015). A hierarchical multilevel Markov chain Monte Carlo algorithm with applications to uncertainty quantification in subsurface flow. SIAM/ASA J. Uncertain. Quantificat. 3 1075–1108.
• [10] Durmus, A., Fort, G. and Moulines, É. (2016). Subgeometric rates of convergence in Wasserstein distance for Markov chains. Ann. Inst. H. Poincaré Probab. Statist. 52 1799–1822.
• [11] Durmus, A. and Moulines, É. (2015). Quantitative bounds of convergence for geometrically ergodic Markov chain in the Wasserstein distance with application to the Metropolis adjusted Langevin algorithm. Stat. Comput. 25 5–19.
• [12] Forsythe, G.E. and Leibler, R.A. (1950). Matrix inversion by a Monte Carlo method. Math. Tables Other Aids Comput. 4 127–129.
• [13] Giles, M.B. (2008). Multilevel Monte Carlo path simulation. Oper. Res. 56 607–617.
• [14] Glynn, P.W. (1983). Randomized estimators for time integrals. Tech. rep., Mathematics Research Center, University of Wisconsin, Madison.
• [15] Glynn, P.W. and Whitt, W. (1992). The asymptotic efficiency of simulation estimators. Oper. Res. 40 505–520.
• [16] Gruhlke, D. (2014). Convergence of multilevel MCMC methods on path spaces Ph.D. thesis, Universitäts-und Landesbibliothek, Bonn.
• [17] Hairer, M., Mattingly, J.C. and Scheutzow, M. (2011). Asymptotic coupling and a general form of Harris’ theorem with applications to stochastic delay equations. Probab. Theory Related Fields 149 223–259.
• [18] Hairer, M., Stuart, A.M. and Vollmer, S.J. (2014). Spectral gaps for a Metropolis-Hastings algorithm in infinite dimensions. Ann. Appl. Probab. 24 2455–2490.
• [19] Hoang, V.H., Schwab, C. and Stuart, A.M. (2013). Complexity analysis of accelerated MCMC methods for Bayesian inversion. Inverse Probl. 29 085010, 37.
• [20] McLeish, D. (2011). A general method for debiasing a Monte Carlo estimator. Monte Carlo Methods Appl. 17 301–315.
• [21] Mengersen, K.L. and Tweedie, R.L. (1996). Rates of convergence of the Hastings and Metropolis algorithms. Ann. Statist. 24 101–121.
• [22] Meyn, S. and Tweedie, R.L. (2009). Markov Chains and Stochastic Stability, 2nd ed. Cambridge: Cambridge Univ. Press.
• [23] Peluchetti, S. and Roberts, G.O. (2012). A study on the efficiency of exact methods for diffusion simulation. In Monte Carlo and Quasi-Monte Carlo Methods 2010. Springer Proc. Math. Stat. 23 161–187. Springer, Heidelberg.
• [24] Pinski, F.J., Simpson, G., Stuart, A.M. and Weber, H. (2015). Algorithms for Kullback–Leibler approximation of probability measures in infinite dimensions. SIAM J. Sci. Comput. 37 A2733–A2757.
• [25] Propp, J.G. and Wilson, D.B. (1996). Exact sampling with coupled Markov chains and applications to statistical mechanics. In Proceedings of the Seventh International Conference on Random Structures and Algorithms (Atlanta, GA, 1995) 9 223–252.
• [26] Rhee, C.H. (2013). Unbiased estimation with biased samples Ph.D. thesis, Stanford University.
• [27] Rhee, C.-H. and Glynn, P.W. (2015). Unbiased estimation with square root convergence for SDE models. Oper. Res. 63 1026–1043.
• [28] Roberts, G.O. and Rosenthal, J.S. (2004). General state space Markov chains and MCMC algorithms. Probab. Surv. 1 20–71.
• [29] Rudolf, D. (2012). Explicit error bounds for Markov chain Monte Carlo. Dissertationes Math. (Rozprawy Mat.) 485 1–93.
• [30] Schwab, C. and Stuart, A.M. (2012). Sparse deterministic approximation of Bayesian inverse problems. Inverse Probl. 28 045003, 32.
• [31] Vihola, M. (2015). Unbiased estimators and multilevel Monte Carlo. arXiv preprint, arXiv:1512.01022.
• [32] Vollmer, S.J. (2015). Dimension-independent MCMC sampling for inverse problems with non-Gaussian priors. SIAM/ASA J. Uncertain. Quantificat. 3 535–561.
• [33] Wasow, W.R. (1952). A note on the inversion of matrices by random walks. Math. Tables Other Aids Comput. 6 78–81.

#### Supplemental materials

• Supplement to “Unbiased Monte Carlo: posterior estimation for intractable/infinite-dimensional models”. We provide detailed proofs, further consideration on unbiased estimators for Bayesian linear inverse problems and an elliptic inverse problem as detailed example.