When are Unbiased Monte Carlo Estimators More Preferable than Biased Ones? (2404.01431v1)
Abstract: Due to the potential benefits of parallelization, designing unbiased Monte Carlo estimators, primarily in the setting of randomized multilevel Monte Carlo, has recently become very popular in operations research and computational statistics. However, existing work primarily substantiates the benefits of unbiased estimators at an intuitive level or using empirical evaluations. The intuition being that unbiased estimators can be replicated in parallel enabling fast estimation in terms of wall-clock time. This intuition ignores that, typically, bias will be introduced due to impatience because most unbiased estimators necesitate random completion times. This paper provides a mathematical framework for comparing these methods under various metrics, such as completion time and overall computational cost. Under practical assumptions, our findings reveal that unbiased methods typically have superior completion times - the degree of superiority being quantifiable through the tail behavior of their running time distribution - but they may not automatically provide substantial savings in overall computational costs. We apply our findings to Markov Chain Monte Carlo and Multilevel Monte Carlo methods to identify the conditions and scenarios where unbiased methods have an advantage, thus assisting practitioners in making informed choices between unbiased and biased methods.
- Stochastic bias-reduced gradient methods. Advances in Neural Information Processing Systems 34, 10810–10822.
- Estimating convergence of Markov chains with L-lag couplings. In Advances in Neural Information Processing Systems, Volume 32.
- Unbiased Monte Carlo computation of smooth functions of expectations via taylor expansions. In 2015 Winter Simulation Conference (WSC), pp. 360–367. IEEE.
- Blanchet, J. H. and P. W. Glynn (2015). Unbiased Monte Carlo for optimization and functions of expectations via multi-level randomization. In 2015 Winter Simulation Conference (WSC), pp. 3656–3667. IEEE.
- Unbiased multilevel Monte Carlo: Stochastic optimization, steady-state simulation, quantiles, and other applications. arXiv preprint arXiv:1904.09929.
- Handbook of Markov Chain Monte Carlo. CRC press.
- Scaling limits for the transient phase of local Metropolis–Hastings algorithms. Journal of the Royal Statistical Society Series B: Statistical Methodology 67(2), 253–268.
- Diaconis, P. (2009). The Markov chain Monte Carlo revolution. Bulletin of the American Mathematical Society 46(2), 179–205.
- Durrett, R. (2019). Probability: theory and examples, Volume 49. Cambridge university press.
- Modelling extremal events: for insurance and finance, Volume 33. Springer Science & Business Media.
- Flegal, J. M. and G. L. Jones (2010). Batch means and spectral variance estimators in Markov chain Monte Carlo. The Annals of Statistics, 1034–1070.
- Weak convergence and optimal scaling of random walk Metropolis algorithms. The Annals of Applied Probability 7(1), 110–120.
- Geyer, C. J. (1992). Practical markov chain monte carlo. Statistical science, 473–483.
- Geyer, C. J. (2011). Introduction to Markov chain Monte carlo. Handbook of Markov Chain Monte Carlo 20116022, 45.
- Giles, M. B. (2008). Multilevel Monte Carlo path simulation. Operations Research 56(3), 607–617.
- Giles, M. B. (2015). Multilevel monte carlo methods. Acta numerica 24, 259–328.
- Efficient Risk Estimation for the Credit Valuation Adjustment. arXiv preprint arXiv:2301.05886.
- Glynn, P. W. and C.-h. Rhee (2014). Exact estimation for Markov chain equilibrium expectations. Journal of Applied Probability 51(A), 377–389.
- Estimating the asymptotic variance with batch means. Operations Research Letters 10(8), 431–435.
- The asymptotic validity of sequential stopping rules for stochastic simulations. The Annals of Applied Probability 2(1), 180–198.
- Unbiased MLMC stochastic gradient-based optimization of bayesian experimental designs. SIAM Journal on Scientific Computing 44(1), A286–A311.
- Multi-index monte carlo: when sparsity meets sampling. Numerische Mathematik 132, 767–806.
- Nested Multilevel Monte Carlo with Biased and Antithetic Sampling. arXiv preprint arXiv:2308.07835.
- Heinrich, S. (2001). Multilevel monte carlo methods. In International Conference on Large-Scale Scientific Computing, pp. 58–67. Springer.
- Monte Carlo complexity of parametric integration. Journal of Complexity 15(3), 317–341.
- Heng, J. and P. E. Jacob (2019). Unbiased Hamiltonian Monte Carlo with couplings. Biometrika 106(2), 287–302.
- Unbiased Markov chain Monte Carlo methods with couplings. Journal of the Royal Statistical Society: Series B (Statistical Methodology) 82(3), 543–600.
- Jones, G. (2004). On the Markov chain central limit theorem. Probability Surveys 1, 299–320.
- Jones, G. L. and J. P. Hobert (2001). Honest exploration of intractable probability distributions via Markov chain Monte Carlo. Statistical Science, 312–334.
- Mengersen, K. L. and R. L. Tweedie (1996). Rates of convergence of the Hastings and Metropolis algorithms. The Annals of Statistics 24(1), 101–121.
- Meyn, S. P. and R. L. Tweedie (2012). Markov chains and stochastic stability. Springer Science & Business Media.
- Unbiased Markov chain Monte Carlo for intractable target distributions. Electronic Journal of Statistics 14(2).
- Many processors, little time: MCMC for partitions via optimal transport couplings. In International Conference on Artificial Intelligence and Statistics, pp. 3483–3514. PMLR.
- Metropolis-Hastings transition kernel couplings. arXiv preprint arXiv:2102.00366.
- A new and asymptotically optimally contracting coupling for the random walk metropolis. arXiv preprint arXiv:2211.12585.
- Rhee, C.-h. and P. W. Glynn (2015). Unbiased estimation with square root convergence for SDE models. Operations Research 63(5), 1026–1043.
- Roberts, G. O. and J. S. Rosenthal (2004). General state space Markov chains and MCMC algorithms. Probability Surveys 1, 20–71.
- Roberts, G. O. and R. L. Tweedie (1996a). Exponential convergence of langevin distributions and their discrete approximations. Bernoulli, 341–363.
- Roberts, G. O. and R. L. Tweedie (1996b). Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms. Biometrika 83(1), 95–110.
- Rosenthal, J. S. (1997). Faithful couplings of Markov chains: now equals forever. Advances in Applied Mathematics 18(3), 372–381.
- Unbiased estimation using a class of diffusion processes. Journal of Computational Physics 472, 111643.
- Unbiased estimation using underdamped langevin dynamics. SIAM Journal on Scientific Computing 45(6), A3047–A3070.
- Optimal randomized multilevel Monte Carlo for repeatedly nested expectations. In Proceedings of the 40th International Conference on Machine Learning, Volume 202 of Proceedings of Machine Learning Research, pp. 33343–33364. PMLR.
- Vihola, M. (2018). Unbiased estimators and multilevel Monte Carlo. Operations Research 66(2), 448–462.
- Maximal Couplings of the Metropolis-Hastings Algorithm. In AISTATS, pp. 1225–1233. PMLR.
- Unbiased multilevel monte carlo methods for intractable distributions: Mlmc meets mcmc. Journal of Machine Learning Research 24(249), 1–40.
- Unbiased optimal stopping via the MUSE. Stochastic Processes and their Applications 166, 104088.