FairTree: Subgroup Fairness Auditing of Machine Learning Models with Bias-Variance Decomposition
Rudolf Debelak

TL;DR
FairTree is a new algorithm for auditing machine learning models that handles continuous and categorical features directly, decomposes performance disparities into bias and variance, and improves fairness evaluation.
Contribution
It introduces FairTree, a novel method that directly handles various feature types and decomposes disparities, addressing limitations of existing subgroup fairness tools.
Findings
Both approaches have a satisfactory false-positive rate.
The fluctuation test has higher power than permutation-based approach.
Demonstrated effectiveness on UCI Adult Census dataset.
Abstract
The evaluation of machine learning models typically relies mainly on performance metrics based on loss functions, which risk to overlook changes in performance in relevant subgroups. Auditing tools such as SliceFinder and SliceLine were proposed to detect such groups, but usually have conceptual disadvantages, such as the inability to directly address continuous covariates. In this paper, we introduce FairTree, a novel algorithm adapted from psychometric invariance testing. Unlike SliceFinder and related algorithms, FairTree directly handles continuous, categorical, and ordinal features without discretization. It further decomposes performance disparities into systematic bias and variance, allowing a categorization of changes in algorithm performance. We propose and evaluate two variations of the algorithm: a permutation-based approach, which is conceptually closer to SliceFinder, and a…
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.
