research
∙
06/19/2022
Faster Sampling from Log-Concave Distributions over Polytopes via a Soft-Threshold Dikin Walk
We consider the problem of sampling from a d-dimensional log-concave dis...
share
research
∙
05/05/2019
Faster algorithms for polytope rounding, sampling, and volume computation via a sublinear "Ball Walk"
We study the problem of "isotropically rounding" a polytope K⊆R^n, that ...
research
∙
06/17/2018
Geodesic Convex Optimization: Differentiation on Manifolds, Geodesics, and Convexity
Convex optimization is a vibrant and successful area due to the existenc...
research
∙
11/06/2017
Computing Maximum Entropy Distributions Everywhere
We study the problem of computing the maximum entropy distribution with ...
research
∙
10/27/2017
Group Fairness in Multiwinner Voting
We study multiwinner voting problems when there is an additional require...
research
∙
08/07/2017
