The reviewed record of science sign in
Pith

arxiv: 2306.03775 · v3 · pith:O5AYN3BS · submitted 2023-06-06 · cs.LG

Matched Pair Calibration for Ranking Fairness

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:O5AYN3BSrecord.jsonopen to challenge →

classification cs.LG
keywords rankingcalibrationfairnessmatchedapproachpairdifferencesaccess
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. When to Ask a Question: Understanding Communication Strategies in Generative AI Tools

    cs.GT 2026-05 unverdicted novelty 5.0

    A tradeoff model shows generative AI can reduce bias against diverse preferences by strategically eliciting information instead of always inferring from majority patterns.