70 citations · 138 across the 21 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
cs.DS2019★ 4 cited
Faster polytope rounding, sampling, and volume computation via a sublinear "Ball Walk"
Oren Mangoubi, Nisheeth K. Vishnoi
We study the problem of "isotropically rounding" a polytope , that is, computing a linear transformation which makes the uniform distribution on the polytope…
cs.DS2019★ 7 cited
Nonconvex sampling with the Metropolis-adjusted Langevin algorithm
Oren Mangoubi, Nisheeth K. Vishnoi
The Langevin Markov chain algorithms are widely deployed methods to sample from distributions in challenging high-dimensional and non-convex statistics and machine learning applica…
cs.LG2019★ 3 cited
Online Sampling from Log-Concave Distributions
Holden Lee, Oren Mangoubi, Nisheeth K. Vishnoi
Given a sequence of convex functions , we study the problem of sampling from the Gibbs distribution for each epoch in…