Retention Depolarization in Recommender System
Xiaoying Zhang, Hongning Wang, Yang Liu
Abstract
Repeated risk minimization is a popular choice in real-world recommender systems driving their recommendation algorithms to adapt to user preferences and trends. However, numerous studies have shown that it exacerbates retention disparities among user groups, resulting in polarization within the user population. Given the primary objective of improving long-term user engagement in most industrial recommender systems and the significant commercial benefits from a diverse user population, enforcing retention fairness across user population is therefore crucial. Nonetheless, this goal is highly challenging due to the unknown dynamics of user retention (e.g., when a user would abandon the system) and the simultaneous aim to maximize the experience of every user. In this paper, we propose ReFair, the first computational framework that continuously improves recommendation algorithms while ensuring long-term retention fairness in the entire user population. ReFair alternates between environment learning (i.e., estimate the user retention dynamics) and fairness constrained policy improvement with respect to the estimated environment, while effectively handling uncertainties in the estimation. Our solution provides strong theoretical guarantees for long-term recommendation performance and retention fairness violation. Empirical experiments on two real-world recommendation datasets also demonstrate its effectiveness in realizing these two goals.
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 123e836e-e0dc-4529-9c1d-15bcfeeef6ceBuilds on13
- Conservative Q-Learning for Offline Reinforcement LearningAviral Kumar, Aurick Zhou, George Tucker, Sergey LevineNeurIPS 2020 · 2,881 citations
- Neural Contextual Bandits with UCB-based ExplorationDongruo Zhou, Lihong Li, Quanquan GuICML 2020 · 329 citations
- User-oriented Fairness in RecommendationYunqi Li, Hanxiong Chen, Zuohui Fu, Yingqiang Ge et al.WWW 2021 · 293 citations
- First Order Constrained Optimization in Policy SpaceYiming Zhang, Quan Vuong, Keith W. RossNeurIPS 2020 · 238 citations
- Controlling Fairness and Bias in Dynamic Learning-to-RankMarco Morik, Ashudeep Singh, Jessica Hong, Thorsten JoachimsSIGIR 2020 · 205 citations
Related papers
- Ensuring User-side Fairness in Dynamic Recommender SystemsHyunsik Yoo, Zhichen Zeng, Jian Kang, Ruizhong Qiu et al.WWW 2024 · 48 citations
- ENSUR: Equitable and Statistically Unbiased RecommendationNitin Bisht, Xiuwen Gong, Guandong XuICML 2025
- Beyond Match Maximization and Fairness: Retention-Optimized Two-Sided MatchingRen Kishimoto, Rikiya Takehi, Koichi Tanaka, Yoji Tomita et al.ICLR 2026 · 1 citation
- Interpolating Item and User Fairness in Multi-Sided RecommendationsQinyi Chen, Jason Cheuk Nam Liang, Negin Golrezaei, Djallel BouneffoufNeurIPS 2024 · 8 citations
- Long-Term Fairness with Unknown DynamicsTongxin Yin, Reilly Raab, Mingyan Liu, Yang LiuNeurIPS 2023 · 33 citations
