Simpson's Paradox in Recommender Fairness: Reconciling differences between per-user and aggregated evaluations
Not on the map. Why?
Abstract (arXiv)
There has been a flurry of research in recent years on notions of fairness in ranking and recommender systems, particularly on how to evaluate if a recommender allocates exposure equally across groups of relevant items (also known as provider fairness). While this research has laid an important foundation, it gave rise to different approaches depending on whether relevant items are compared per-user/per-query or aggregated across users. Despite both being established and intuitive, we discover that these two notions can lead to opposite conclusions, a form of Simpson's Paradox. We reconcile these notions and show that the tension is due to differences in distributions of users where items are relevant, and break down the important factors of the user's recommendations. Based on this new understanding, practitioners might be interested in either notions, but might face challenges with the per-user metric due to partial observability of the relevance and user satisfaction, typical in real-world recommenders. We describe a technique based on distribution matching to estimate it in such a scenario. We demonstrate on simulated and real-world recommender data the effectiveness and usefulness of such an approach.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 20 of its 47 references that are in the map. First posted on arXiv 14 Oct 2022.
Builds on
20 of 47 references.
References · 20
- 2016Equality of Opportunity in Supervised Learningcited by 2,000
- 2017Neural Collaborative Filteringcited by 1,108
- 2016Recommendations as Treatments: Debiasing Learning and Evaluationcited by 246
- 2017Avoiding Discrimination through Causal Reasoningcited by 191
- 2018Fairness of Exposure in Rankingscited by 189
- 2019Fairness-Aware Ranking in Search & Recommendation Systems with Application to LinkedIn Talent Searchcited by 137
- 2018Equity of Attention: Amortizing Individual Fairness in Rankingscited by 124
- 2013A Theoretical Analysis of NDCG Type Ranking Measurescited by 119
- 2018Offline A/B testing for Recommender Systemscited by 94
- 2017Beyond Parity: Fairness Objectives for Collaborative Filteringcited by 93
- 2017Multisided Fairness for Recommendationcited by 69
- 2019Pairwise Fairness for Ranking and Regressioncited by 58
8 more
- 2020Evaluating Stochastic Rankings with Expected Exposurecited by 53
- 2018Fairness Under Compositioncited by 43
- 2019Toward a better trade-off between performance and fairness with kernel-based distribution matchingcited by 36
- 2018Estimating Position Bias without Intrusive Interventionscited by 31
- 2017Effective Evaluation using Logged Bandit Feedback from Multiple Loggerscited by 20
- 2021The Simpson's Paradox in the Offline Evaluation of Recommendation Systemscited by 16
- 2021Estimation of Fair Ranking Metrics with Incomplete Judgmentscited by 14
- 2021Towards Fair Recommendation in Two-Sided Platformscited by 8
Built on by
Citing papers per year: 2023: 3; 2024: 1; 2025: 0; 2026: 1.
5 papers.
- 2023On the Within-Group Fairness of Screening Classifierscited by 2
- 2023Matched Pair Calibration for Ranking Fairnesscited by 2
- 2024ComFairGNN: Community Fair Graph Neural Networkcited by 1
- 2023The Flawed Foundations of Fair Machine Learningcited by 0
- 2026Federated Measurement of Demographic Disparities from Quantile Sketchescited by 0
- 2026Federated Measurement of Demographic Disparities from Quantile Sketches21 Feb 2026
- 2024ComFairGNN: Community Fair Graph Neural Network7 Nov 2024
- 2023Matched Pair Calibration for Ranking Fairness6 Jun 2023
- 2023The Flawed Foundations of Fair Machine Learning2 Jun 2023
- 2023On the Within-Group Fairness of Screening Classifiers31 Jan 2023