Fairness Testing through Extreme Value Theory
Verya Monjezi, Ashutosh Trivedi, Vladik Kreinovich, Saeid Tizpaz-Niari

TL;DR
This paper introduces a novel fairness testing method using Extreme Value Theory to evaluate worst-case discrimination in machine learning models, revealing limitations of existing bias mitigation techniques.
Contribution
It proposes a new fairness criterion called extreme counterfactual discrimination and a sampling algorithm to assess worst-case bias in ML models.
Findings
Generative AI can generate sufficient tail samples in 95% of cases.
Bias mitigators often reduce average-case but increase worst-case discrimination.
ECD-based mitigation improves tail fairness in 90% of cases without harming average fairness.
Abstract
Data-driven software is increasingly being used as a critical component of automated decision-support systems. Since this class of software learns its logic from historical data, it can encode or amplify discriminatory practices. Previous research on algorithmic fairness has focused on improving average-case fairness. On the other hand, fairness at the extreme ends of the spectrum, which often signifies lasting and impactful shifts in societal attitudes, has received significantly less emphasis. Leveraging the statistics of extreme value theory (EVT), we propose a novel fairness criterion called extreme counterfactual discrimination (ECD). This criterion estimates the worst-case amounts of disadvantage in outcomes for individuals solely based on their memberships in a protected group. Utilizing tools from search-based software engineering and generative AI, we present a randomized…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQualitative Comparative Analysis Research
MethodsSparse Evolutionary Training
