The Block-Poisson Estimator for Optimally Tuned Exact Subsampling MCMC

References

• Andrieu, C., and Roberts, G. O. (2009), “The Pseudo-marginal Approach for Efficient Monte Carlo Computations,” The Annals of Statistics, 37, 697–725. DOI: 10.1214/07-AOS574.
   Web of Science ®Google Scholar
• Baldi, P., Sadowski, P., and Whiteson, D. (2014), “Searching for Exotic Particles in High-energy Physics With Deep Learning,” Nature Communications, 5. DOI: 10.1038/ncomms5308.
   Web of Science ®Google Scholar
• Banterle, M., Grazian, C., Lee, A., and Robert, C. P. (2019), “Accelerating Metropolis–Hastings Algorithms by Delayed Acceptance,” Foundations of Data Science, 1, 103. DOI: 10.3934/fods.2019005.
   Google Scholar
• Bardenet, R., Doucet, A., and Holmes, C. (2014), “Towards Scaling up Markov Chain Monte Carlo: An Adaptive Subsampling Approach,” in Proceedings of The 31st International Conference on Machine Learning, pp. 405–413.
   Google Scholar
• Bardenet, R., Doucet, A., and Holmes, C. (2017), “On Markov Chain Monte Carlo Methods for Tall Data,” Journal of Machine Learning Research, 18, 1–43.
   Web of Science ®Google Scholar
• Bierkens, J., Fearnhead, P., and Roberts, G. (2019), “The Zig-Zag Process and Super-Efficient Sampling for Bayesian Analysis of Big Data,” The Annals of Statistics, 47, 1288–1320. DOI: 10.1214/18-AOS1715.
   Web of Science ®Google Scholar
• Bouchard-Côté, A., Vollmer, S. J., and Doucet, A. (2018), “The Bouncy Particle Sampler: A Nonreversible Rejection-free Markov Chain Monte Carlo Method,” Journal of the American Statistical Association, 113, 855–867. DOI: 10.1080/01621459.2017.1294075.
   Web of Science ®Google Scholar
• Collobert, R., Bengio, S., and Bengio, Y. (2002), “A Parallel Mixture of SVMs for Very Large Scale Problems,” Neural Computation, 14, 1105–1114. DOI: 10.1162/089976602753633402.
   PubMed Web of Science ®Google Scholar
• Dang, K.-D., Quiroz, M., Kohn, R., Tran, M.-N., and Villani, M. (2019), “Hamiltonian Monte Carlo With Energy Conserving Subsampling,” Journal of Machine Learning Research, 20, 1–31.
   Web of Science ®Google Scholar
• Deligiannidis, G., Doucet, A., and Pitt, M. K. (2018), “The Correlated Pseudomarginal Method,” Journal of the Royal Statistical Society, Series B, 80, 839–870. DOI: 10.1111/rssb.12280.
   Google Scholar
• Doucet, A., Pitt, M., Deligiannidis, G., and Kohn, R. (2015), “Efficient Implementation of Markov chain Monte Carlo When Using an Unbiased Likelihood Estimator,” Biometrika, 102, 295–313. DOI: 10.1093/biomet/asu075.
   Web of Science ®Google Scholar
• Giordani, P., Jacobson, T., Von Schedvin, E., and Villani, M. (2014), “Taking the Twists Into Account: Predicting Firm Bankruptcy Risk With Splines of Financial Ratios,” Journal of Financial and Quantitative Analysis, 49, 1071–1099. DOI: 10.1017/S0022109014000623.
   Web of Science ®Google Scholar
• Hastings, W. K. (1970), “Monte Carlo Sampling Methods Using Markov Chains and Their Applications,” Biometrika, 57, 97–109. DOI: 10.1093/biomet/57.1.97.
   Web of Science ®Google Scholar
• Jacob, P. E. and Thiery, A. H. (2015), “On Nonnegative Unbiased Estimators,” The Annals of Statistics, 43, 769–784. DOI: 10.1214/15-AOS1311.
   Web of Science ®Google Scholar
• Korattikara, A., Chen, Y., and Welling, M. (2014), “Austerity in MCMC Land: Cutting the Metropolis–Hastings Budget,” in Proceedings of the 31st International Conference on Machine Learning (ICML-14), pp. 181–189.
   Google Scholar
• Li, R., Wang, X., Zha, H., and Tao, M. (2020), “Improving Sampling Accuracy of Stochastic Gradient MCMC Methods Via Non-uniform Subsampling of Gradients,” arXiv preprint:2002.08949.
   Google Scholar
• Lyne, A.-M., Girolami, M., Atchade, Y., Strathmann, H., and Simpson, D. (2015), “On Russian Roulette Estimates for Bayesian Inference With Doubly-Intractable Likelihoods,” Statistical Science, 30, 443–467. DOI: 10.1214/15-STS523.
   Web of Science ®Google Scholar
