Measuring Item Global Residual Value for Fair Recommendation
Jiayin Wang, Weizhi Ma, Chumeng Jiang, Min Zhang, Yuan Zhang, Biao Li, Peng Jiang
Abstract
In the era of information explosion, numerous items emerge every day, especially in feed scenarios. Due to the limited system display slots and user browsing attention, various recommendation systems are designed not only to satisfy users' personalized information needs but also to allocate items' exposure. However, recent recommendation studies mainly focus on modeling user preferences to present satisfying results and maximize user interactions, while paying little attention to developing item-side fair exposure mechanisms for rational information delivery. This may lead to serious resource allocation problems on the item side, such as the Snowball Effect. Furthermore, unfair exposure mechanisms may hurt recommendation performance. In this paper, we call for a shift of attention from modeling user preferences to developing fair exposure mechanisms for items. We first conduct empirical analyses of feed scenarios to explore exposure problems between items with distinct uploaded times. This points out that unfair exposure caused by the time factor may be the major cause of the Snowball Effect. Then, we propose to explicitly model item-level customized timeliness distribution, Global Residual Value (GRV), for fair resource allocation. This GRV module is introduced into recommendations with the designed Timeliness-aware Fair Recommendation Framework (TaFR). Extensive experiments on two datasets demonstrate that TaFR achieves consistent improvements with various backbone recommendation models. By modeling item-side customized Global Residual Value, we achieve a fairer distribution of resources and, at the same time, improve recommendation performance.
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 1de63c92-012e-4f56-901f-b1e146e674f5Cited by top-tier papers1
Ask how each one uses itBuilds on9
- MIND: A Large-scale Dataset for News RecommendationFangzhao Wu, Ying Qiao, Jiun-Hung Chen, Chuhan Wu et al.ACL 2020 · 454 citations
- Causal Intervention for Leveraging Popularity Bias in RecommendationYang Zhang, Fuli Feng, Xiangnan He, Tianxin Wei et al.SIGIR 2021 · 431 citations
- Controlling Fairness and Bias in Dynamic Learning-to-RankMarco Morik, Ashudeep Singh, Jessica Hong, Thorsten JoachimsSIGIR 2020 · 205 citations
- Fairness-Aware Explainable Recommendation over Knowledge GraphsZuohui Fu, Yikun Xian, Ruoyuan Gao, Jieyu Zhao et al.SIGIR 2020 · 198 citations
- Make It a Chorus: Knowledge- and Time-aware Item Modeling for Sequential RecommendationChenyang Wang, Min Zhang, Weizhi Ma, Yiqun Liu et al.SIGIR 2020 · 130 citations
Related papers
- Configurable Fairness for New Item Recommendation Considering Entry Time of ItemsHuizhong Guo, Dongxia Wang, Zhu Sun, Haonan Zhang et al.SIGIR 2024 · 4 citations
- Enhancing New-item Fairness in Dynamic Recommender SystemsHuizhong Guo, Zhu Sun, Dongxia Wang, Tianjun Wei et al.SIGIR 2025 · 7 citations
- Make Fairness More Fair: Fair Item Utility Estimation and Exposure Re-DistributionJiayin Wang, Weizhi Ma, Jiayu Li, Hongyu Lu et al.KDD 2022 · 20 citations
- Learning Heterogeneous Temporal Patterns of User Preference for Timely RecommendationJunsu Cho, Dongmin Hyun, SeongKu Kang, Hwanjo YuWWW 2021 · 40 citations
- Post-hoc Provider Fairness Adaptation via Hierarchical Exposure AlignmentJingzhi Li, Zhiyong Cheng, Richang Hong, Meng WangSIGIR 2026 · 1 citation
