Summary of Distribution-specific Auditing For Subgroup Fairness, by Daniel Hsu et al.
Distribution-Specific Auditing For Subgroup Fairness
by Daniel Hsu, Jizhou Huang, Brendan Juba
First submitted to arxiv on: 27 Jan 2024
Categories
- Main: Machine Learning (cs.LG)
- Secondary: Computational Complexity (cs.CC); Computers and Society (cs.CY)
GrooveSquid.com Paper Summaries
GrooveSquid.com’s goal is to make artificial intelligence research accessible by summarizing AI papers in simpler terms. Each summary below covers the same AI paper, written at different levels of difficulty. The medium difficulty and low difficulty versions are original summaries written by GrooveSquid.com, while the high difficulty version is the paper’s original abstract. Feel free to learn from the version that suits you best!
| Summary difficulty | Written by | Summary |
|---|---|---|
| High | Paper authors | High Difficulty Summary Read the original abstract here |
| Medium | GrooveSquid.com (original content) | Medium Difficulty Summary In this paper, researchers tackle the challenge of auditing classifiers to ensure statistical subgroup fairness. They build upon earlier work by Kearns et al., who demonstrated that auditing combinatorial subgroups is equivalent to agnostic learning. However, existing approaches assume access to an oracle for solving this problem, despite a lack of efficient algorithms. The authors explore the connection between weak, “distribution-free” learning and families such as log-concave distributions. |
| Low | GrooveSquid.com (original content) | Low Difficulty Summary Auditing classifiers with statistical subgroup fairness is crucial. Imagine if AI systems unfairly treated certain groups of people, like women or minorities. The researchers in this paper investigate how to ensure these AI models don’t discriminate against specific groups. They work on solving a tricky problem called “auditing combinatorial subgroups” and show that it’s as hard as learning without knowing the underlying data distribution. |
