Debiasing Message Passing to Mitigate Popularity Bias in GNN-based Collaborative Filtering
Not on the map. Why?
Abstract (arXiv)
Collaborative filtering (CF) models based on graph neural networks (GNNs) achieve strong performance in recommender systems by propagating user-item signals over interaction graphs. However, they are susceptible to popularity bias, since skewed interactions and repeated message passing across high-order neighborhoods amplify the influence of popular items while suppressing long-tail ones. Existing debiasing approaches, including re-weighting objectives, regularization, causal methods, and post-processing, are less effective in GNN-based settings because they do not directly counteract bias propagated through the aggregation process, and recent in-aggregation weighting methods often rely on static heuristics or unstable embedding estimates. We propose Debiasing Popularity Amplification in Aggregation (DPAA), a popularity debiasing framework for GNN-based CF that integrates adaptive, representation-aware interaction weighting and layer-wise weighting directly into message passing. DPAA assigns interaction-level weights from a representation-based popularity signal, stabilized by a smooth transition from pre-trained to evolving model embeddings during training. It further introduces a layer-wise weighting that amplifies higher-order neighborhoods, surfacing long-range interactions with diverse and underexposed items. Experiments on real-world and semi-synthetic datasets show that DPAA outperforms state-of-the-art popularity bias correction methods for GNN-based CF.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 48 of its 86 references that are in the map. First posted on arXiv 11 May 2026.
Builds on
48 of 86 references.
References · 48
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Graph Attention Networkscited by 8,854
- 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,085
- 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,134
- 2017Neural Collaborative Filteringcited by 1,108
- 2020Simple and Deep Graph Convolutional Networkscited by 857
- 2019Neural Graph Collaborative Filteringcited by 660
- 2019Measuring and Relieving the Over-smoothing Problem for Graph Neural Networks from the Topological Viewcited by 544
- 2020Self-supervised Graph Learning for Recommendationcited by 305
- 2016Recommendations as Treatments: Debiasing Learning and Evaluationcited by 246
- 2020Bias and Debias in Recommender System: A Survey and Future Directionscited by 239
- 2021Are Graph Augmentations Necessary? Simple Graph Contrastive Learning for Recommendationcited by 173
36 more
- 2016Unbiased Learning-to-Rank with Biased Feedbackcited by 155
- 2020Disentangled Graph Collaborative Filteringcited by 118
- 2017How Algorithmic Confounding in Recommendation Systems Increases Homogeneity and Decreases Utilitycited by 116
- 2021Causal Intervention for Leveraging Popularity Bias in Recommendationcited by 116
- 2020The Early Phase of Neural Network Trainingcited by 114
- 2020Model-Agnostic Counterfactual Reasoning for Eliminating Popularity Bias in Recommender Systemcited by 94
- 2022KuaiRec: A Fully-observed Dataset and Insights for Evaluating Recommender Systemscited by 94
- 2017Beyond Parity: Fairness Objectives for Collaborative Filteringcited by 93
- 2021UltraGCN: Ultra Simplification of Graph Convolutional Networks for Recommendationcited by 87
- 2022Improving Graph Collaborative Filtering with Neighborhood-enriched Contrastive Learningcited by 86
- 2019Managing Popularity Bias in Recommender Systems with Personalized Re-rankingcited by 81
- 2017Causal Embeddings for Recommendationcited by 79
- 2018Unbiased Learning to Rank with Unbiased Propensity Estimationcited by 61
- 2022Towards Representation Alignment and Uniformity in Collaborative Filteringcited by 57
- 2022XSimGCL: Towards Extremely Simple Graph Contrastive Learning for Recommendationcited by 57
- 2021Deconfounded Recommendation for Alleviating Bias Amplificationcited by 51
- 2021Interest-aware Message-Passing GCN for Recommendationcited by 39
- 2021Double-Scale Self-Supervised Hypergraph Learning for Group Recommendationcited by 32
- 2020ESAM: Discriminative Domain Adaptation with Non-Displayed Items to Improve Long-Tail Performancecited by 30
- 2020Information Theoretic Counterfactual Learning from Missing-Not-At-Random Feedbackcited by 30
- 2022Incorporating Bias-aware Margins into Contrastive Loss for Collaborative Filteringcited by 29
- 2023Empowering Collaborative Filtering with Principled Adversarial Contrastive Losscited by 24
- 2021Popularity Bias Is Not Always Evil: Disentangling Benign and Harmful Bias for Recommendationcited by 23
- 2024How Do Recommendation Models Amplify Popularity Bias? An Analysis from the Spectral Perspectivecited by 21
- 2022SVD-GCN: A Simplified Graph Convolution Paradigm for Recommendationcited by 16
- 2021Pre-training Graph Neural Network for Cross Domain Recommendationcited by 14
- 2020Connecting User and Item Perspectives in Popularity Debiasing for Collaborative Recommendationcited by 12
- 2022Empowering Long-tail Item Recommendation through Cross Decoupling Network (CDN)cited by 12
- 2022Quantifying and Mitigating Popularity Bias in Conversational Recommender Systemscited by 11
- 2024Graph Representation Learning via Causal Diffusion for Out-of-Distribution Recommendationcited by 11
- 2023How Graph Convolutions Amplify Popularity Bias for Recommendation?cited by 10
- 2024Debiasing Recommendation with Personal Popularitycited by 7
- 2025Distributionally Robust Graph Out-of-Distribution Recommendation via Diffusion Modelcited by 7
- 2022Debiasing Neighbor Aggregation for Graph Neural Network in Recommender Systemscited by 6
- 2022Model-based Unbiased Learning to Rankcited by 5
- 2023Popularity Debiasing from Exposure to Interaction in Collaborative Filteringcited by 4
Built on by
Not cited yet.