Fetching the paper…
Reading the bibliography…
Recent developments in parallel Markov chain Monte Carlo (MCMC) algorithms allow us to run thousands of chains almost as quickly as a single chain, using hardware accelerators such as GPUs.
“An automatic method for finding the greatest or least value of a function.”
Rosenbrock, H. H. (1960) · 1960
Earlier work this paper cites.
“Estimation in parallelized randomized experiments.”
Rubin, D. B. (1981) · 1981
Earlier work this paper cites.
“Inference from iterative simulation using multiple sequences (with discussion).”
Gelman, A. and Rubin, D. B. (1992) · 1992
Earlier work this paper cites.
“Evaluating the accuracy of sampling-based approaches to the calculation of posterior moments.”
Geweke, J. (1992) · 1992
Earlier work this paper cites.
“Adaptive direction sampling.”
Gilks, W. R., Roberts, G. O., and George, E. I. (1994) · 1994
Earlier work this paper cites.
“Markov chain Monte Carlo convergence diagnostics: A comparative review.”
Cowles, M. K. and Carlin, B. P. (1996) · 1996
Earlier work this paper cites.
“The Bayesian analysis of population pharmacokinetic models.”
Wakefield, J. (1996) · 1996
Earlier work this paper cites.
“Weak convergence and optimal scaling of random walk Metropolis algorithms.”
Gelman, A., Gilks, W. R., and Roberts, G. O. (1997) · 1997
Earlier work this paper cites.
“General methods for monitoring convergence of iterative simulations.”
Brooks, S. P. and Gelman, A. (1998) · 1998
Earlier work this paper cites.
“Possible biases induced by MCMC convergence diagnostics.”
Cowles, M. K., Roberts, G. O., and Rosenthal, J. S. (1998) · 1998
Earlier work this paper cites.
“Optimal scaling of discrete approximations to Langevin diffusions.”
Roberts, G. O. and Rosenthal, J. S. (1998) · 1998
Earlier work this paper cites.
“Parallel computing and Monte Carlo algorithms.”
Rosenthal, J. S. (2000) · 2000
Earlier work this paper cites.
“Annealed importance sampling.”
Neal, R. M. (2001) · 2001
Earlier work this paper cites.
“tfp.mcmc: Modern Markov chain Monte Carlo tools built for modern hardware.”
Lao, J., Suter, C., Langmore, I., Chimisov, C., Saxena, A., Sountsov, P., Moore, D., Saurous, R. A., Hoffman, M. D., and Dillon, J. V. (2020) · 2002
Earlier work this paper cites.
Information Theory, Inference, and Learning Algorithms
Mackay, D. J. (2003) · 2003
Earlier work this paper cites.
Handbook of Stochastic Methods for Physics, Chemistry and the Natural Sciences, 3rd edition
Gardiner, C. W. (2004) · 2004
Earlier work this paper cites.
Monte Carlo Statistical Methods
Robert, C. P. and Casella, G. (2004) · 2004
Earlier work this paper cites.
“General state space Markov chains and MCMC algorithms.”
— (2004) · 2004
Earlier work this paper cites.
“Sequential Monte Carlo samplers.”
Del Moral, P., Doucet, A., and Jasra, A. (2006) · 2006
Earlier work this paper cites.
“Fixed-width output analysis for Markov chain Monte Carlo.”
Jones, G. L., Haran, M., Caffo, B. S., and Neath, R. (2006) · 2006
Cited alongside, same era.
Data Analysis Using Regression and Multilevel-Hierarchical Models
Gelman, A. and Hill, J. (2007) · 2007
Cited alongside, same era.
“A general framework for the parametrization of hierarchical models.”
Papaspiliopoulos, O., Roberts, G. O., and Sköld, M. (2007) · 2007
Cited alongside, same era.
“A tutorial on adaptive MCMC.”
Andrieu, C. and Thoms, J. (2008) · 2008
Cited alongside, same era.
“Markov chain Monte Carlo: Can we trust the third significant figure?”
Flegal, J. M., Haran, M., and Jones, G. L. (2008) · 2008
Cited alongside, same era.
“Inference from simulations and monitoring convergence.”
Gelman, A. and Shirley, K. (2011) · 2011
Cited alongside, same era.
“An adaptive MCMC scheme for setting trajectory lengths in Hamiltonian Monte Carlo.”
Hoffman, M. D., Radul, A., and Sountsov, P. (2021) · 2021
Closest in time.
“Focusing on difficult directions for learning HMC trajectory lengths.”
Sountsov, P. and Hoffman, M. D. (2021) · 2021
Closest in time.
“Post-processing of MCMC.”
South, L. F., Riabiz, M., Teymur, O., and Oates, C. J. (2021) · 2021
Closest in time.
“Revisiting the Gelman-Rubin diagnostic.”
Vats, D. and Knudson, D. (2021) · 2021
Closest in time.
“Rank-normalization, folding, and localization: An improved R ^ \widehat{R} for assessing convergence of MCMC (with discussion).”
Vehtari, A., Gelman, A., Simpson, D., Carpenter, B., and Bürkner, P.-C. (2021) · 2021
Closest in time.
“Tuning-free generalized Hamiltonian Monte Carlo.”
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
“MCMC using Hamiltonian dynamics.”
— (2012) · 2012
Cited alongside, same era.
“Optimal tuning of the hybrid Monte Carlo algorithm.”
Beskos, A., Pillai, N., Roberts, G., Sanz-Serna, J.-M., and Stuart, A. (2013) · 2013
Cited alongside, same era.
Bayesian Data Analysis, 3rd edition
Gelman, A., Carlin, J. B., Stern, H. S., Dunson, D., Vehtari, A., and Rubin, D. B. (2013) · 2013
Cited alongside, same era.
“Exact estimation for Markov chain equilibrium expectations.”
Glynn, P. W. and Rhee, C.-H. (2014) · 2014
Cited alongside, same era.
“The no-U-turn sampler: Adaptively setting path lengths in Hamiltonian Monte Carlo.”
Hoffman, M. D. and Gelman, A. (2014) · 2014
Cited alongside, same era.
“UCL machine learning repository.” URL http://archive.ics.ucl.edu/ml
Dua, D. and Graff, C. (2017) · 2017
Cited alongside, same era.
Hoffman, M. and Sountsov, P. (2022) · 2022
Closest in time.
“ R ∗ R^{*} : A robust MCMC convergence diagnostic with uncertainty using decision tree classifiers.”
Lambert, B. and Vehtari, A. (2022) · 2022
Closest in time.
“Flexible and efficient Bayesian pharmacometrics modeling using Stan and Torsten, part I.”
Margossian, C. C., Zhang, Y., and Gillespie, W. R. (2022) · 2022
Closest in time.
“Many processors, little time: MCMC for partitions via optimal transport couplings.”
Nguyen, T. D., Trippe, B. L., and Broderick, T. (2022) · 2022
Closest in time.
“Optimal thinning of MCMC output.”
Riabiz, M., Chen, W., Cockayne, J., Swietach, P., Niederer, S. A., Mackey, L., and Oates, C. J. (2022) · 2022
Closest in time.
“Metropolis adjusted Langevin trajectories: A robust alternative to Hamiltonian Monte Carlo.”
Riou-Durand, L. and Vogrinc, J. (2022) · 2022
Closest in time.
“Bayesian workflow book - Digits.” URL https://avehtari.github.io/casestudies/Digits/digits.html
Vehtari, A. (2022) · 2022
Closest in time.
“Parallelization for Markov chain Monte Carlo with heterogeneous runtimes.”
du Ché, S. and Margossian, C. C. (2023) · 2023
Closest in time.
“On the use of a local R ^ \widehat{R} to improve MCMC convergence diagnostic.”
Moins, T., Arbel, J., Dutfoy, A., and Girard, S. (2023) · 2023
Closest in time.
“Adaptive tuning for Metropolis adjusted Langevin trajectories.”
Riou-Durand, L., Sountsov, P., Vogrinc, J., Margossian, C. C., and Power, S. (2023) · 2023
Closest in time.
“TensorFlow Probability.” URL https://www.tensorflow.org/probability
TensorFlow Probability Development Team (2023) · 2023
Closest in time.
“posterior: Tools for working with posterior distributions.” URL https://github.com/stan-dev/posterior
Buekner, P., Gabry, J., Kay, M., and Vehtari, A. (2024) · 2024
Closest in time.
“For how many iterations should we run Markov chain Monte Carlo?”
Margossian, C. C. and Gelman, A. (2024) · 2024
Closest in time.