Timezone: »

Active fairness auditing
Tom Yan · Chicheng Zhang

Wed Jul 20 03:30 PM -- 05:30 PM (PDT) @ Hall E #1222

The fast spreading adoption of machine learning (ML) by companies across industries poses significant regulatory challenges. One such challenge is scalability: how can regulatory bodies efficiently \emph{audit} these ML models, ensuring that they are fair? In this paper, we initiate the study of query-based auditing algorithms that can estimate the demographic parity of ML models in a query-efficient manner. We propose an optimal deterministic algorithm, as well as a practical randomized, oracle-efficient algorithm with comparable guarantees. Furthermore, we make inroads into understanding the optimal query complexity of randomized active fairness estimation algorithms. Our first exploration of active fairness estimation aims to put AI governance on firmer theoretical foundations.

Author Information

Tom Yan (Carnegie Mellon University)
Chicheng Zhang (University of Arizona)

Related Events (a corresponding poster, oral, or spotlight)

More from the Same Authors