Sampling Ex-Post Group-Fair Rankings

• DOI: 10.24963/ijcai.2023/46
• Publication Date: 2023-08-11T08:31:30Z
• Authors: Sruthi Gorantla; Amit Deshpande; Anand Louis
• Keywords: FOS: Computer and information sciences; Computer Science - Machine Learning; Computer Science - Data Structures and Algorithms; 0202 electrical engineering, electronic engineering, information engineering; Data Structures and Algorithms (cs.DS); 02 engineering and technology; Machine Learning (cs.LG)

Randomized rankings have been of recent interest to achieve ex-ante fairer exposure and better robustness than deterministic rankings. We propose a set of natural axioms for randomized group-fair rankings and prove that there exists a unique distribution D that satisfies our axioms and is supported only over ex-post group-fair rankings, i.e., rankings that satisfy given lower and upper bounds on group-wise representation in the top-k ranks. Our problem formulation works even when there is implicit bias, incomplete relevance information, or only ordinal ranking is available instead of relevance scores or utility values.

We propose two algorithms to sample a random group-fair ranking from the distribution D mentioned above. Our first dynamic programming-based algorithm samples ex-post group-fair rankings uniformly at random in time O(k^2 ell), where "ell" is the number of groups. Our second random walk-based algorithm samples ex-post group-fair rankings from a distribution epsilon-close to D in total variation distance and has expected running time O*(k^2 ell^2), when there is a sufficient gap between the given upper and lower bounds on the group-wise representation. The former does exact sampling, but the latter runs significantly faster on real-world data sets for larger values of k. We give empirical evidence that our algorithms compare favorably against recent baselines for fairness and ranking utility on real-world data sets.