no code implementations • 4 Sep 2020 • Konstantina Bairaktari, Paul Langton, Huy L. Nguyen, Niklas Smedemark-Margulies, Jonathan Ullman
A challenge in fair algorithm design is that, while there are compelling notions of individual fairness, these notions typically do not satisfy desirable composition properties, and downstream applications based on fair classifiers might not preserve fairness.
1 code implementation • 5 Mar 2020 • Krishna Kumar P., Paul Langton, Wolfgang Gatterbauer
We answer this question affirmatively and suggest a method called distant compatibility estimation that works even on extremely sparsely labeled graphs (e. g., 1 in 10, 000 nodes is labeled) in a fraction of the time it later takes to label the remaining nodes.