Forward Event-Chain Monte Carlo: Fast Sampling by Randomness Control in Irreversible Markov Chains

References

• Andrieu, C., and Livingstone, S. (2019), “Peskun-Tierney Ordering for Markov Chain and Process Monte Carlo: Beyond the Reversible Scenario,” arXiv no. 1906.06197.
   Google Scholar
• Bernard, E. P., and Krauth, W. (2011), “Two-Step Melting in Two Dimensions: First-Order Liquid-Hexatic Transition,” Physical Review Letters, 107, 155704. DOI: 10.1103/PhysRevLett.107.155704.
   PubMed Web of Science ®Google Scholar
• Bernard, E. P., Krauth, W., and Wilson, D. B. (2009), “Event-Chain Monte Carlo Algorithms for Hard-Sphere Systems,” Physical Review E, 80, 056704. DOI: 10.1103/PhysRevE.80.056704.
   Web of Science ®Google Scholar
• Beskos, A., Pillai, N., Roberts, G., Sanz-Serna, J.-M., and Stuart, A. (2013), “Optimal Tuning of the Hybrid Monte Carlo Algorithm,” Bernoulli, 19, 1501–1534. DOI: 10.3150/12-BEJ414.
   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,” Annals of Statistics, 47, 1288–1320. DOI: 10.1214/18-AOS1715.
   Web of Science ®Google Scholar
• Bierkens, J., and Roberts, G. (2017), “A Piecewise Deterministic Scaling Limit of Lifted Metropolis-Hastings in the Curie-Weiss Model,” Annals of Applied Probability, 27, 846–882. DOI: 10.1214/16-AAP1217.
   Web of Science ®Google Scholar
• Bierkens, J., Roberts, G., and Zitt, P.-A. (2019), “Ergodicity of the Zig-Zag Process,” Annals of Applied Probability, 29, 2266–2301. DOI: 10.1214/18-AAP1453.
   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
• Carpenter, B., Gelman, A., Hoffman, M., Lee, D., Goodrich, B., Betancourt, M., Brubaker, M., Guo, J., Li, P., and Riddell, A. (2017), “Stan: A Probabilistic Programming Language,” Journal of Statistical Software, 76, 1–32. DOI: 10.18637/jss.v076.i01.
   PubMed Web of Science ®Google Scholar
• Chen, F., Lovász, L., and Pak, I. (1999), “Lifting Markov Chains to Speed up Mixing,” in Proc. of ACM STOC, pp. 275–281. DOI: 10.1145/301250.301315.
   Google Scholar
• Davis, M. (1993), Markov Models & Optimization (Vol. 49), Boca Raton, FL: CRC Press.
   Google Scholar
• Diaconis, P., Holmes, S., and Neal, R. M. (2000), “Analysis of a Nonreversible Markov Chain Sampler,” Annals of Applied Probability, 10, 726–752. DOI: 10.1214/aoap/1019487508.
   Web of Science ®Google Scholar
• Dua, D., and Graff, C. (2019), UCI Machine Learning Repository. Irvine, CA: University of California, School of Information and Computer Science. http://archive.ics.uci.edu/ml
   Google Scholar
• Duane, S., Kennedy, A. D., Pendelton, B. J., and Roweth, D. (1987), “Hybrid Monte Carlo,” Physics Letters B, 195, 216–222. DOI: 10.1016/0370-2693(87)91197-X.
   Web of Science ®Google Scholar
• Gelfand, A. E., and Smith, A. F. (1990a), “Sampling-Based Approaches to Calculating Marginal Densities,” Journal of the American Statistical Association, 85, 398–409. DOI: 10.1080/01621459.1990.10476213.
   Web of Science ®Google Scholar
• Gelfand, A. E., and Smith, A. F. (1990b), “Sampling-Based Approaches to Calculating Marginal Densities,” Journal of the American Statistical Association, 85, 398–409.
   Web of Science ®Google Scholar
