DG-LMC: A Turn-key and Scalable Synchronous Distributed MCMC Algorithm via Langevin Monte Carlo within Gibbs
Vincent Plassier, Maxime Vono, Alain Durmus, Eric Moulines
Abstract
Performing reliable Bayesian inference on a big data scale is becoming a keystone in the modern era of machine learning. A workhorse class of methods to achieve this task are Markov chain Monte Carlo (MCMC) algorithms and their design to handle distributed datasets has been the subject of many works. However, existing methods are not completely either reliable or computationally efficient. In this paper, we propose to fill this gap in the case where the dataset is partitioned and stored on computing nodes within a cluster under a master/slaves architecture. We derive a user-friendly centralised distributed MCMC algorithm with provable scaling in high-dimensional settings. We illustrate the relevance of the proposed methodology on both synthetic and real data experiments.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers1
Ask how each one uses itBuilds on1
Related papers
- Spectral Subsampling MCMC for Stationary Time SeriesRobert Salomone, Matias Quiroz, Robert Kohn, Mattias Villani et al.ICML 2020 · 14 citations
- Differentially Private Distributed Bayesian Linear Regression with MCMCBaris Alparslan, Sinan Yildirim, S. Ilker BirbilICML 2023 · 1 citation
- DP-Fast MH: Private, Fast, and Accurate Metropolis-Hastings for Large-Scale Bayesian InferenceWanrong Zhang, Ruqi ZhangICML 2023 · 4 citations
- Variational inference via Wasserstein gradient flowsMarc Lambert, Sinho Chewi, Francis R. Bach, Silvère Bonnabel et al.NeurIPS 2022 · 123 citations
- Scalable Bayesian Learning with posteriorsSamuel Duffield, Kaelan Donatella, Johnathan Chiu, Phoebe Klett et al.ICLR 2025 · 2 citations
