The Bouncy Particle Sampler: A Nonreversible Rejection-Free Markov Chain Monte Carlo Method

References

• Bardenet, R., Doucet, A., and Holmes, C. C. (2014), “Towards Scaling up MCMC: An Adaptive Subsampling Approach,” in Proceedings of the 31st International Conference on Machine Learning, pp. 405–413.
   Google Scholar
• ——— (2017), “On Markov Chain Monte Carlo for Tall Data,” Journal of Machine Learning Research, 18, 1515–1557.
   Google Scholar
• Bierkens, J., Fearnhead, P., and Roberts, G. O. (2016), “The Zig-Zag Process and Super-Efficient Monte Carlo for Bayesian Analysis of Big Data,” Technical Report. arXiv preprint:1607.03188.
   Google Scholar
• Bouchard-Côté, A., Vollmer, S. J., and Doucet, A. (2015), “The Bouncy Particle Sampler: A Non-Reversible Rejection-Free Markov Chain Monte Carlo Method,” Technical Report. arxiv preprint:1510.02451v1.
   Google Scholar
• Creutz, M. (1988), “Global Monte Carlo Algorithms for Many-Fermion Systems,” Physical Review D, 38, 1228–1237.
   PubMed Web of Science ®Google Scholar
• Davis, M. H. A. (1993), Markov Models & Optimization (Vol. 49), Boca Raton, FL: CRC Press.
   Google Scholar
• Devroye, L. (1986), Non-uniform Random Variate Generation, New York: Springer-Verlag.
   Google Scholar
• Flegal, J. M., Hughes, J., and Vats, D. (2015), mcmcse: Monte Carlo Standard Errors for MCMC, R Package Version 1.1-2. Available at https://cran.r-project.org/web/packages/mcmcse/index.html
   Google Scholar
• Galbraith, N. (2016), “On Event-Chain Monte Carlo Methods,” Master’s thesis, Department of Statistics, Oxford University.
   Google Scholar
• Geweke, J. (1992), “Evaluating the Accuracy of Sampling-Based Approaches to the Calculation of Posterior Moments,” Bayesian Statistics, 4, 169–193.
   Google Scholar
• Girolami, M., and Calderhead, B. (2011), “Riemann Manifold Langevin and Hamiltonian Monte Carlo Methods,” Journal of the Royal Statistical Society, Series B, 73, 123–214.
   Google Scholar
• Hayasaka, K., Takashi, G., and Satoshi, H., (1988), “Molecular Phylogeny and Evolution of Primate Mitochondrial DNA,” Molecular Biology and Evolution, 5, 626–644.
   PubMed Web of Science ®Google Scholar
• Hoffman, M. D., and Gelman, A. (2014), “The No-U-turn Sampler: Adaptively Setting Path Lengths in Hamiltonian Monte Carlo,” Journal of Machine Learning Research, 15, 1593–1623.
   Web of Science ®Google Scholar
• Horowitz, A. M. (1991), “A Generalized Guided Monte Carlo Algorithm,” Physics Letters B, 268, 247–252.
   Web of Science ®Google Scholar
• Huelsenbeck, J. P., and Ronquist, F. (2001), “MRBAYES: Bayesian Inference of Phylogenetic Trees,” Bioinformatics, 17, 754–755.
   PubMed Web of Science ®Google Scholar
• Kampmann, T. A., Boltz, H. H., and Kierfeld, J. (2015), “Monte Carlo Simulation of Dense Polymer Melts using Event Chain Algorithms,” Journal of Chemical Physics, 143, 044105.
   PubMed Web of Science ®Google Scholar
• Liu, J. S. (2008), Monte Carlo Strategies in Scientific Computing, New York: Springer.
   Google Scholar
• Maclaurin, D., and Adams, R. P. (2014), “Firefly Monte Carlo: Exact MCMC with Subsets of Data,” in Uncertainty in Artificial Intelligence (Vol. 30), pp. 543–552.
   Google Scholar
• Michel, M., Kapfer, S. C., and Krauth, W. (2014), “Generalized Event-Chain Monte Carlo: Constructing Rejection-Free Global-Balance Algorithms from Infinitesimal Steps,” Journal of Chemical Physics, 140, 054116.
   PubMed Web of Science ®Google Scholar
• Michel, M., Mayer, J., and Krauth, W. (2015), “Event-Chain Monte Carlo for Classical Continuous Spin Models,” Europhysics Letters, 112, 20003.
   Google Scholar
• Neal, R. M. (2011), “Markov Chain Monte Carlo using Hamiltonian Dynamics,” in Handbook of Markov Chain Monte Carlo, eds. S. Brooks, A. Gelman, G. L. Jones, and X. L. Meng, pp. 113–162, Boca Raton, FL: Chapman & Hall/CRC.
   Google Scholar
• Nishikawa, Y., Michel, M., Krauth, W., and Hukushima, K. (2015), “Event-Chain Monte Carlo Algorithm for the Heisenberg Model,” Physical Review E, 92, 063306.
   Web of Science ®Google Scholar
• Ottobre, M. (2016), “Markov Chain Monte Carlo and Irreversibility,” Reports on Mathematical Physics, 77, 267–292.
   Web of Science ®Google Scholar
• Peters, E. A. J. F., and de With, G. (2012), “Rejection-Free Monte Carlo Sampling for General Potentials,” Physical Review E, 85, 026703.
   PubMed Web of Science ®Google Scholar
• Roberts, G. O., and Rosenthal, J. S. (2001), “Optimal Scaling for Various Metropolis-Hastings Algorithms,” Statistical Science, 16, 351–367.
   Web of Science ®Google Scholar
• Teh, Y. W., Thiéry, A. H., and Vollmer, S. J. (2016), “Consistency and Fluctuations for Stochastic Gradient Langevin Dynamics,” Journal of Machine Learning Research, 17, 1–33.
   Web of Science ®Google Scholar
• Thanh, V. H., and Priami, C. (2015), “Simulation of Biochemical Reactions with Time-Dependent Rates by the Rejection-Based Algorithm,” Journal of Chemical Physics, 143, 054104.
   PubMed Web of Science ®Google Scholar
• Wainwright, M. J., and Jordan, M. I. (2008), “Graphical Models, Exponential Families, and Variational Inference,” Foundations and Trends in Machine Learning, 1, 1–305.
   Google Scholar
• Wang, Z., Mohamed, S., and de Freitas, N. (2013), “Adaptive Hamiltonian and Riemann manifold Monte Carlo,” in Proceedings of the 30th International Conference on Machine Learning, pp. 1462–1470.
   Google Scholar
• Welling, M., and Teh, Y. W. (2011), “Bayesian Learning via Stochastic Gradient Langevin Dynamics,” in Proceedings of the 28th International Conference on Machine Learning, pp. 681–688.
   Google Scholar
• Zhao, T., Wang, Z., Cumberworth, A., Gsponer, J., de Freitas, N., and Bouchard-Côté, A. (2016), “Bayesian Analysis of Continuous Time Markov Chains with Application to Phylogenetic Modelling,” Bayesian Analysis, 11, 1203–1237.
   Web of Science ®Google Scholar