30 citations · 69 across the 11 of their papers we have counts for
3 papers · 1 filter
Fair for All: Best-effort Fairness Guarantees for Classification
Anilesh K. Krishnaswamy, Zhihao Jiang, Kangning Wang +2
Standard approaches to group-based notions of fairness, such as \emph{parity} and \emph{equalized odds}, try to equalize absolute measures of performance across known groups (based…
Sparsification of Directed Graphs via Cut Balance
Ruoxu Cen, Yu Cheng, Debmalya Panigrahi +1
In this paper, we consider the problem of designing cut sparsifiers and sketches for directed graphs. To bypass known lower bounds, we allow the sparsifier/sketch to depend on the…
High-Dimensional Robust Mean Estimation via Gradient Descent
Yu Cheng, Ilias Diakonikolas, Rong Ge +1
We study the problem of high-dimensional robust mean estimation in the presence of a constant fraction of adversarial outliers. A recent line of work has provided sophisticated pol…