• Geman, S., and Geman, D. (1984), “Stochastic Relaxation, Gibbs Distributions and the Bayesian Restoration of Images,” IEEE Transactions on Pattern Analysis and Machine Intelligence, 6, 721–741. DOI: 10.1109/tpami.1984.4767596.
   PubMed Web of Science ®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. DOI: 10.1111/j.1467-9868.2010.00765.x.
   Google Scholar
• Harland, J., Michel, M., Kampmann, T. A., and Kierfeld, J. (2016), “Event-Chain Monte Carlo Algorithms for Three- and Many-Particle Interactions,” EPL, 117, 30001. DOI: 10.1209/0295-5075/117/30001.
   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
• 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
• Kapfer, S. C., and Krauth, W. (2015), “Two-Dimensional Melting: From Liquid-Hexatic Coexistence to Continuous Transitions,” Physical Review Letters, 114, 035702. DOI: 10.1103/PhysRevLett.114.035702.
   PubMed Web of Science ®Google Scholar
• Metropolis, M., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., and Teller, E. (1953), “Equation of State Calculation by Fast Computing Machines,” Journal of Chemical Physics, 21, 1087–1092. DOI: 10.1063/1.1699114.
   Web of Science ®Google Scholar
• Michel, M. (2016), “Irreversible Markov Chains by the Factorized Metropolis Filter: Algorithms and Applications in Particle Systems and Spin Models,” Ph.D. thesis, École Normale Supérieure de Paris.
   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,” The Journal of Chemical Physics, 140, 054116. DOI: 10.1063/1.4863991.
   PubMed Web of Science ®Google Scholar
• Michel, M., Tan, X., and Deng, Y. (2019), “Clock Monte Carlo Methods,” Physical Review E, 99, 010105(R). DOI: 10.1103/PhysRevE.99.010105.
   Google Scholar
• Monmarché, P. (2016), “Piecewise Deterministic Simulated Annealing,” ALEA-Latin American Journal of Probability and Mathematical Statistics, 13, 357–398. DOI: 10.30757/ALEA.v13-15.
   Web of Science ®Google Scholar
• Neal, R. M. (1996), Bayesian Learning for Neural Networks, Lecture Notes in Statistics (Vol. 118), New York: Springer.
   Google Scholar
• Neal, R. M. (2004), “Improving Asymptotic Variance of MCMC Estimators: Non-Reversible Chains Are Better,” Technical Report No. 0406, Department of Statistics, University of Toronto.
   Google Scholar
• Nishikawa, Y., Michel, M., Krauth, W., and Hukushima, K. (2015), “Event-Chain Algorithm for the Heisenberg Model: Evidence for z≈1 Dynamic Scaling,” Physical Review E, 92, 063306.
   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. DOI: 10.1103/PhysRevE.85.026703.
   PubMed Web of Science ®Google Scholar
• Robert, C. P., and Casella, G. (1999), Monte Carlo Statistical Methods, Springer Texts in Statistics, New York: Springer.
   Google Scholar
• Sakai, Y., and Hukushima, K. (2013), “Dynamics of One-Dimensional Ising Model Without Detailed Balance Condition,” Journal of the Physical Society of Japan, 82, 064003. DOI: 10.7566/JPSJ.82.064003.
   Web of Science ®Google Scholar
• Sohl-Dickstein, J., Mudigonda, M., and DeWeese, M. R. (2014), “Hamiltonian Monte Carlo Without Detailed Balance,” in Proc. ICML (Vol. 32).
   Google Scholar
• Vanetti, P., Bouchard-Côté, A., Deligiannidis, G., and Doucet, A. (2017), “Piecewise Deterministic Markov Chain Monte Carlo,” arXiv no. 1707.05296.
   Google Scholar
• Wang, Z., Mohamed, S., and de Freitas, N. (2013), “Adaptive Hamiltonian and Riemann Manifold Monte Carlo Samplers,” in Proc. ICML (Vol. 28).
   Google Scholar
• Wu, C., and Robert, C. P. (2017), “Generalized Bouncy Particle Sampler,” arXiv no. 1706.04781.
   Google Scholar