Post-hoc Provider Fairness Adaptation via Hierarchical Exposure Alignment
Jingzhi Li, Zhiyong Cheng, Richang Hong, Meng Wang
摘要
Provider exposure fairness is crucial for sustaining a healthy content ecosystem and preventing monopolization in recommender systems. Yet, most existing methods either incorporate fairness constraints during model training, requiring expensive retraining when fairness objectives change, or rely on post-hoc reranking with fixed criteria, which lacks adaptability to diverse fairness requirements. To overcome these limitations, we propose Post-hoc Fairness Adaptation (PFA), a lightweight framework that equips a frozen recommender with a fairness adapter, enabling flexible fairness control without retraining the backbone model. Specifically, the fairness adapter learns personalized additive score adjustments from user–item embeddings, which are injected into the original ranking scores to steer provider exposure toward fairness. To train the adapter, we minimize the Kullback-Leibler (KL) divergence between the actual and the target fair exposure distributions. However, this global objective implicitly treats all providers equally, ignoring structural disparities such as imbalanced provider group sizes and heterogeneous exposure within groups. Consequently, fairness may appear satisfied at an aggregate level while severe inter-group and intra-group exposure imbalances persist, undermining practical fairness. To address this, we design Hierarchical Exposure Fairness Alignment (HEFA), which explicitly balances inter- and intra-group provider exposure disparities, enabling flexible adaptation to diverse fairness requirements. To mitigate potential accuracy degradation, PFA jointly optimizes HEFA with a differentiable NDCG loss, enabling end-to-end fairness optimization while preserving ranking quality. Extensive experiments on three public datasets demonstrate that PFA achieves substantial fairness gains with negligible accuracy loss, consistently outperforming strong baselines. Code is available at https://github.com/Tam-JQK/Post-train.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它它引用的顶会 Paper24
- LightGCN: Simplifying and Powering Graph Convolution Network for RecommendationXiangnan He, Kuan Deng, Xiang Wang, Yan Li 等SIGIR 2020 · 被引用 4,448 次
- Self-supervised Graph Learning for RecommendationJiancan Wu, Xiang Wang, Fuli Feng, Xiangnan He 等SIGIR 2021 · 被引用 1,476 次
- User-oriented Fairness in RecommendationYunqi Li, Hanxiong Chen, Zuohui Fu, Yingqiang Ge 等WWW 2021 · 被引用 293 次
- Fast Differentiable Sorting and RankingMathieu Blondel, Olivier Teboul, Quentin Berthet, Josip DjolongaICML 2020 · 被引用 285 次
- FairRec: Two-Sided Fairness for Personalized Recommendations in Two-Sided PlatformsGourab K. Patro, Arpita Biswas, Niloy Ganguly, Krishna P. Gummadi 等WWW 2020 · 被引用 268 次
相关 Paper
- Equity vs. Equality: Optimizing Ranking Fairness for Tailored Provider NeedsYiteng Tu, Weihang Su, Shuguang Han, Yiqun Liu 等SIGIR 2026
- Ensuring User-side Fairness in Dynamic Recommender SystemsHyunsik Yoo, Zhichen Zeng, Jian Kang, Ruizhong Qiu 等WWW 2024 · 被引用 48 次
- FairSync: Ensuring Amortized Group Exposure in Distributed Recommendation RetrievalChen Xu, Jun Xu, Yiming Ding, Xiao Zhang 等WWW 2024 · 被引用 14 次
- Explainable Fairness in RecommendationYingqiang Ge, Juntao Tan, Yan Zhu, Yinglong Xia 等SIGIR 2022 · 被引用 53 次
- Configurable Fairness for New Item Recommendation Considering Entry Time of ItemsHuizhong Guo, Dongxia Wang, Zhu Sun, Haonan Zhang 等SIGIR 2024 · 被引用 4 次
