Fetching the paper…
Reading the bibliography…
Inexact Markov Chain Monte Carlo methods rely on Markov chains that do not exactly preserve the target distribution.
Clark R. Givens and Rae Michael Shortt, A class of Wasserstein metrics for probability distributions , Michigan Math. J. 31
1984
Earlier work this paper cites.
Robert J. McCann, Exact solutions to the transportation problem on the line , R. Soc. Lond. Proc. Ser. A Math. Phys. Eng. Sci. 455
1984
Earlier work this paper cites.
S. Duane, A.D. Kennedy, B. J. Pendleton, and D. Roweth, Hybrid monte carlo , Physics Letters B 195
1987
Earlier work this paper cites.
Denis Talay, Second-order discretization schemes of stochastic differential systems for the computation of the invariant law , Stochastics and Stochastic Reports 29
1990
Earlier work this paper cites.
Denis Talay and Luciano Tubaro, Expansion of the global error for numerical schemes solving stochastic differential equations , Stochastic Anal. Appl. 8
1991
Earlier work this paper cites.
R. M. Neal, Bayesian learning via stochastic dynamics , Advances in neural information processing systems, 1993, pp. 475–482
1993
Earlier work this paper cites.
V. Bally and D. Talay, The law of the Euler scheme for stochastic differential equations. I. Convergence rate of the distribution function , Probab. Theory Related Fields 104
1996
Earlier work this paper cites.
G. O. Roberts and R. L. Tweedie, Exponential convergence of Langevin distributions and their discrete approximations , Bernoulli 2
1996
Earlier work this paper cites.
G. O. Roberts, A. Gelman, and W. R. Gilks, Weak convergence and optimal scaling of random walk Metropolis algorithms , Ann. Appl. Probab. 7
1997
Earlier work this paper cites.
D. J. Higham, Mean-square and asymptotic stability of the stochastic theta method , SIAM journal on numerical analysis 38
2000
Earlier work this paper cites.
Gareth O. Roberts and Jeffrey S. Rosenthal, Optimal scaling for various Metropolis-Hastings algorithms , Statist. Sci. 16
2001
Earlier work this paper cites.
Michael I. Jordan, Graphical models , Statist. Sci. 19
2004
Earlier work this paper cites.
B. Leimkuhler and S. Reich, Simulating Hamiltonian dynamics , no. 14, Cambridge university press, 2004
2004
Earlier work this paper cites.
Christian P. Robert and George Casella, Monte Carlo statistical methods , second ed., Springer Texts in Statistics, Springer-Verlag, New York, 2004. MR 2080278
2004
Earlier work this paper cites.
C. Robert, The Bayesian choice: from decision-theoretic foundations to computational implementation , Springer Science & Business Media, 2007
2007
Earlier work this paper cites.
C. Villani, Optimal transport : old and new , Grundlehren der mathematischen Wissenschaften, Springer, Berlin, 2009
2009
Earlier work this paper cites.
A. Eberle, A. Guillin, and R. Zimmer, Couplings and quantitative contraction rates for Langevin dynamics , Ann. Probab. 47
2010
Earlier work this paper cites.
Jonathan C. Mattingly, Andrew M. Stuart, and M. V. Tretyakov, Convergence of numerical time-averaging and stationary measures via Poisson equations , SIAM J. Numer. Anal. 48
2010
Earlier work this paper cites.
A. Rößler, Runge–Kutta methods for the strong approximation of solutions of stochastic differential equations , SIAM Journal on Numerical Analysis 48
2010
Earlier work this paper cites.
P.E. Kloeden and E. Platen, Numerical solution of stochastic differential equations , Stochastic Modelling and Applied Probability, Springer Berlin Heidelberg, 2011
2011
Cited alongside, same era.
M. Welling and Y. W. Teh, Bayesian learning via stochastic gradient Langevin dynamics , Proceedings of the 28th international conference on machine learning (ICML-11), Citeseer, 2011, pp. 681–688
2011
Cited alongside, same era.
K. C. Zygalakis, On the existence and the applications of modified equations for stochastic differential equations , SIAM Journal on Scientific Computing 33
2011
Cited alongside, same era.
D. Barber, Bayesian reasoning and machine learning , Cambridge University Press, 2012
2012
Cited alongside, same era.
A. Debussche and E. Faou, Weak backward error analysis for SDEs , SIAM Journal on Numerical Analysis 50
2012
2019
Later among the works it cites.
A. Durmus, S. Majewski, and B. Miasojedow, Analysis of Langevin Monte Carlo via convex optimization , The Journal of Machine Learning Research 20
2019
Later among the works it cites.
Alain Durmus and Éric Moulines, High-dimensional Bayesian inference via the unadjusted Langevin algorithm , Bernoulli 25
2019
Later among the works it cites.
Andreas Eberle and Mateusz B. Majka, Quantitative contraction rates for Markov chains on general state spaces , Electronic Journal of Probability 24
2019
Later among the works it cites.
Nawaf Bou-Rabee, Andreas Eberle, and Raphael Zimmer, Coupling and convergence for Hamiltonian Monte Carlo , Ann. Appl. Probab. 30
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Natesh S. Pillai, Andrew M. Stuart, and Alexandre H. Thiéry, Optimal scaling and diffusion limits for the Langevin algorithm in high dimensions , Ann. Appl. Probab. 22
2012
Cited alongside, same era.
Alexandros Beskos, Natesh Pillai, Gareth Roberts, Jesus-Maria Sanz-Serna, and Andrew Stuart, Optimal tuning of the hybrid Monte Carlo algorithm , Bernoulli 19
2013
Cited alongside, same era.
A. Abdulle, G. Vilmart, and K. C. Zygalakis, High order numerical approximation of the invariant measure of ergodic SDEs , SIAM J. Numer. Anal. 52
2014
Cited alongside, same era.
A. Eberle, Reflection couplings and contraction rates for diffusions , Probab. Theory Related Fields (2015), 1–36 (English)
2015
Cited alongside, same era.
A. Dubey, S. J Reddi, B. Póczos, A. J Smola, E. P Xing, and S. A. Williamson, Variance reduction in stochastic gradient Langevin dynamics , Advances in neural information processing systems 29
2016
Cited alongside, same era.
Arnak S. Dalalyan, Theoretical guarantees for approximate sampling from smooth and log-concave densities , J. R. Stat. Soc. Ser. B. Stat. Methodol. 79
2017
Cited alongside, same era.
A. Durmus and É. Moulines, Nonasymptotic convergence analysis for the unadjusted Langevin algorithm , Ann. Appl. Probab. 27
2017
Cited alongside, same era.
2020
Later among the works it cites.
2020
Later among the works it cites.
Yuansi Chen, Raaz Dwivedi, Martin J Wainwright, and Bin Yu, Fast mixing of Metropolized Hamiltonian Monte Carlo: Benefits of multi-step gradients , The Journal of Machine Learning Research 21
2020
Later among the works it cites.
Pierre Del Moral and Sumeetpal S. Singh, A backward Itô-Ventzell formula with an application to stochastic interpolation , C. R. Math. Acad. Sci. Paris 358
2020
Later among the works it cites.
Alain Durmus, Éric Moulines, and Eero Saksman, Irreducibility and geometric ergodicity of Hamiltonian Monte Carlo , Ann. Statist. 48
2020
Later among the works it cites.
Yin Tat Lee, Ruoqi Shen, and Kevin Tian, Logsmooth gradient concentration and tighter runtimes for Metropolized Hamiltonian Monte Carlo , Conference on learning theory, PMLR, 2020, pp. 2565–2597
2020
Later among the works it cites.
Mateusz B. Majka, Aleksandar Mijatović, and Łukasz Szpruch, Nonasymptotic bounds for sampling algorithms without log-concavity , Ann. Appl. Probab. 30
2020
Later among the works it cites.
Gilles Pages and Fabien Panloup, Unadjusted Langevin algorithm with multiplicative noise: Total variation and wasserstein bounds , 2020
2020
Later among the works it cites.
Jun Yang, Gareth O. Roberts, and Jeffrey S. Rosenthal, Optimal scaling of Random-Walk Metropolis algorithms on general target distributions , Stochastic Process. Appl. 130
2020
Later among the works it cites.
Sinho Chewi, Chen Lu, Kwangjun Ahn, Xiang Cheng, Thibaut Le Gouic, and Philippe Rigollet, Optimal dimension dependence of the Metropolis-adjusted Langevin algorithm , Conference on Learning Theory, PMLR, 2021, pp. 1260–1300
2021
Closest in time.
2021
Closest in time.
P. Del Moral and S. S. Singh, Backward Itô-Ventzell and stochastic interpolation formulae , Stochastic Process. Appl. 154
2022
Closest in time.
Nawaf Bou-Rabee and Andreas Eberle, Mixing time guarantees for unadjusted Hamiltonian Monte Carlo , Bernoulli 29
2023
Closest in time.
Andreas Eberle, Markov processes , Lecture Notes University of Bonn, https://wt.iam.uni-bonn.de/eberle, 2023
2023
Closest in time.