54 citations · 150 across the 11 of their papers we have counts for
4 papers · 2 filters
Maximum Entropy Distributions: Bit Complexity and Stability
Damian Straszak, Nisheeth K. Vishnoi
Maximum entropy distributions with discrete support in dimensions arise in machine learning, statistics, information theory, and theoretical computer science. While structural…
Subdeterminant Maximization via Nonconvex Relaxations and Anti-concentration
Javad B. Ebrahimi, Damian Straszak, Nisheeth K. Vishnoi
Several fundamental problems that arise in optimization and computer science can be cast as follows: Given vectors and a constraint family ${\cal…
Ranking with Fairness Constraints
L. Elisa Celis, Damian Straszak, Nisheeth K. Vishnoi
Ranking algorithms are deployed widely to order a set of items in applications such as search engines, news feeds, and recommendation systems. Recent studies, however, have shown t…
On Convex Programming Relaxations for the Permanent
Damian Straszak, Nisheeth K. Vishnoi
In recent years, several convex programming relaxations have been proposed to estimate the permanent of a non-negative matrix, notably in the works of Gurvits and Samorodnitsky. Ho…