Post-hoc Popularity Bias Correction in GNN-based Collaborative Filtering
Md Aminul Islam, Elena Zheleva, Ren Wang
Abstract
User historical interaction data is the primary signal for learning user preferences in collaborative filtering (CF). However, the training data often exhibits a long-tailed distribution, where only a few items have the majority of interactions. CF models trained directly on such imbalanced data are prone to learning popularity bias, which reduces personalization and leads to suboptimal recommendation quality. Graph Neural Networks (GNNs), while effective for CF due to their message passing mechanism, can further propagate and amplify popularity bias through their aggregation process. Existing approaches typically address popularity bias by modifying training objectives but fail to directly counteract the bias propagated during GNN's neighborhood aggregation. Applying weights to interactions during aggregation can help alleviate this problem, yet it risks distorting model learning due to unstable node representations in the early stages of training. In this paper, we propose a Post-hoc Popularity Debiasing (PPD) method that corrects for popularity bias in GNN-based CF and operates directly on pretrained embeddings without requiring retraining. By estimating interaction-level popularity and removing popularity components from node representations via a popularity direction vector, PPD reduces bias while preserving user preferences. Experimental results show that our method outperforms state-of-the-art approaches for popularity bias correction in GNN-based CF. CCS Concepts • Information systems → Recommender systems.
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 90281071-8c1b-41d0-9914-e0dbd49c7a68Cited by top-tier papers1
Ask how each one uses itBuilds on26
- 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
- Measuring and Relieving the Over-Smoothing Problem for Graph Neural Networks from the Topological ViewDeli Chen, Yankai Lin, Wei Li, Peng Li et al.AAAI 2020 · 1,353 citations
- Are Graph Augmentations Necessary?: Simple Graph Contrastive Learning for RecommendationJunliang Yu, Hongzhi Yin, Xin Xia, Tong Chen et al.SIGIR 2022 · 658 citations
- Disentangled Graph Collaborative FilteringXiang Wang, Hongye Jin, An Zhang, Xiangnan He et al.SIGIR 2020 · 621 citations
Related papers
- Adaptive Popularity Debiasing Aggregator for Graph Collaborative FilteringHuachi Zhou, Hao Chen, Junnan Dong, Daochen Zha et al.SIGIR 2023 · 28 citations
- Investigating Accuracy-Novelty Performance for Graph-based Collaborative FilteringMinghao Zhao, Le Wu, Yile Liang, Lei Chen et al.SIGIR 2022 · 70 citations
- Causal Intervention for Leveraging Popularity Bias in RecommendationYang Zhang, Fuli Feng, Xiangnan He, Tianxin Wei et al.SIGIR 2021 · 431 citations
- General Debiasing for Graph-based Collaborative Filtering via Adversarial Graph DropoutAn Zhang, Wenchang Ma, Pengbo Wei, Leheng Sheng et al.WWW 2024 · 21 citations
- CaDRec: Contextualized and Debiased Recommender ModelXinfeng Wang, Fumiyo Fukumoto, Jin Cui, Yoshimi Suzuki et al.SIGIR 2024 · 4 citations
