How Do Recommendation Models Amplify Popularity Bias? An Analysis from the Spectral Perspective
Siyi Lin, Chongming Gao, Jiawei Chen, Sheng Zhou, Binbin Hu, Yan Feng, Chun Chen, Can Wang
TL;DR
This work investigates why recommendation models amplify popularity bias when trained on long-tailed data. Using a spectral perspective, it reveals that item popularity is memorized in the principal spectrum of the predicted score matrix $\hat{\mathbf{Y}}$ and that dimension reduction magnifies this effect. The authors propose ReSN, a spectral-norm regularizer that directly penalizes the magnitude of the principal singular value with efficient approximations leveraging the low-rank structure $\mathbf{U}\mathbf{V}^{\top}$ and the popularity vector $\mathbf{r}$. The approach is supported by theoretical bounds and extensive experiments on seven real-world datasets showing improved fairness-accuracy trade-offs with minimal computational overhead. Overall, ReSN provides a scalable, model-agnostic tool for mitigating popularity bias in embedding-based recommender systems by targeting the dominant spectral component of predictions.
Abstract
Recommendation Systems (RS) are often plagued by popularity bias. When training a recommendation model on a typically long-tailed dataset, the model tends to not only inherit this bias but often exacerbate it, resulting in over-representation of popular items in the recommendation lists. This study conducts comprehensive empirical and theoretical analyses to expose the root causes of this phenomenon, yielding two core insights: 1) Item popularity is memorized in the principal spectrum of the score matrix predicted by the recommendation model; 2) The dimension collapse phenomenon amplifies the relative prominence of the principal spectrum, thereby intensifying the popularity bias. Building on these insights, we propose a novel debiasing strategy that leverages a spectral norm regularizer to penalize the magnitude of the principal singular value. We have developed an efficient algorithm to expedite the calculation of the spectral norm by exploiting the spectral property of the score matrix. Extensive experiments across seven real-world datasets and three testing paradigms have been conducted to validate the superiority of the proposed method.
