paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Uncovering Discrimination Clusters: Quantifying and Explaining Systematic Fairness Violations

揭示歧视聚类:量化并解释系统性公平性违规
ASE 2025 40th IEEE/ACM International Conference on Automated Software Engineering (ASE)2025匹配度 3/10 · 论文将符号验证(SMT/MILP)与随机搜索结合用于机器学习公平性验证,属于形式化验证与ML系统的交叉,与“PL→AI/静态分析应用于ML系统”有边缘关联;但核心是公平性/歧视聚类,不涉及LLM/Agentic程序、浮点程序分析或贝叶斯程序分析,也不是对代码的静态分析,因此与画像核心方向匹配有限。引用 0 inbox
Ranit D. Akash, Ashish Kumar, Verya Monjezi, Ashutosh Trivedi, Gang Tan, Saeid Tizpaz-Niari
crossref: 2026-09-12

AI 速览

一句话:提出歧视聚类概念,并用符号验证与随机搜索结合的 HyFair 检测、量化并解释系统性公平性违规。

个体公平性检查仅在受保护属性上不同的输入对是否导致显著不同结果,但只能揭示孤立不公平实例,难以刻画影响子群体的聚类歧视。本文提出歧视聚类概念:寻找输入空间中受保护特征的小扰动使输出分裂为 k 个显著不同簇的局部区域,以量化仅由受保护属性导致的任意处理。作者提出 HyFair,混合 SMT/MILP 符号分析与随机搜索:符号分析证明个体公平性,随机搜索发现符号方法难以处理的严重歧视簇;对高 k-歧视输入生成决策树式解释。实验表明 HyFair 优于现有公平性验证与局部解释方法,并在部分基准发现显著歧视聚类。

问题
个体公平性只检查成对反事实差异,忽略受保护属性扰动导致的系统性、聚类化歧视。如何发现并量化输入空间中受保护特征变化引起的结果簇分化,并给出可解释解释?
方法
提出 HyFair,混合 SMT/MILP 符号分析与随机搜索:前者证明个体公平性,后者发现 k-歧视簇;并对高歧视输入生成决策树式可解释解释。
评估
在公平性基准上与现有公平性验证和局部解释方法比较,显示 HyFair 表现更优,能揭示部分基准的显著歧视聚类并提供直观解释。
原文摘要(Abstract)

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.

链接与引用

DOI 原文 · PDF(开放获取) ·

BibTeX
@inproceedings{paperbot9285,
  title = {Uncovering Discrimination Clusters: Quantifying and Explaining Systematic Fairness Violations},
  author = {Ranit D. Akash and Ashish Kumar and Verya Monjezi and Ashutosh Trivedi and Gang Tan and Saeid Tizpaz-Niari},
  booktitle = {ASE},
  year = {2025},
  doi = {10.1109/ase63991.2025.00141}
}