Tolerance-Based Fairness Auditing: Violation Certification and Sensitivity Screening
Jie Tang, Chuanlong Xie, Lixing Zhu
Abstract
As artificial intelligence is increasingly deployed, algorithmic unfairness has raised growing concerns and intensified demands for transparent fairness auditing. In practice, the tolerable degree of algorithmic unfairness depends on the specific legal, ethical, or application context. Given a prespecified tolerance threshold, an important statistical question is how to determine whether a group disparity exceeds the allowable tolerance across different auditing objectives. To address this problem, we develop a unified tolerance-based fairness auditing framework for two complementary auditing objectives: violation certification, which prioritizes control of false violation declarations, and sensitivity screening, which prioritizes reducing missed violations. For the first objective, we develop a constrained empirical likelihood test for formal settings that uses least-favorable-point calibration and can be combined with false flagging rate control for simultaneous subgroup auditing. For the second objective, we develop split empirical likelihood and adjusted split empirical likelihood tests using an adaptive boundary-proxy principle for early-warning settings. Numerical experiments show the distinct error-control--sensitivity trade-offs of these procedures. A COMPAS analysis illustrates the framework in predictive fairness auditing.
Create a lesson
Related papers
Wasserstein Gradient Flows and Forward-Only Diffusion Are Not Enough for Multimodal Sampling
Daniel McBride, Pratik Khandagale, Cristina Garcia-Cardona et al.
Error-Corrected Inference-Time Scaling for Imperfect Diffusion Models
Zuokai Wen, Louis Grenioux, Weinan E et al.
The hidden advantage of mask resampling: a theory of masked autoencoders
Jorge Medina Moreira, Lorenzo Bardone, Lenka Zdeborová
Zero Flux: Flow-Based Comparison of High-Dimensional Discrete Distributions
Leyang Wang, Yakun Wang, Song Liu et al.
Optimal Transport Meets Reinforcement Learning: A Survey
Yujie Zhu, Charles A. Hepburn, Matthew Thorpe et al.
Posterior sampling by source-space MCMC via prior-based few-step transport maps
Hoang Phuc Hau Luu, Marcelo Hartmann, Zhongjian Wang