Stochastic Approximate Gradient Descent via the Langevin Algorithm

Abstract

We introduce a novel and efficient algorithm called the stochastic approximate gradient descent (SAGD), as an alternative to the stochastic gradient descent for cases where unbiased stochastic gradients cannot be trivially obtained. Traditional methods for such problems rely on general-purpose sampling techniques such as Markov chain Monte Carlo, which typically requires manual intervention for tuning parameters and does not work efficiently in practice. Instead, SAGD makes use of the Langevin algorithm to construct stochastic gradients that are biased in finite steps but accurate asymptotically, enabling us to theoretically establish the convergence guarantee for SAGD. Inspired by our theoretical analysis, we also provide useful guidelines for its practical implementation. Finally, we show that SAGD performs well experimentally in popular statistical and machine learning problems such as the expectation-maximization algorithm and the variational autoencoders.

References in corpus (12)

• Adam: A Method for Stochastic Optimization
• ADADELTA: An Adaptive Learning Rate Method
• MCMC using Hamiltonian dynamics
• Importance Weighted Autoencoders
• Stochastic Variance Reduction for Nonconvex Optimization
• Adaptive Gradient Methods with Dynamic Bound of Learning Rate
• On the Convergence of Stochastic Gradient MCMC Algorithms with High-Order Integrators
• Underdamped Langevin MCMC: A non-asymptotic analysis
• Convergence of Langevin MCMC in KL-divergence
• Is There an Analog of Nesterov Acceleration for MCMC?
• Divergence Triangle for Joint Training of Generator Model, Energy-based Model, and Inference Model
• Efficient stochastic optimisation by unadjusted Langevin Monte Carlo. Application to maximum marginal likelihood and empirical Bayesian estimation