Fetching the paper…
Reading the bibliography…
Irreversible and rejection-free Monte Carlo methods, recently developed in Physics under the name Event-Chain and known in Statistics as Piecewise Deterministic Monte Carlo (PDMC), have proven to produce clear acceleration over standard Monte Carlo methods, thanks to the reduction of their random-walk behavior.
Peskun-tierney ordering for markov chain and process monte carlo: beyond the reversible scenario
Andrieu, C. and S. Livingstone (2019) · 1906
Earlier work this paper cites.
Equation of state calculation by fast computing machines
Metropolis, M., A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller (1953) · 1953
Earlier work this paper cites.
Monte Carlo sampling methods using Markov chains and their applications
Hastings, W. K. (1970) · 1970
Earlier work this paper cites.
Stochastic relaxation, Gibbs distributions and the Bayesian restoration of images
Geman, S. and D. Geman (1984) · 1984
Earlier work this paper cites.
Markov processes
Ethier, S. N. and T. G. Kurtz (1986) · 1986
Earlier work this paper cites.
Hybrid Monte Carlo
Duane, S., A. D. Kennedy, B. J. Pendelton, and D. Roweth (1987) · 1987
Earlier work this paper cites.
Markov Models & Optimization
Davis, M. (1993) · 1993
Earlier work this paper cites.
Markov Models & Optimization
Davis, M. (1993) · 1993
Earlier work this paper cites.
Bayesian Learning for Neural Networks
Neal, R. M. (1996) · 1996
Earlier work this paper cites.
Lifting Markov chains to speed up mixing
Chen, F., L. Lovász, and I. Pak (1999) · 1999
Earlier work this paper cites.
Monte Carlo Statistical Methods
Robert, C. P. and G. Casella (1999) · 1999
Earlier work this paper cites.
Analysis of a nonreversible Markov chain sampler
Diaconis, P., S. Holmes, and R. M. Neal (2000) · 2000
Earlier work this paper cites.
Improving asymptotic variance of MCMC estimators: Non-reversible chains are better
Neal, R. M. (2004) · 2004
Earlier work this paper cites.
Measure Theory
Bogachev, V. (2006) · 2006
Earlier work this paper cites.
Event-Chain Monte Carlo algorithms for hard-sphere systems
Bernard, E. P., W. Krauth, and D. B. Wilson (2009) · 2009
Earlier work this paper cites.
Event-Chain Monte Carlo algorithms for hard-sphere systems
Bernard, E. P., W. Krauth, and D. B. Wilson (2009) · 2009
Cited alongside, same era.
Two-step melting in two dimensions: First-order liquid-hexatic transition
Bernard, E. P. and W. Krauth (2011) · 2011
Cited alongside, same era.
Riemann manifold Langevin and Hamiltonian Monte Carlo methods
Girolami, M. and B. Calderhead (2011) · 2011
Cited alongside, same era.
Rejection-free Monte Carlo sampling for general potentials
Peters, E. A. J. F. and G. de With (2012) · 2012
Cited alongside, same era.
Rejection-free Monte Carlo sampling for general potentials
Peters, E. A. J. F. and G. de With (2012) · 2012
Cited alongside, same era.
Optimal tuning of the hybrid monte carlo algorithm
Beskos, A., N. Pillai, G. Roberts, J.-M. Sanz-Serna, and A. Stuart (2013, 11) · 2013
Irreversible Markov chains by the factorized Metropolis filter : algorithms and applications in particle systems and spin models
Michel, M. (2016, October) · 2016
Later among the works it cites.
Piecewise deterministic simulated annealing
Monmarché, P. (2016) · 2016
Later among the works it cites.
A piecewise deterministic scaling limit of lifted Metropolis-Hastings in the Curie-Weiss model
Bierkens, J. and G. Roberts (2017) · 2017
Closest in time.
Stan: A probabilistic programming language
Carpenter, B., A. Gelman, M. Hoffman, D. Lee, B. Goodrich, M. Betancourt, M. Brubaker, J. Guo, P. Li, and A. Riddell (2017) · 2017
Closest in time.
UCI machine learning repository
Dua, D. and K. Efi (2017) · 2017
Closest in time.
Event-Chain Monte Carlo algorithms for three- and many-particle interactions
Harland, J., M. Michel, T. A. Kampmann, and J. Kierfeld (2017) · 2017
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Dynamics of one-dimensional ising model without detailed balance condition
Sakai, Y. and K. Hukushima (2013) · 2013
Cited alongside, same era.
Adaptive Hamiltonian and Riemann manifold Monte Carlo samplers
Wang, Z., S. Mohamed, and N. de Freitas (2013) · 2013
Cited alongside, same era.
The No-U-Turn Sampler: adaptively setting path lengths in Hamiltonian Monte Carlo
Hoffman, M. D. and A. Gelman (2014) · 2014
Cited alongside, same era.
Generalized Event-Chain Monte Carlo: Constructing rejection-free global-balance algorithms from infinitesimal steps
Michel, M., S. C. Kapfer, and W. Krauth (2014) · 2014
Cited alongside, same era.
Hamiltonian Monte Carlo without detailed balance
Sohl-Dickstein, J., M. Mudigonda, and M. R. DeWeese (2014) · 2014
Cited alongside, same era.
Generalized Event-Chain Monte Carlo: Constructing rejection-free global-balance algorithms from infinitesimal steps
Michel, M., S. C. Kapfer, and W. Krauth (2014) · 2014
Cited alongside, same era.
Closest in time.
Piecewise Deterministic Markov Chain Monte Carlo
Vanetti, P., A. Bouchard-Côté, G. Deligiannidis, and A. Doucet (2017) · 2017
Closest in time.
Generalized Bouncy Particle Sampler
Wu, C. and C. P. Robert (2017) · 2017
Closest in time.
The bouncy particle sampler
Bouchard-Côté, A., S. J. Vollmer, and A. Doucet (2018) · 2018
Closest in time.
The bouncy particle sampler
Bouchard-Côté, A., S. J. Vollmer, and A. Doucet (2018) · 2018
Closest in time.
The Zig-Zag process and super-efficient sampling for Bayesian analysis of big data
Bierkens, J., P. Fearnhead, and G. Roberts (2019) · 2019
Closest in time.
Ergodicity of the Zig-Zag process
Bierkens, J., G. Roberts, and P.-A. Zitt (2019) · 2019
Closest in time.
Clock monte carlo methods
Michel, M., X. Tan, and Y. Deng (2019) · 2019
Closest in time.
Clock monte carlo methods
Michel, M., X. Tan, and Y. Deng (2019) · 2019
Closest in time.