Fetching the paper…
Reading the bibliography…
In most sampling algorithms, including Hamiltonian Monte Carlo, transition rates between states correspond to the probability of making a transition in a single time step, and are constrained to be less than or equal to 1.
A first course in stochastic processes
S Karlin · 1968
Earlier work this paper cites.
Monte Carlo sampling methods using Markov chains and their applications
W Hastings · 1970
Earlier work this paper cites.
Hybrid monte carlo
S Duane, AD Kennedy, BJ Pendleton, and D Roweth · 1987
Earlier work this paper cites.
Representations of knowledge in complex systems
U Grenander and MI Miller · 1994
Earlier work this paper cites.
Exponential Distribution: Theory, Methods and Applications
K. Balakrishnan · 1996
Earlier work this paper cites.
Information theory, inference and learning algorithms
DJC MacKay · 2003
Earlier work this paper cites.
Shadow hybrid Monte Carlo: an efficient propagator in phase space of macromolecules
JA Izaguirre and SS Hampton · 2004
Earlier work this paper cites.
Transition path theory for Markov jump processes
Philipp Metzner, Christof Schütte, and Eric Vanden-Eijnden · 2009
Earlier work this paper cites.
Markov Chains and Mixing Times David A . Levin Yuval Peres
Elizabeth L Wilmer · 2009
Earlier work this paper cites.
MCMC using Hamiltonian dynamics
Radford M Neal · 2010
Earlier work this paper cites.
Continuous time Markov chain models for chemical reaction networks
David F Anderson and Thomas G Kurtz · 2011
Cited alongside, same era.
Riemann manifold Langevin and Hamiltonian Monte Carlo methods
Mark Girolami and Ben Calderhead · 2011
Cited alongside, same era.
Quasi-Newton Markov chain Monte Carlo
Y Zhang and C Sutton · 2011
Cited alongside, same era.
Hybrid monte carlo on hilbert spaces
A Beskos, FJ Pinski, J. M. Sanz-Serna, and A. M. Stuart · 2011
Cited alongside, same era.
Split hamiltonian monte carlo
B Shahbaba, S Lan, WO Johnson, and RM Neal · 2011
Cited alongside, same era.
Fast MCMC sampling for Markov jump processes and continuous time Bayesian networks
Vinayak Rao and Yee Whye Teh · 2012
Cited alongside, same era.
Introduction to stochastic processes
Erhan Cinlar · 2013
Later among the works it cites.
Adaptive Hamiltonian and Riemann Manifold Monte Carlo
Z Wang, S Mohamed, and D Nando · 2013
Later among the works it cites.
Violation of detailed balance accelerates relaxation
Akihisa Ichiki and Masayuki Ohzeki · 2013
Later among the works it cites.
Hamiltonian Monte Carlo without detailed balance
Jascha Sohl-Dickstein, Mayur Mudigonda, and Michael DeWeese · 2014
Later among the works it cites.
The Geometric Foundations of Hamiltonian Monte Carlo
M J Betancourt, Simon Byrne, Samuel Livingstone, and Mark Girolami · 2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Hamiltonian Annealed Importance Sampling for partition function estimation
Jascha Sohl-Dickstein and Benjamin J. Culpepper · 2012
Cited alongside, same era.
Hamiltonian Monte Carlo with Reduced Momentum Flips
Jascha Sohl-Dickstein · 2012
Cited alongside, same era.
Practical bayesian optimization of machine learning algorithms
Jasper Snoek, Hugo Larochelle, and Ryan P Adams · 2012
Cited alongside, same era.
Tianqi Chen, Emily B Fox, and Carlos Guestrin · 2014
Later among the works it cites.
Extra Chance Generalized Hybrid Monte Carlo
Cédric M Campos and J M Sanz-Serna · 2015
Closest in time.
Edward Meeds, Robert Leenders, and Max Welling · 2015
Closest in time.
Exponential Integration for Hamiltonian Monte Carlo
Wei-Lun Chao, Justin Solomon, Dominik L Michels, and Fei Sha · 2015
Closest in time.