Post-hoc Provider Fairness Adaptation via Hierarchical Exposure Alignment
Jingzhi Li, Zhiyong Cheng, Richang Hong, Meng Wang
Abstract
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.
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.
Cited by top-tier papers1
Ask how each one uses itBuilds on24
- LightGCN: Simplifying and Powering Graph Convolution Network for RecommendationXiangnan He, Kuan Deng, Xiang Wang, Yan Li et al.SIGIR 2020 · 4,448 citations
- Self-supervised Graph Learning for RecommendationJiancan Wu, Xiang Wang, Fuli Feng, Xiangnan He et al.SIGIR 2021 · 1,476 citations
- User-oriented Fairness in RecommendationYunqi Li, Hanxiong Chen, Zuohui Fu, Yingqiang Ge et al.WWW 2021 · 293 citations
- Fast Differentiable Sorting and RankingMathieu Blondel, Olivier Teboul, Quentin Berthet, Josip DjolongaICML 2020 · 285 citations
- 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
Related papers
- Equity vs. Equality: Optimizing Ranking Fairness for Tailored Provider NeedsYiteng Tu, Weihang Su, Shuguang Han, Yiqun Liu et al.SIGIR 2026
- Ensuring User-side Fairness in Dynamic Recommender SystemsHyunsik Yoo, Zhichen Zeng, Jian Kang, Ruizhong Qiu et al.WWW 2024 · 48 citations
- FairSync: Ensuring Amortized Group Exposure in Distributed Recommendation RetrievalChen Xu, Jun Xu, Yiming Ding, Xiao Zhang et al.WWW 2024 · 14 citations
- Explainable Fairness in RecommendationYingqiang Ge, Juntao Tan, Yan Zhu, Yinglong Xia et al.SIGIR 2022 · 53 citations
- Configurable Fairness for New Item Recommendation Considering Entry Time of ItemsHuizhong Guo, Dongxia Wang, Zhu Sun, Haonan Zhang et al.SIGIR 2024 · 4 citations
