SwISS: a scalable Markov chain Monte Carlo divide-and-conquer strategy

DOI10.1002/STA4.523MaRDI QIDQ6548764zbMATH OpenFDO

Authors Callum Vyner, Christopher Nemeth, Chris Sherlock

Publication date 3 June 2024

Published in Stat (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

Markov chain Monte Carlobig datadivide-and-conquerparallel MCMC

Mathematics Subject Classification ID

Statistics (62-XX)

Cites work

• Asymptotics in statistics. Some basic concepts.
• Control variates for stochastic gradient MCMC
• Likelihood inflating sampling algorithm
• Merging MCMC subposteriors through Gaussian-process approximations
• Nonparametric density estimation with a parametric start
• Scalable Bayes via barycenter in Wasserstein space
• Speeding up MCMC by Delayed Acceptance and Data Subsampling
• Stochastic gradient Markov chain Monte Carlo

Cited in

(1)

• Emerging directions in Bayesian computation

This page was built for publication: SwISS: a scalable Markov chain Monte Carlo divide-and-conquer strategy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6548764)