This work develops a geometric framework for analyzing the robustness of neighborhood-based fairness audits under bounded perturbations, establishes sufficient conditions for neighborhood invariance, quantifies how neighborhood replacement propagates to audit instability, and introduces audit volatility, a measure of the expected sensitivity of fairness audits under repeated perturbations.
Abstract
Neighborhood-based fairness audits evaluate individual fairness by comparing predictions among similar individuals in feature space. Despite their widespread use, little is known about the robustness of the auditing procedure itself. Because these audits rely on nearest neighbor relationships, small perturbations in feature space can alter local neighborhoods and produce different fairness assessments even when model predictions remain unchanged. We develop a geometric framework for analyzing the robustness of neighborhood-based fairness audits under bounded perturbations. Our analysis establishes sufficient conditions for neighborhood invariance, quantifies how neighborhood replacement propagates to audit instability, and introduces audit volatility, a measure of the expected sensitivity of fairness audits under repeated perturbations. Experiments on benchmark datasets support the theoretical analysis and show that the proposed framework explains the observed stability of neighborhood-based fairness audits.
We view fairness as a property of distributional stability. Rather than assessing a predictor under a fixed data distribution, we study how its predictions change under perturbations that modify the composition of protected groups. A predictor is fair if it remains stable under such shifts. Under this perspective, seve...
Gayane Taturyan, Charlotte Laclau, Stéphan Clémençon· 0 citations
This work introduces FAIR-SHEPHERD, a structural policy-based framework for transparent fairness in real-world settings with noisy labels and shifting distributions and develops S-agnostic tools that optimize policy-aligned gradient objectives using lattice-defined proxies.
Shubham Mohole, Hongjun Choi, Christian Schroeder et al.· ACM Journal on Responsible C...· 0 citations
Over the past decade, Machine Learning (ML) has been trained under dual objectives: minimizing prediction error via Empirical Risk Minimization (ERM) while controlling unfairness bias. In practice, however, fairness-aware training often yields limited improvements over standard ERM, making reliable post hoc auditing es...
It is found that large language models tend to prefer stricter fairness constraints than humans, show more self-interested behavior, are sensitive to how information is framed, and are difficult to align with human judgments using fine-tuning with current datasets.
Qi-Shen Han, Hadi Hosseini, Joshua Kavner et al.· 0 citations
A sharp local threshold is identified, stability under bounded perturbations is proved, monotonicity in $k$ is established, and an intrinsic $\Theta(\log n)$ separation between local and global realizability is shown.
Binita Maity, Shrutimoy Das· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.