Wasserstein Bounds for Euler and Randomized Midpoint Langevin Sampling with Noisy Gradients
Stochastic-gradient Langevin methods are sampling algorithms that replace the gradient of the log probability density by a noisy, possibly biased evaluation. We study how such gradient-evaluation errors affect the Euler and randomized midpoint discretizations of Langevin dynamics by comparing each noisy chain with its...