CYDSIRLGMLJun 21, 2023

Sampling Individually-Fair Rankings that are Always Group Fair

Amazon
arXiv:2306.11964v14 citationsh-index: 22
Originality Incremental advance
AI Analysis

This addresses fairness issues in rankings for online platforms, ensuring both individual and group fairness, which is an incremental improvement over prior work that could violate group fairness due to randomness.

The paper tackles the problem of generating rankings that are both individually fair and always group fair under uncertainty in item utilities, by providing an efficient algorithm that samples rankings from an individually-fair distribution while ensuring every output ranking is group fair, with expected utility at least α times the optimal fair solution, where α approaches 1 under certain conditions, and empirically achieves individual and group fairness while Pareto dominating state-of-the-art baselines.

Rankings on online platforms help their end-users find the relevant information -- people, news, media, and products -- quickly. Fair ranking tasks, which ask to rank a set of items to maximize utility subject to satisfying group-fairness constraints, have gained significant interest in the Algorithmic Fairness, Information Retrieval, and Machine Learning literature. Recent works, however, identify uncertainty in the utilities of items as a primary cause of unfairness and propose introducing randomness in the output. This randomness is carefully chosen to guarantee an adequate representation of each item (while accounting for the uncertainty). However, due to this randomness, the output rankings may violate group fairness constraints. We give an efficient algorithm that samples rankings from an individually-fair distribution while ensuring that every output ranking is group fair. The expected utility of the output ranking is at least $α$ times the utility of the optimal fair solution. Here, $α$ depends on the utilities, position-discounts, and constraints -- it approaches 1 as the range of utilities or the position-discounts shrinks, or when utilities satisfy distributional assumptions. Empirically, we observe that our algorithm achieves individual and group fairness and that Pareto dominates the state-of-the-art baselines.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes