Scalable and Provably Fair Exposure Control for Large-Scale Recommender Systems
Riku Togashi, Kenshi Abe, Yuta Saito
Abstract
Typical recommendation and ranking methods aim to optimize the satisfaction of users, but they are often oblivious to their impact on the items (e.g., products, jobs, news, video) and their providers. However, there has been a growing understanding that the latter is crucial to consider for a wide range of applications, since it determines the utility of those being recommended. Prior approaches to fairness-aware recommendation optimize a regularized objective to balance user satisfaction and item fairness based on some notion such as exposure fairness. These existing methods have been shown to be effective in controlling fairness, however, most of them are computationally inefficient, limiting their applications to only unrealistically small-scale situations. This indeed implies that the literature does not yet provide a solution to enable a flexible control of exposure in the industry-scale recommender systems where millions of users and items exist. To enable a computationally efficient exposure control even for such large-scale systems, this work develops a scalable, fast, and fair method called exposure-aware ADMM (exADMM). exADMM is based on implicit alternating least squares (iALS), a conventional scalable algorithm for collaborative filtering, but optimizes a regularized objective to achieve a flexible control of accuracy-fairness tradeoff. A particular technical challenge in developing exADMM is the fact that the fairness regularizer destroys the separability of optimization subproblems for users and items, which is an essential property to ensure the scalability of iALS. Therefore, we develop a set of optimization tools to enable yet scalable fairness control with provable convergence guarantees as a basis of our algorithm. Extensive experiments performed on three recommendation datasets demonstrate that exADMM enables a far more flexible fairness control than the vanilla version of iALS, while being much more computationally efficient than existing fairness-aware recommendation methods. CCS CONCEPTS • Information systems → Collaborative filtering.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext faa69bbd-d606-4e6b-9bd5-84ae6b0c7dabCited by top-tier papers1
Ask how each one uses itBuilds on8
- FairRec: Two-Sided Fairness for Personalized Recommendations in Two-Sided PlatformsGourab K. Patro, Arpita Biswas, Niloy Ganguly, Krishna P. Gummadi et al.WWW 2020 · 268 citations
- Controlling Fairness and Bias in Dynamic Learning-to-RankMarco Morik, Ashudeep Singh, Jessica Hong, Thorsten JoachimsSIGIR 2020 · 205 citations
- TFROM: A Two-sided Fairness-Aware Recommendation Model for Both Customers and ProvidersYao Wu, Jian Cao, Guandong Xu, Yudong TanSIGIR 2021 · 84 citations
- Computationally Efficient Optimization of Plackett-Luce Ranking Models for Relevance and FairnessHarrie OosterhuisSIGIR 2021 · 68 citations
- Two-sided fairness in rankings via Lorenz dominanceVirginie Do, Sam Corbett-Davies, Jamal Atif, Nicolas UsunierNeurIPS 2021 · 64 citations
Related papers
- Post-hoc Provider Fairness Adaptation via Hierarchical Exposure AlignmentJingzhi Li, Zhiyong Cheng, Richang Hong, Meng WangSIGIR 2026 · 1 citation
- User-item fairness tradeoffs in recommendationsSophie Greenwood, Sudalakshmee Chiniah, Nikhil GargNeurIPS 2024 · 15 citations
- Explainable Fairness in RecommendationYingqiang Ge, Juntao Tan, Yan Zhu, Yinglong Xia et al.SIGIR 2022 · 53 citations
- FairSync: Ensuring Amortized Group Exposure in Distributed Recommendation RetrievalChen Xu, Jun Xu, Yiming Ding, Xiao Zhang et al.WWW 2024 · 14 citations
- FairGAN: GANs-based Fairness-aware Learning for Recommendations with Implicit FeedbackJie Li, Yongli Ren, Ke DengWWW 2022 · 62 citations
