Uncovering Discrimination Clusters: Quantifying and Explaining Systematic Fairness Violations
Ranit Debnath Akash, Ashish Kumar, Verya Monjezi, Ashutosh Trivedi, Gang Tan, Saeid Tizpaz-Niari
摘要
Fairness in algorithmic decision-making is often framed in terms of individual fairness, which requires that similar individuals receive similar outcomes. A system violates individual fairness if there exists a pair of inputs differing only in protected attributes (such as race or gender) that lead to significantly different outcomes—for example, one favorable and the other unfavorable. While this notion highlights isolated instances of unfairness, it fails to capture broader patterns of clustered discrimination that may affect entire subgroups.We introduce and motivate the concept of discrimination clustering, a generalization of individual fairness violations. Rather than detecting single counterfactual disparities, we seek to uncover regions of the input space where small perturbations in protected features lead to k-significantly distinct clusters of outcomes. That is, for a given input, we identify a local neighborhood—differing only in protected attributes—whose members’ outputs separate into many distinct clusters. These clusters reveal significant arbitrariness in treatment solely based on protected attributes, exposing patterns of algorithmic bias that elude pairwise fairness checks.We present HyFair, a hybrid technique that combines formal symbolic analysis (via SMT and MILP solvers) to certify individual fairness with randomized search to discover discriminatory clusters. This combination enables both formal guarantees— when no counterexamples exist—and the detection of severe violations that are computationally challenging for symbolic methods alone. Given a set of inputs exhibiting high k-discrimination, we further introduce a novel explanation method that generates interpretable, decision-tree-style artifacts.Our experiments show that HyFair outperforms state-of-the-art fairness verification and local explanation methods. It reveals that some benchmarks exhibit substantial discrimination clustering, while others show limited or no disparities with respect to protected attributes. It also provides intuitive explanations that support understanding and mitigation of unfairness.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它它引用的顶会 Paper23
- Bias in machine learning software: why? how? what to do?Joymallya Chakraborty, Suvodeep Majumder, Tim MenziesFSE 2021 · 被引用 186 次
- White-box fairness testing through adversarial samplingPeixin Zhang, Jingyi Wang, Jun Sun, Guoliang Dong 等ICSE 2020 · 被引用 127 次
- Do the machine learning models on a crowd sourced platform exhibit bias? an empirical study on model fairnessSumon Biswas, Hridesh RajanFSE 2020 · 被引用 96 次
- MAAT: a novel ensemble approach to addressing fairness and performance bugs for machine learning softwareZhenpeng Chen, Jie M. Zhang, Federica Sarro, Mark HarmanFSE 2022 · 被引用 65 次
- Perfectly parallel fairness certification of neural networksCaterina Urban, Maria Christakis, Valentin Wüstholz, Fuyuan ZhangOOPSLA 2020 · 被引用 61 次
相关 Paper
- Fast and Accurate Fair k-Center Clustering in Doubling MetricsMatteo Ceccarello, Andrea Pietracaprina, Geppino PucciWWW 2024 · 被引用 10 次
- A Pairwise Fair and Community-preserving Approach to k-Center ClusteringBrian Brubach, Darshan Chakrabarti, John P. Dickerson, Samir Khuller 等ICML 2020 · 被引用 39 次
- Fairify: Fairness Verification of Neural NetworksSumon Biswas, Hridesh RajanICSE 2023 · 被引用 27 次
- Fair Clustering via AlignmentKunwoong Kim, Jihu Lee, Sangchul Park, Yongdai KimICML 2025
- Causal Disentangled Anchor Learning for Scalable Fair Multi-view ClusteringSuyuan Liu, Shengfei Wei, Wenjing Yang, Shengju Yu 等ICML 2026
