activity
20162020
most citedUnderdamped Langevin MCMC: A non-asymptotic analysis

97 citations · 108 across the 3 of their papers we have counts for

collaborators

8 papers

math.ST20208 cited

Optimal dimension dependence of the Metropolis-Adjusted Langevin Algorithm

Sinho Chewi, Chen Lu, Kwangjun Ahn +3

Conventional wisdom in the sampling literature, backed by a popular diffusion scaling limit, suggests that the mixing time of the Metropolis-Adjusted Langevin Algorithm (MALA) scal…

cs.LG2019

Stochastic Gradient and Langevin Processes

Xiang Cheng, Dong Yin, Peter L. Bartlett +1

We prove quantitative convergence rates at which discrete Langevin-like processes converge to the invariant distribution of a related stochastic differential equation. We study the…

stat.ML2019

Is There an Analog of Nesterov Acceleration for MCMC?

Yi-An Ma, Niladri Chatterji, Xiang Cheng +3

We formulate gradient-based Markov chain Monte Carlo (MCMC) sampling as optimization on the space of probability measures, with Kullback-Leibler (KL) divergence as the objective fu…

math.ST20193 cited

Quantitative Weak Convergence for Discrete Stochastic Processes

Xiang Cheng, Peter L. Bartlett, Michael I. Jordan

In this paper, we quantitative convergence in for a family of Langevin-like stochastic processes that includes stochastic gradient descent and related gradient-based algorith…

stat.ML2018

Sharp convergence rates for Langevin dynamics in the nonconvex setting

Xiang Cheng, Niladri S. Chatterji, Yasin Abbasi-Yadkori +2

We study the problem of sampling from a distribution , where the function is -smooth everywhere and -strongly convex outside a ball…

stat.ML201797 cited

Underdamped Langevin MCMC: A non-asymptotic analysis

Xiang Cheng, Niladri S. Chatterji, Peter L. Bartlett +1

We study the underdamped Langevin diffusion when the log of the target distribution is smooth and strongly concave. We present a MCMC algorithm based on its discretization and show…