Sequential Hypothesis Testing for Black-Box Fairness Audits

Martín Anaya-Quesada, Marios Kountouris
Proceedings of Fifth European Conference on Algorithmic Fairness, PMLR 350:51-66, 2026.

Abstract

Audits of deployed AI systems often have to decide whether a system violates a behavioral requirement before the auditor can assemble a large, fixed test set. This paper develops a sequential testing framework for black-box fairness auditing. We formalize an audit as a pre-specified hypothesis test on a disparity functional and instantiate the procedure with Wald’s Sequential Probability Ratio Test (SPRT). The framework separates three choices that are often conflated in fairness evaluations: the fairness construct to be audited, the tolerance threshold that makes a disparity practically or legally material, and the statistical risks that the auditor is willing to incur. We evaluate the approach in two studies. In controlled simulations, sequential audits detect violations of statistical parity, equal opportunity, and equalized odds while, under the studied designs, typically using fewer samples than fixed-sample two-proportion tests. In a German Credit case study, the same protocol detects persistent disparities in a baseline classifier and in a classifier trained without the sensitive attribute, while producing substantially fewer bias flags after demographic-parity constrained training. The results show that sequential tests can make fairness audits more sample-efficient, but also that nominal error guarantees require careful pre-registration, treatment of composite hypotheses, multiple-testing correction, and validation under the actual sampling protocol. We further stress-test the procedure on a fair equalized-odds model and derive reporting recommendations for finite-budget audits.

Cite this Paper


BibTeX
@InProceedings{pmlr-v350-anaya-quesada26a, title = {Sequential Hypothesis Testing for Black-Box Fairness Audits}, author = {Anaya-Quesada, Mart\'in and Kountouris, Marios}, booktitle = {Proceedings of Fifth European Conference on Algorithmic Fairness}, pages = {51--66}, year = {2026}, editor = {De Bie, Tijl and Defrance, MaryBeth and Calders, Toon and Nguyen, Dennis}, volume = {350}, series = {Proceedings of Machine Learning Research}, month = {02--04 Sep}, publisher = {PMLR}, pdf = {https://raw.githubusercontent.com/mlresearch/v350/main/assets/anaya-quesada26a/anaya-quesada26a.pdf}, url = {https://proceedings.mlr.press/v350/anaya-quesada26a.html}, abstract = {Audits of deployed AI systems often have to decide whether a system violates a behavioral requirement before the auditor can assemble a large, fixed test set. This paper develops a sequential testing framework for black-box fairness auditing. We formalize an audit as a pre-specified hypothesis test on a disparity functional and instantiate the procedure with Wald’s Sequential Probability Ratio Test (SPRT). The framework separates three choices that are often conflated in fairness evaluations: the fairness construct to be audited, the tolerance threshold that makes a disparity practically or legally material, and the statistical risks that the auditor is willing to incur. We evaluate the approach in two studies. In controlled simulations, sequential audits detect violations of statistical parity, equal opportunity, and equalized odds while, under the studied designs, typically using fewer samples than fixed-sample two-proportion tests. In a German Credit case study, the same protocol detects persistent disparities in a baseline classifier and in a classifier trained without the sensitive attribute, while producing substantially fewer bias flags after demographic-parity constrained training. The results show that sequential tests can make fairness audits more sample-efficient, but also that nominal error guarantees require careful pre-registration, treatment of composite hypotheses, multiple-testing correction, and validation under the actual sampling protocol. We further stress-test the procedure on a fair equalized-odds model and derive reporting recommendations for finite-budget audits.} }
Endnote
%0 Conference Paper %T Sequential Hypothesis Testing for Black-Box Fairness Audits %A Martín Anaya-Quesada %A Marios Kountouris %B Proceedings of Fifth European Conference on Algorithmic Fairness %C Proceedings of Machine Learning Research %D 2026 %E Tijl De Bie %E MaryBeth Defrance %E Toon Calders %E Dennis Nguyen %F pmlr-v350-anaya-quesada26a %I PMLR %P 51--66 %U https://proceedings.mlr.press/v350/anaya-quesada26a.html %V 350 %X Audits of deployed AI systems often have to decide whether a system violates a behavioral requirement before the auditor can assemble a large, fixed test set. This paper develops a sequential testing framework for black-box fairness auditing. We formalize an audit as a pre-specified hypothesis test on a disparity functional and instantiate the procedure with Wald’s Sequential Probability Ratio Test (SPRT). The framework separates three choices that are often conflated in fairness evaluations: the fairness construct to be audited, the tolerance threshold that makes a disparity practically or legally material, and the statistical risks that the auditor is willing to incur. We evaluate the approach in two studies. In controlled simulations, sequential audits detect violations of statistical parity, equal opportunity, and equalized odds while, under the studied designs, typically using fewer samples than fixed-sample two-proportion tests. In a German Credit case study, the same protocol detects persistent disparities in a baseline classifier and in a classifier trained without the sensitive attribute, while producing substantially fewer bias flags after demographic-parity constrained training. The results show that sequential tests can make fairness audits more sample-efficient, but also that nominal error guarantees require careful pre-registration, treatment of composite hypotheses, multiple-testing correction, and validation under the actual sampling protocol. We further stress-test the procedure on a fair equalized-odds model and derive reporting recommendations for finite-budget audits.
APA
Anaya-Quesada, M. & Kountouris, M.. (2026). Sequential Hypothesis Testing for Black-Box Fairness Audits. Proceedings of Fifth European Conference on Algorithmic Fairness, in Proceedings of Machine Learning Research 350:51-66 Available from https://proceedings.mlr.press/v350/anaya-quesada26a.html.

Related Material