English

Matched Pair Calibration for Ranking Fairness

Machine Learning 2023-12-04 v3

Abstract

We propose a test of fairness in score-based ranking systems called matched pair calibration. Our approach constructs a set of matched item pairs with minimal confounding differences between subgroups before computing an appropriate measure of ranking error over the set. The matching step ensures that we compare subgroup outcomes between identically scored items so that measured performance differences directly imply unfairness in subgroup-level exposures. We show how our approach generalizes the fairness intuitions of calibration from a binary classification setting to ranking and connect our approach to other proposals for ranking fairness measures. Moreover, our strategy shows how the logic of marginal outcome tests extends to cases where the analyst has access to model scores. Lastly, we provide an example of applying matched pair calibration to a real-word ranking data set to demonstrate its efficacy in detecting ranking bias.

Keywords

Cite

@article{arxiv.2306.03775,
  title  = {Matched Pair Calibration for Ranking Fairness},
  author = {Hannah Korevaar and Chris McConnell and Edmund Tong and Erik Brinkman and Alana Shine and Misam Abbas and Blossom Metevier and Sam Corbett-Davies and Khalid El-Arini},
  journal= {arXiv preprint arXiv:2306.03775},
  year   = {2023}
}

Comments

19 pages, 8 figures

R2 v1 2026-06-28T10:57:56.275Z