On Inherited Popularity Bias in Cold-Start Item Recommendation

• URL: http://arxiv.org/abs/2510.11402v1
• Date: Mon, 13 Oct 2025 13:44:13 GMT
• Title: On Inherited Popularity Bias in Cold-Start Item Recommendation
• Authors: Gregor Meehan, Johan Pauwels,
• Abstract summary: Collaborative filtering (CF) recommender systems struggle with making predictions on unseen, or 'cold', items.<n>We show that cold-start systems can inherit popularity bias, a common cause of recommender system unfairness.
• Score: 5.958603849321135
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Collaborative filtering (CF) recommender systems struggle with making predictions on unseen, or 'cold', items. Systems designed to address this challenge are often trained with supervision from warm CF models in order to leverage collaborative and content information from the available interaction data. However, since they learn to replicate the behavior of CF methods, cold-start models may therefore also learn to imitate their predictive biases. In this paper, we show that cold-start systems can inherit popularity bias, a common cause of recommender system unfairness arising when CF models overfit to more popular items, thereby maximizing user-oriented accuracy but neglecting rarer items. We demonstrate that cold-start recommenders not only mirror the popularity biases of warm models, but are in fact affected more severely: because they cannot infer popularity from interaction data, they instead attempt to estimate it based solely on content features. This leads to significant over-prediction of certain cold items with similar content to popular warm items, even if their ground truth popularity is very low. Through experiments on three multimedia datasets, we analyze the impact of this behavior on three generative cold-start methods. We then describe a simple post-processing bias mitigation method that, by using embedding magnitude as a proxy for predicted popularity, can produce more balanced recommendations with limited harm to user-oriented cold-start accuracy.

Related papers

• The Unfairness of Multifactorial Bias in Recommendation [68.35079031029616]
  Popularity bias and positivity bias are prominent sources of bias in recommender systems.<n>In this work, we examine how multifactorial bias influences item-side fairness.<n>We adapt a percentile-based rating transformation as a pre-processing strategy to mitigate multifactorial bias.
  arXiv  Detail & Related papers  (2026-01-19T08:37:43Z)
• Opening the Black Box: Interpretable Remedies for Popularity Bias in Recommender Systems [1.8692254863855962]
  Popularity bias is a well-known challenge in recommender systems, where a small number of popular items receive disproportionate attention.<n>This imbalance often results in reduced recommendation quality and unfair exposure of items.<n>We propose a post-hoc method using a Sparse Autoencoder to interpret and mitigate popularity bias in deep recommendation models.
  arXiv  Detail & Related papers  (2025-08-24T10:59:56Z)
• Bake Two Cakes with One Oven: RL for Defusing Popularity Bias and Cold-start in Third-Party Library Recommendations [5.874782446136913]
  Third-party libraries (TPLs) have become an integral part of modern software development, enhancing developer productivity and accelerating time-to-market.<n>They typically rely on collaborative filtering (CF) that exploits a two-dimensional project-library matrix (user-item in general context of recommendation) when making recommendations.<n>We propose a reinforcement learning (RL)-based approach to address popularity bias and the cold-start problem in TPL recommendation.
  arXiv  Detail & Related papers  (2025-04-18T16:17:20Z)
• Finding Interest Needle in Popularity Haystack: Improving Retrieval by Modeling Item Exposure [8.3095709445007]
  We introduce an exposure-aware retrieval scoring approach, which explicitly models item exposure probability and adjusts retrieval-stage ranking at inference time.<n>We validate our approach through online A/B experiments in a real-world video recommendation system, demonstrating a 25% increase in uniquely retrieved items and a 40% reduction in the dominance of over-popular content.<n>Our results establish a scalable, deployable solution for mitigating popularity bias at the retrieval stage, offering a new paradigm for bias-aware personalization.
  arXiv  Detail & Related papers  (2025-03-31T00:04:01Z)
• Online Item Cold-Start Recommendation with Popularity-Aware Meta-Learning [14.83192161148111]
  We propose a model-agnostic recommendation algorithm called Popularity-Aware Meta-learning (PAM)<n>PAM divides incoming data into different meta-learning tasks by predefined item popularity thresholds.<n>It can distinguish and reweight behavior-related and content-related features in each task based on their different roles in different popularity levels.
  arXiv  Detail & Related papers  (2024-11-18T01:30:34Z)
• A First Look at Selection Bias in Preference Elicitation for Recommendation [64.44255178199846]
  We study the effect of selection bias in preference elicitation on the resulting recommendations. A big hurdle is the lack of any publicly available dataset that has preference elicitation interactions. We propose a simulation of a topic-based preference elicitation process.
  arXiv  Detail & Related papers  (2024-05-01T14:56:56Z)
• Going Beyond Popularity and Positivity Bias: Correcting for Multifactorial Bias in Recommender Systems [74.47680026838128]
  Two typical forms of bias in user interaction data with recommender systems (RSs) are popularity bias and positivity bias. We consider multifactorial selection bias affected by both item and rating value factors. We propose smoothing and alternating gradient descent techniques to reduce variance and improve the robustness of its optimization.
  arXiv  Detail & Related papers  (2024-04-29T12:18:21Z)
• Robust Collaborative Filtering to Popularity Distribution Shift [56.78171423428719]
  We present a simple yet effective debiasing strategy, PopGo, which quantifies and reduces the interaction-wise popularity shortcut without assumptions on the test data. On both ID and OOD test sets, PopGo achieves significant gains over the state-of-the-art debiasing strategies.
  arXiv  Detail & Related papers  (2023-10-16T04:20:52Z)
• Cold & Warm Net: Addressing Cold-Start Users in Recommender Systems [10.133475523630139]
  Cold-start recommendation is one of the major challenges faced by recommender systems (RS) In this paper, we propose Cold & Warm Net based on expert models who are responsible for modeling cold-start and warm-up users respectively. The proposed model has also been deployed on an industrial short video platform and achieves a significant increase in app dwell time and user retention rate.
  arXiv  Detail & Related papers  (2023-09-27T13:31:43Z)
• Cross Pairwise Ranking for Unbiased Item Recommendation [57.71258289870123]
  We develop a new learning paradigm named Cross Pairwise Ranking (CPR) CPR achieves unbiased recommendation without knowing the exposure mechanism. We prove in theory that this way offsets the influence of user/item propensity on the learning.
  arXiv  Detail & Related papers  (2022-04-26T09:20:27Z)
• Learning to Learn a Cold-start Sequential Recommender [70.5692886883067]
  The cold-start recommendation is an urgent problem in contemporary online applications. We propose a meta-learning based cold-start sequential recommendation framework called metaCSR. metaCSR holds the ability to learn the common patterns from regular users' behaviors.
  arXiv  Detail & Related papers  (2021-10-18T08:11:24Z)
• Privileged Graph Distillation for Cold Start Recommendation [57.918041397089254]
  The cold start problem in recommender systems requires recommending to new users (items) based on attributes without any historical interaction records. We propose a privileged graph distillation model(PGD) Our proposed model is generally applicable to different cold start scenarios with new user, new item, or new user-new item.
  arXiv  Detail & Related papers  (2021-05-31T14:05:27Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.