A Note on the Significance Adjustment for FA*IR with Two Protected Groups

2020/12/23 by Zehlike, Meike, Sühr, Tom, Castillo, Carlos · 1 citation
#FOS: Computer and information sciences #Information Retrieval (cs.IR)

paper · doi:10.48550/arxiv.2012.12795

Abstract

In this report we provide an improvement of the significance adjustment from the FA*IR algorithm of Zehlike et al., which did not work for very short rankings in combination with a low minimum proportion p for the protected group. We show how the minimum number of protected candidates per ranking position can be calculated exactly and provide a mapping from the continuous space of significance levels (α) to a discrete space of tables, which allows us to find α_c using a binary search heuristic.

Cited by

• hyperFA*IR: A hypergeometric approach to fair rankings with finite candidate pool

Related

• hyperFA*IR: A hypergeometric approach to fair rankings with finite candidate pool
• Best Subset Selection in Reduced Rank Regression
• Probability Tables for Individual Comparisons by Ranking Methods
• A Burden Shared is a Burden Halved: A Fairness-Adjusted Approach to Classification
• Certified Error Control of Candidate Set Pruning for Two-Stage Relevance Ranking