Fetching the paper…
Reading the bibliography…
Markov chain Monte Carlo (MCMC) is a key algorithm in computational statistics, and as datasets grow larger and models grow more complex, many popular MCMC algorithms become too computationally expensive to be practical.
“Equation of State Calculations by Fast Computing Machines”
N. Metropolis et al · 1953
Earlier work this paper cites.
“Monte Carlo Sampling Methods using Markov Chains and their Applications”
W. Hastings · 1970
Earlier work this paper cites.
“Exact Stochastic Simulation of Coupled Chemical Reactions”
D. Gillespie · 1977
Earlier work this paper cites.
“Peskun–Tierney ordering for Markovian Monte Carlo: Beyond the reversible scenario”
Christophe Andrieu and Samuel Livingstone · 1981
Earlier work this paper cites.
“On the Asymptotic Distribution of the Size of a Stochastic Epidemic”
T. Sellke · 1983
Earlier work this paper cites.
“Analysis of high-dimensional Continuous Time Markov Chains using the Local Bouncy Particle Sampler”
T. Zhao and A. Bouchard-Côté · 1983
Earlier work this paper cites.
“Piecewise-Deterministic Markov Processes: A General Class of Non-Diffusion Stochastic Models”
M. Davis · 1984
Earlier work this paper cites.
“Hybrid Monte Carlo”
S. Duane, A. Kennedy, B. Pendleton and D. Roweth · 1987
Earlier work this paper cites.
“Markov Models and Optimization”
M. Davis · 1993
Earlier work this paper cites.
“Exponential convergence of Langevin distributions and their discrete approximations”
G. Roberts and R. Tweedie · 1996
Earlier work this paper cites.
“Stochastic Volatility: Likelihood Inference and Comparison with ARCH Models”
S. Kim, N. Shephard and S. Chib · 1998
Earlier work this paper cites.
“Bayesian inference for partially observed stochastic epidemics”
P. O’Neill and G. Roberts · 1999
Earlier work this paper cites.
“Analysis of a Nonreversible Markov Chain Sampler”
P. Diaconis, S. Holmes and R. Neal · 2000
Earlier work this paper cites.
“Optimal scaling for various Metropolis-Hastings algorithms”
G. Roberts and J. Rosenthal · 2001
Earlier work this paper cites.
“Numerical Recipes 3rd Edition: The Art of Scientific Computing”
W. Press, S. Teukolsky, W. Vetterling and B. Flannery · 2007
Earlier work this paper cites.
“Coupling and Ergodicity of Adaptive Markov Chain Monte Carlo Algorithms”
G. Roberts and J. Rosenthal · 2007
Earlier work this paper cites.
“The Event-Driven Approach to N-Body Simulation”
D. Rapaport · 2009
Earlier work this paper cites.
“On Integral Probability Metrics, ϕ \phi -divergences and Binary Classification”
B. Sriperumbudur et al · 2009
Earlier work this paper cites.
“MCMC Using Hamiltonian Dynamics”
R. Neal · 2010
Earlier work this paper cites.
“Irreversible Monte Carlo Algorithms for Efficient Sampling”
K. Turitsyn, M. Chertkov and M. Vucelja · 2010
Earlier work this paper cites.
“Handbook of Markov Chain Monte Carlo”
S. Brooks, A. Gelman, G. Jones and X. Meng · 2011
Earlier work this paper cites.
“Riemann Manifold Langevin and Hamiltonian Monte Carlo Methods”
M. Girolami, B. Calderhead and S. Chin · 2011
Earlier work this paper cites.
“A Short History of Markov Chain Monte Carlo: Subjective Recollections from Incomplete Data”
C. Robert and G. Casella · 2011
Cited alongside, same era.
“Rejection-Free Monte Carlo Sampling for General Potentials”
E. Peters and G. de With · 2012
Cited alongside, same era.
“Almost sure convergence of numerical approximations for Piecewise Deterministic Markov Processes”
M. Riedler · 2012
Cited alongside, same era.
“Optimal tuning of the hybrid Monte Carlo algorithm”
A. Beskos et al · 2013
Cited alongside, same era.
“A General Metric for Riemannian Manifold Hamiltonian Monte Carlo”
M. Betancourt · 2013
Cited alongside, same era.
“Accelerating reversible Markov chains”
T.-L. Chen and C.-R. Hwang · 2013
Cited alongside, same era.
“A Note on the Birkhoff Ergodic Theorem”
N. Sandrić · 2017
Later among the works it cites.
“Cosmology from Cosmic Shear with DES Science Verification Data”
The Dark Energy Survey Collaboration et al · 2017
Later among the works it cites.
“Generalized Bouncy Particle Sampler”
C. Wu and C. Robert · 2017
Later among the works it cites.
“High-dimensional scaling limits of piecewise deterministic sampling algorithms”
J. Bierkens, K. Kamatani and G. Roberts · 2018
Later among the works it cites.
“Perturbation theory for Markov chains via Wasserstein distance”
D. Rudolf and N. Schweizer · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
“MCMC methods for Functions: Modifying Old Algorithms to Make them Faster”
S. Cotter, G. Roberts, A. Stuart and D. White · 2013
Cited alongside, same era.
“Telegraph Process on the Line”
A. Kolesnik and N. Ratanov · 2013
Cited alongside, same era.
“On Time Reversal of Piecewise Deterministic Markov Processes”
A. Löpker and Z. Palmowski · 2013
Cited alongside, same era.
“Optimizing The Integrator Step Size for Hamiltonian Monte Carlo”
M. Betancourt, S. Byrne and M. Girolami · 2015
Cited alongside, same era.
“Non-Reversible Metropolis Hastings”
J. Bierkens · 2016
Cited alongside, same era.
“Bayesian Uncertainty Quantification for Transmissibility of Influenza, Norovirus and Ebola using Information Geometry”
T. House et al · 2016
Cited alongside, same era.
P. Vanetti, A. Bouchard-Côté, G. Deligiannidis and A. Doucet · 2018
Later among the works it cites.
“The Zig-Zag process and super-efficient sampling for Bayesian analysis of big data”
J. Bierkens, P. Fearnhead and G. Roberts · 2019
Later among the works it cites.
“Ergodicity of the ZigZag process”
J. Bierkens, G. Roberts and P. Zitt · 2019
Later among the works it cites.
“Spectral Analysis of the ZigZag Process”
J. Bierkens and S. Verduyn · 2019
Later among the works it cites.
“Ensemble Transport Adaptive Importance Sampling”
C. Cotter, S. Cotter and P. Russell · 2019
Later among the works it cites.
“Adaptive schemes for piecewise deterministic Monte Carlo algorithms”
A. Bertazzi and J. Bierkens · 2020
Closest in time.
“Reversible Jump PDMP Samplers for Variable Selection”
A. Chevallier, P. Fearnhead and M. Sutton · 2020
Closest in time.
“Transport map accelerated adaptive importance sampling, and application to inverse problems arising from multiscale stochastic reaction networks”
S. Cotter, I. Kevrekidis and P. Russell · 2020
Closest in time.
“Subgeometric hypocoercivity for piecewise-deterministic Markov process Monte Carlo methods”
C. Andrieu, P. Dobson and A.. Wang · 2021
Closest in time.
“Hypocoercivity of piecewise deterministic Markov process-Monte Carlo”
C. Andrieu, A. Durmus, N. Nüsken and J. Roussel · 2021
Closest in time.
“Approximations of Piecewise Deterministic Markov Processes and their convergence properties”
A. Bertazzi, J. Bierkens and P. Dobson · 2021
Closest in time.
“PDMP Monte Carlo methods for piecewise-smooth densities”
A. Chevallier, S. Power, A. Wang and P. Fearnhead · 2021
Closest in time.
“Randomized Hamiltonian Monte Carlo as scaling limit of the bouncy particle sampler and dimension-free convergence rates”
G. Deligiannidis, D. Paulin, A. Bouchard-Côté and A. Doucet · 2021
Closest in time.
“An n-dimensional Rosenbrock distribution for Markov chain Monte Carlo testing”
Filippo Pagani, Martin Wiegand and Saralees Nadarajah · 2021
Closest in time.
“Concave-Convex PDMP-based sampling”
M. Sutton and P. Fearnhead · 2021
Closest in time.
“Geometric ergodicity of the Bouncy Particle Sampler”
A. Durmus, A. Guillin and P. Monmarché · 2098
Closest in time.