Decentralized Stochastic Gradient Langevin Dynamics and Hamiltonian Monte Carlo

Abstract

Stochastic gradient Langevin dynamics (SGLD) and stochastic gradient Hamiltonian Monte Carlo (SGHMC) are two popular Markov Chain Monte Carlo (MCMC) algorithms for Bayesian inference that can scale to large datasets, allowing to sample from the posterior distribution of the parameters of a statistical model given the input data and the prior distribution over the model parameters. However, these algorithms do not apply to the decentralized learning setting, when a network of agents are working collaboratively to learn the parameters of a statistical model without sharing their individual data due to privacy reasons or communication constraints. We study two algorithms: Decentralized SGLD (DE-SGLD) and Decentralized SGHMC (DE-SGHMC) which are adaptations of SGLD and SGHMC methods that allow scaleable Bayesian inference in the decentralized setting for large datasets. We show that when the posterior distribution is strongly log-concave and smooth, the iterates of these algorithms converge linearly to a neighborhood of the target distribution in the 2-Wasserstein distance if their parameters are selected appropriately. We illustrate the efficiency of our algorithms on decentralized Bayesian linear regression and Bayesian logistic regression problems.

References in corpus (33)

• A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insights
• Stochastic Gradient Hamiltonian Monte Carlo
• User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradient
• The computation of averages from equilibrium and nonequilibrium Langevin molecular dynamics
• Deep Learning: A Bayesian Perspective
• On the Convergence of Stochastic Gradient MCMC Algorithms with High-Order Integrators
• Streaming Variational Bayes
• Coresets for Scalable Bayesian Logistic Regression
• Parallelizing MCMC via Weierstrass Sampler
• Underdamped Langevin MCMC: A non-asymptotic analysis
• Convergence of Langevin MCMC in KL-divergence
• Automated Scalable Bayesian Inference via Hilbert Coresets
• From Averaging to Acceleration, There is Only a Step-size
• Accelerating Stochastic Gradient Descent For Least Squares Regression
• Bridging the Gap between Stochastic Gradient MCMC and Stochastic Optimization
• Parallelizing MCMC with Random Partition Trees
• COLA: Decentralized Linear Learning
• Is There an Analog of Nesterov Acceleration for MCMC?
• Global Convergence of Stochastic Gradient Hamiltonian Monte Carlo for Non-Convex Stochastic Optimization: Non-Asymptotic Performance Bounds and Momentum-Based Acceleration
• Decentralized Bayesian Learning over Graphs
• Robust Distributed Accelerated Stochastic Gradient Methods for Multi-Agent Networks
• Optimal Algorithms for Distributed Optimization
• An Accelerated Decentralized Stochastic Proximal Algorithm for Finite Sums
• A Survey on Bayesian Deep Learning
• Nonasymptotic estimates for Stochastic Gradient Langevin Dynamics under local conditions in nonconvex optimization
• Breaking Reversibility Accelerates Langevin Dynamics for Global Non-Convex Optimization
• Variational consensus Monte Carlo
• Differentially Private Accelerated Optimization Algorithms
• Distributed Stochastic Gradient Descent: Nonconvexity, Nonsmoothness, and Convergence to Local Minima
• Nonasymptotic analysis of Stochastic Gradient Hamiltonian Monte Carlo under local conditions for nonconvex optimization
• Approximate Decentralized Bayesian Inference
• Decentralized Langevin Dynamics
• Distributed Gradient Methods for Nonconvex Optimization: Local and Global Convergence Guarantees

Cited by in corpus (5)

• Robust Distributed Accelerated Stochastic Gradient Methods for Multi-Agent Networks
• Channel-driven Decentralized Bayesian Federated Learning for Trustworthy Decision Making in D2D Networks
• Decentralized Langevin Dynamics over a Directed Graph
• Heavy-Tail Phenomenon in Decentralized SGD
• A Decentralized Approach to Bayesian Learning