Popularity-Aware Alignment and Contrast for Mitigating Popularity Bias

• URL: http://arxiv.org/abs/2405.20718v2
• Date: Tue, 11 Jun 2024 09:29:46 GMT
• Title: Popularity-Aware Alignment and Contrast for Mitigating Popularity Bias
• Authors: Miaomiao Cai, Lei Chen, Yifan Wang, Haoyue Bai, Peijie Sun, Le Wu, Min Zhang, Meng Wang,
• Abstract summary: Collaborative Filtering (CF) typically suffers from the challenge of popularity bias due to the uneven distribution of items in real-world datasets. This bias leads to a significant accuracy gap between popular and unpopular items. We propose Popularity-Aware Alignment and Contrast (PAAC) to address two challenges.
• Score: 34.006766098392525
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Collaborative Filtering (CF) typically suffers from the significant challenge of popularity bias due to the uneven distribution of items in real-world datasets. This bias leads to a significant accuracy gap between popular and unpopular items. It not only hinders accurate user preference understanding but also exacerbates the Matthew effect in recommendation systems. To alleviate popularity bias, existing efforts focus on emphasizing unpopular items or separating the correlation between item representations and their popularity. Despite the effectiveness, existing works still face two persistent challenges: (1) how to extract common supervision signals from popular items to improve the unpopular item representations, and (2) how to alleviate the representation separation caused by popularity bias. In this work, we conduct an empirical analysis of popularity bias and propose Popularity-Aware Alignment and Contrast (PAAC) to address two challenges. Specifically, we use the common supervisory signals modeled in popular item representations and propose a novel popularity-aware supervised alignment module to learn unpopular item representations. Additionally, we suggest re-weighting the contrastive learning loss to mitigate the representation separation from a popularity-centric perspective. Finally, we validate the effectiveness and rationale of PAAC in mitigating popularity bias through extensive experiments on three real-world datasets. Our code is available at https://github.com/miaomiao-cai2/KDD2024-PAAC.

Related papers

• Large Language Models as Recommender Systems: A Study of Popularity Bias [46.17953988777199]
  Popular items are disproportionately recommended, overshadowing less popular but potentially relevant items. Recent advancements have seen the integration of general-purpose Large Language Models into recommender systems. Our study explores whether LLMs contribute to or can alleviate popularity bias in recommender systems.
  arXiv  Detail & Related papers  (2024-06-03T12:53:37Z)
• 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)
• Test Time Embedding Normalization for Popularity Bias Mitigation [6.145760252113906]
  Popularity bias is a widespread problem in the field of recommender systems. We propose 'Test Time Embedding Normalization' as a simple yet effective strategy for mitigating popularity bias.
  arXiv  Detail & Related papers  (2023-08-22T08:57:44Z)
• Whole Page Unbiased Learning to Rank [59.52040055543542]
  Unbiased Learning to Rank(ULTR) algorithms are proposed to learn an unbiased ranking model with biased click data. We propose a Bias Agnostic whole-page unbiased Learning to rank algorithm, named BAL, to automatically find the user behavior model. Experimental results on a real-world dataset verify the effectiveness of the BAL.
  arXiv  Detail & Related papers  (2022-10-19T16:53:08Z)
• Causal Intervention for Fairness in Multi-behavior Recommendation [40.938727601434195]
  We argue that the relationships between different user behaviors (e.g., conversion rate) actually reflect the item quality. To handle the unfairness issues, we propose to mitigate the popularity bias by considering multiple user behaviors.
  arXiv  Detail & Related papers  (2022-09-10T04:21:25Z)
• Reconciling the Quality vs Popularity Dichotomy in Online Cultural Markets [62.146882023375746]
  We propose a model of an idealized online cultural market in which $N$ items, endowed with a hidden quality metric, are recommended to users by a ranking algorithm possibly biased by the current items' popularity. Our goal is to better understand the underlying mechanisms of the well-known fact that popularity bias can prevent higher-quality items from becoming more popular than lower-quality items, producing an undesirable misalignment between quality and popularity rankings.
  arXiv  Detail & Related papers  (2022-04-28T14:36:11Z)
• 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)
• The Unfairness of Popularity Bias in Book Recommendation [0.0]
  Popularity bias refers to the problem that popular items are recommended frequently while less popular items are recommended rarely or not at all. We analyze the well-known Book-Crossing dataset and define three user groups based on their tendency towards popular items. Our results indicate that most state-of-the-art recommendation algorithms suffer from popularity bias in the book domain.
  arXiv  Detail & Related papers  (2022-02-27T20:21:46Z)
• An Adaptive Boosting Technique to Mitigate Popularity Bias in Recommender System [1.5800354337004194]
  A typical accuracy measure is biased towards popular items, i.e., it promotes better accuracy for popular items compared to non-popular items. This paper considers a metric that measures the popularity bias as the difference in error on popular items and non-popular items. Motivated by the fair boosting algorithm on classification, we propose an algorithm that reduces the popularity bias present in the data.
  arXiv  Detail & Related papers  (2021-09-13T03:04:55Z)
• User-centered Evaluation of Popularity Bias in Recommender Systems [4.30484058393522]
  Recommendation and ranking systems suffer from popularity bias; the tendency of the algorithm to favor a few popular items while under-representing the majority of other items. In this paper, we show the limitations of the existing metrics to evaluate popularity bias mitigation when we want to assess these algorithms from the users' perspective. We present an effective approach that mitigates popularity bias from the user-centered point of view.
  arXiv  Detail & Related papers  (2021-03-10T22:12:51Z)

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.