Aggregated Gradient Langevin Dynamics

Abstract

In this paper, we explore a general Aggregated Gradient Langevin Dynamics framework (AGLD) for the Markov Chain Monte Carlo (MCMC) sampling. We investigate the nonasymptotic convergence of AGLD with a unified analysis for different data accessing (e.g. random access, cyclic access and random reshuffle) and snapshot updating strategies, under convex and nonconvex settings respectively. It is the first time that bounds for I/O friendly strategies such as cyclic access and random reshuffle have been established in the MCMC literature. The theoretic results also indicate that methods in AGLD possess the merits of both the low per-iteration computational complexity and the short mixture time. Empirical studies demonstrate that our framework allows to derive novel schemes to generate high-quality samples for large-scale Bayesian posterior learning tasks.

References in corpus (8)

• User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradient
• Non-convex learning via Stochastic Gradient Langevin Dynamics: a nonasymptotic analysis
• On Variance Reduction in Stochastic Gradient Descent and its Asynchronous Variants
• Log-concave sampling: Metropolis-Hastings algorithms are fast
• Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithm
• The True Cost of Stochastic Gradient Langevin Dynamics
• On the Theory of Variance Reduction for Stochastic Gradient Monte Carlo
• Stochastic Variance-Reduced Hamilton Monte Carlo Methods