Monitoring Algorithmic Fairness under Partial Observations
Thomas A. Henzinger, Konstantin Kueffner, Kaushik Mallik

TL;DR
This paper introduces a method for monitoring algorithmic fairness in partially observed systems using runtime verification, enabling estimation of fairness properties from limited observations with theoretical guarantees.
Contribution
It extends fairness monitoring to partially observed Markov chains and specifications with arithmetic expressions, providing PAC-estimates from single long runs.
Findings
Effective fairness estimation from limited observations
Lightweight monitoring with theoretical guarantees
Successful application to real-world examples
Abstract
As AI and machine-learned software are used increasingly for making decisions that affect humans, it is imperative that they remain fair and unbiased in their decisions. To complement design-time bias mitigation measures, runtime verification techniques have been introduced recently to monitor the algorithmic fairness of deployed systems. Previous monitoring techniques assume full observability of the states of the (unknown) monitored system. Moreover, they can monitor only fairness properties that are specified as arithmetic expressions over the probabilities of different events. In this work, we extend fairness monitoring to systems modeled as partially observed Markov chains (POMC), and to specifications containing arithmetic expressions over the expected values of numerical functions on event sequences. The only assumptions we make are that the underlying POMC is aperiodic and…
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
TopicsFormal Methods in Verification · Adversarial Robustness in Machine Learning · Bayesian Modeling and Causal Inference
