Langevin Markov Chain Monte Carlo with stochastic gradients
Not on the map. Why?
Abstract (arXiv)
Monte Carlo sampling techniques have broad applications in machine learning, Bayesian posterior inference, and parameter estimation. Often the target distribution takes the form of a product distribution over a dataset with a large number of entries. For sampling schemes utilizing gradient information it is cheaper for the derivative to be approximated using a random small subset of the data, introducing extra noise into the system. We present a new discretization scheme for underdamped Langevin dynamics when utilizing a stochastic (noisy) gradient. This scheme is shown to bias computed averages to second order in the stepsize while giving exact results in the special case of sampling a Gaussian distribution with a normally distributed stochastic gradient.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 22 May 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2.
2 papers.