93 citations · 578 across the 83 of their papers we have counts for
7 papers · 1 filter
Condition-number-independent convergence rate of Riemannian Hamiltonian Monte Carlo with numerical integrators
Yunbum Kook, Yin Tat Lee, Ruoqi Shen +1
We study the convergence rate of discretized Riemannian Hamiltonian Monte Carlo on sampling from distributions in the form of on a convex body $\mathcal{M}\subset\mathb…
A Slightly Improved Bound for the KLS Constant
Arun Jambulapati, Yin Tat Lee, Santosh S. Vempala
We refine the recent breakthrough technique of Klartag and Lehec to obtain an improved polylogarithmic bound for the KLS constant.
Constant-Factor Approximation Algorithms for Socially Fair -Clustering
Mehrdad Ghadiri, Mohit Singh, Santosh S. Vempala
We study approximation algorithms for the socially fair -clustering problem with groups, whose special cases include the socially fair -median () and socia…
A Unified Approach to Discrepancy Minimization
Nikhil Bansal, Aditi Laddha, Santosh S. Vempala
We study a unified approach and algorithm for constructive discrepancy minimization based on a stochastic process. By varying the parameters of the process, one can recover various…
Convergence of the Riemannian Langevin Algorithm
Khashayar Gatmiry, Santosh S. Vempala
We study the Riemannian Langevin Algorithm for the problem of sampling from a distribution with density with respect to the natural measure on a manifold with metric . We as…
The -Cap Process on Geometric Random Graphs
Mirabel Reid, Santosh S. Vempala
The -cap (or -winners-take-all) process on a graph works as follows: in each iteration, exactly vertices of the graph are in the cap (i.e., winners); the next round winne…