• Maclaurin, D., and Adams, R. P. (2014), “Firefly Monte Carlo: Exact MCMC With Subsets of Data,” in Proceedings of the 30th Conference on Uncertainty in Artificial Intelligence (UAI 2014).
   Google Scholar
• Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., and Teller, E. (1953), “Equation of State Calculations by Fast Computing Machines,” The Journal of Chemical Physics, 21, 1087–1092. DOI: 10.1063/1.1699114.
   Web of Science ®Google Scholar
• Neal, R. M. (2011), “MCMC Using Hamiltonian Dynamics,” Handbook of Markov Chain Monte Carlo, 2, 113–162.
   Google Scholar
• Nishimura, A., Dunson, D., and Lu, J. (2017), “Discontinuous Hamiltonian Monte Carlo for Discrete Parameters and Discontinuous Likelihoods,” arXiv:1705.08510.
   Google Scholar
• Papaspiliopoulos, O. (2009), “A Methodological Framework for Monte Carlo Probabilistic Inference for Diffusion Processes,” Available at http://wrap.warwick.ac.uk/35220/1/WRAP_Papaspiliopoulos_09-31w.pdf.
   Google Scholar
• Payne, R. D., and Mallick, B. K. (2018), “Two-stage Metropolis–Hastings for Tall Data,” Journal of Classification, 35, 29–51. DOI: 10.1007/s00357-018-9248-z.
   PubMed Web of Science ®Google Scholar
• Pitt, M. K., Silva, R. S., Giordani, P., and Kohn, R. (2012), “On Some Properties of Markov Chain Monte Carlo Simulation Methods Based on the Particle Filter,” Journal of Econometrics, 171, 134–151. DOI: 10.1016/j.jeconom.2012.06.004.
   Web of Science ®Google Scholar
• Plummer, M., Best, N., Cowles, K., and Vines, K. (2006), “CODA: Convergence Diagnosis and Output Analysis for MCMC,” R News, 6, 7–11.
   Google Scholar
• Quiroz, M., Kohn, R., Villani, M., and Tran, M.-N. (2019), “Speeding up MCMC by Efficient Data Subsampling,” Journal of the American Statistical Association, 114, 831–843. DOI: 10.1080/01621459.2018.1448827.
   Web of Science ®Google Scholar
• Quiroz, M., Tran, M.-N., Villani, M., and Kohn, R. (2018a), “Speeding Up MCMC by Delayed Acceptance and Data Subsampling,” Journal of Computational and Graphical Statistics, 27, 12–22. DOI: 10.1080/10618600.2017.1307117.
   Web of Science ®Google Scholar
• Quiroz, M., Villani, M., Kohn, R., Tran, M.-N., and Dang, K.-D. (2018b), “Subsampling MCMC — An Introduction for the Survey Statistician,” Sankhya A, 80, 33–69. DOI: 10.1007/s13171-018-0153-7.
   Google Scholar
• Rhee, C., and Glynn, P. W. (2015), “Unbiased Estimation With Square Root Convergence for SDE Models,” Operations Research, 63, 1026–1043. DOI: 10.1287/opre.2015.1404.
   Web of Science ®Google Scholar
• Roberts, G. O., Gelman, A., and Gilks, W. R. (1997), “Weak Convergence and Optimal Scaling of Random Walk Metropolis Algorithms,” The Annals of Applied Probability, 7, 110–120. DOI: 10.1214/aoap/1034625254.
   Web of Science ®Google Scholar
• Salomone, R., Quiroz, M., Kohn, R., Villani, M., and Tran, M.-N. (2020),“Spectral Subsampling MCMC for Stationary Time Series,” International Conference on Machine Learning (ICML2020).
   Google Scholar
• Serfling, R. (1980), Approximation Theorems of Mathematical Statistics, New York: John Wiley & Sons.
   Google Scholar
• Sherlock, C., Thiery, A. H., Roberts, G. O., and Rosenthal, J. S. (2015), “On the Efficiency of Pseudo-marginal Random Walk Metropolis Algorithms,” The Annals of Statistics, 43, 238–275. DOI: 10.1214/14-AOS1278.
   Web of Science ®Google Scholar
• Tran, M.-N., Kohn, R., Quiroz, M., and Villani, M. (2017), “The Block Pseudo-marginal Sampler,” arXiv:1603.02485v5.
   Google Scholar
• Villani, M., Quiroz, M., Kohn, R., and Salomone, R. (2021), “Spectral Subsampling MCMC for Stationary Multivariate Time Series,” arXiv: 2104.02134.
   Google Scholar
• Wagner, W. (1988), “Unbiased Multi-step Estimators for the Monte Carlo Evaluation of Certain Functional Integrals,” Journal of Computational Physics, 79, 336–352. DOI: 10.1016/0021-9991(88)90020-4.
   Web of Science ®Google Scholar