Controlling Fairness and Bias in Dynamic Learning-to-Rank

Abstract

Rankings are the primary interface through which many online platforms match users to items (e.g. news, products, music, video). In these two-sided markets, not only the users draw utility from the rankings, but the rankings also determine the utility (e.g. exposure, revenue) for the item providers (e.g. publishers, sellers, artists, studios). It has already been noted that myopically optimizing utility to the users, as done by virtually all learning-to-rank algorithms, can be unfair to the item providers. We, therefore, present a learning-to-rank approach for explicitly enforcing merit-based fairness guarantees to groups of items (e.g. articles by the same publisher, tracks by the same artist). In particular, we propose a learning algorithm that ensures notions of amortized group fairness, while simultaneously learning the ranking function from implicit feedback data. The algorithm takes the form of a controller that integrates unbiased estimators for both fairness and utility, dynamically adapting both as more data becomes available. In addition to its rigorous theoretical foundation and convergence guarantees, we find empirically that the algorithm is highly practical and robust.

First two authors contributed equally. In Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval 2020

References in corpus (5)

• Runaway Feedback Loops in Predictive Policing
• Estimating Position Bias without Intrusive Interventions
• Minimally Invasive Randomization for Collecting Unbiased Preferences from Clickthrough Logs
• Policy Learning for Fairness in Ranking
• Consequential Ranking Algorithms and Long-term Welfare

Cited by in corpus (29)

• Towards Long-term Fairness in Recommendation
• Deconfounded Recommendation for Alleviating Bias Amplification
• User-controllable Recommendation Against Filter Bubbles
• Maximizing Marginal Fairness for Dynamic Learning to Rank
• CausalRec: Causal Inference for Visual Debiasing in Visually-Aware Recommendation
• Understanding and Mitigating the Effect of Outliers in Fair Ranking
• Intersectional Two-sided Fairness in Recommendation
• Are We Really Achieving Better Beyond-Accuracy Performance in Next Basket Recommendation?
• Introducing the Expohedron for Efficient Pareto-optimal Fairness-Utility Amortizations in Repeated Rankings
• Subverting Fair Image Search with Generative Adversarial Perturbations
• The Role of Relevance in Fair Ranking
• Probabilistic Permutation Graph Search: Black-Box Optimization for Fairness in Ranking
• KL-Mat : Fair Recommender System via Information Geometry
• On the Impact of Outlier Bias on User Clicks
• Group fairness without demographics using social networks
• Recent Advances in the Foundations and Applications of Unbiased Learning to Rank
• Pareto-Optimal Fairness-Utility Amortizations in Rankings with a DBN Exposure Model
• Scalable and Provably Fair Exposure Control for Large-Scale Recommender Systems
• Recommendation Fairness: From Static to Dynamic
• Performative Debias with Fair-exposure Optimization Driven by Strategic Agents in Recommender Systems
• Learning Robust Recommender from Noisy Implicit Feedback
• Effective Visualization and Analysis of Recommender Systems
• Language Fairness in Multilingual Information Retrieval
• Calibrating Explore-Exploit Trade-off for Fair Online Learning to Rank
• Fairness-Aware Online Personalization
• Two-sided fairness in rankings via Lorenz dominance
• Zipf Matrix Factorization : Matrix Factorization with Matthew Effect Reduction
• Incentives for Item Duplication under Fair Ranking Policies
• Estimation of Fair Ranking Metrics with Incomplete Judgments