Mitigating Popularity Bias in Recommendation with Unbalanced Interactions: A Gradient Perspective
Not on the map. Why?
Abstract (arXiv)
Recommender systems learn from historical user-item interactions to identify preferred items for target users. These observed interactions are usually unbalanced following a long-tailed distribution. Such long-tailed data lead to popularity bias to recommend popular but not personalized items to users. We present a gradient perspective to understand two negative impacts of popularity bias in recommendation model optimization: (i) the gradient direction of popular item embeddings is closer to that of positive interactions, and (ii) the magnitude of positive gradient for popular items are much greater than that of unpopular items. To address these issues, we propose a simple yet efficient framework to mitigate popularity bias from a gradient perspective. Specifically, we first normalize each user embedding and record accumulated gradients of users and items via popularity bias measures in model training. To address the popularity bias issues, we develop a gradient-based embedding adjustment approach used in model testing. This strategy is generic, model-agnostic, and can be seamlessly integrated into most existing recommender systems. Our extensive experiments on two classic recommendation models and four real-world datasets demonstrate the effectiveness of our method over state-of-the-art debiasing baselines.
Key facts. Cited by 11 papers in the map (data through 14 Oct 2026). First posted on arXiv 31 Oct 2022.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 5; 2024: 2; 2025: 1; 2026: 2.
11 papers.
- 2022TopoImb: Toward Topology-level Imbalance in Learning from Graphscited by 12
- 2023Faithful and Consistent Graph Neural Network Explanations with Rationale Alignmentcited by 6
- 2023Test Time Embedding Normalization for Popularity Bias Mitigationcited by 4
- 2024Disambiguated Node Classification with Graph Neural Networkscited by 4
- 2024Multi-source Unsupervised Domain Adaptation on Graphs with Transferability Modelingcited by 4
- 2023Graph Relation Aware Continual Learningcited by 3
- 2023T-SaS: Toward Shift-aware Dynamic Adaptation for Streaming Datacited by 3
- 2026Echoes in Filter Bubble: Diagnosing and Curing Popularity Bias in Generative Recommenderscited by 2
- 2023Interpretable Imitation Learning with Dynamic Causal Relationscited by 0
- 2025PBiLoss: Popularity-Aware Regularization to Improve Fairness in Graph-Based Recommender Systemscited by 0
- 2026Aligning Recommendations with User Popularity Preferencescited by 0
- 2026Echoes in Filter Bubble: Diagnosing and Curing Popularity Bias in Generative Recommenders16 May 2026
- 2026Aligning Recommendations with User Popularity Preferences1 Apr 2026
- 2025PBiLoss: Popularity-Aware Regularization to Improve Fairness in Graph-Based Recommender Systems25 Jul 2025
- 2024Multi-source Unsupervised Domain Adaptation on Graphs with Transferability Modeling14 Jun 2024
- 2024Disambiguated Node Classification with Graph Neural Networks13 Feb 2024
- 2023Interpretable Imitation Learning with Dynamic Causal Relations30 Sep 2023
- 2023T-SaS: Toward Shift-aware Dynamic Adaptation for Streaming Data5 Sep 2023
- 2023Test Time Embedding Normalization for Popularity Bias Mitigation22 Aug 2023
- 2023Graph Relation Aware Continual Learning16 Aug 2023
- 2023Faithful and Consistent Graph Neural Network Explanations with Rationale Alignment7 Jan 2023
- 2022TopoImb: Toward Topology-level Imbalance in Learning from Graphs16 Dec 2022