Auditing Fairness under Model Updates: Fundamental Complexity and Property-Preserving Updates
Ayoub Ajarra, Debabrota Basu

TL;DR
This paper investigates the fundamental complexity of auditing machine learning models for fairness when models are adaptively updated, proposing a framework that balances property preservation with efficient estimation under strategic shifts.
Contribution
It introduces a generic PAC auditing framework based on an Empirical Property Optimization oracle, and characterizes the complexity of fairness auditing under model updates using the SP dimension.
Findings
Distribution-free auditing bounds for statistical parity.
The SP dimension captures the complexity of strategic model updates.
Framework extends to other auditing objectives like error and robust risk.
Abstract
As machine learning models become increasingly embedded in societal infrastructure, auditing them for bias is of growing importance. However, in real-world deployments, auditing is complicated by the fact that model owners may adaptively update their models in response to changing environments, such as financial markets. These updates can alter the underlying model class while preserving certain properties of interest, raising fundamental questions about what can be reliably audited under such shifts. In this work, we study group fairness auditing under arbitrary updates. We consider general shifts that modify the pre-audit model class while maintaining invariance of the audited property. Our goals are two-fold: (i) to characterize the information complexity of allowable updates, by identifying which strategic changes preserve the property under audit; and (ii) to efficiently estimate…
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
TopicsEthics and Social Impacts of AI · Adversarial Robustness in Machine Learning · Mobile Crowdsensing and Crowdsourcing
