activity
20152026
most citedNear-linear time approximation algorithms for optimal transport via Sinkhorn iteration

290 citations · 492 across the 36 of their papers we have counts for

collaborators
Showing 2022 · math.STShow all

1 paper · 2 filters

math.ST2022★ 1 cited

Resolving the Mixing Time of the Langevin Algorithm to its Stationary Distribution for Log-Concave Sampling

Jason M. Altschuler, Kunal Talwar

Sampling from a high-dimensional distribution is a fundamental task in statistics, engineering, and the sciences. A canonical approach is the Langevin Algorithm, i.e., the Markov c…