Counterfactual Inference for Eliminating Sentiment Bias in Recommender Systems

• URL: http://arxiv.org/abs/2505.03655v1
• Date: Tue, 06 May 2025 16:00:41 GMT
• Title: Counterfactual Inference for Eliminating Sentiment Bias in Recommender Systems
• Authors: Le Pan, Yuanjiang Cao, Chengkai Huang, Wenjie Zhang, Lina Yao,
• Abstract summary: A newly discovered bias, known as sentiment bias, uncovers a common phenomenon within Review-based RSs.<n>We study this problem from the perspective of counterfactual inference with two stages.<n>To the best of our knowledge, this is the first work to employ counterfactual inference on sentiment bias mitigation in RSs.
• Score: 15.453331775372908
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Recommender Systems (RSs) aim to provide personalized recommendations for users. A newly discovered bias, known as sentiment bias, uncovers a common phenomenon within Review-based RSs (RRSs): the recommendation accuracy of users or items with negative reviews deteriorates compared with users or items with positive reviews. Critical users and niche items are disadvantaged by such unfair recommendations. We study this problem from the perspective of counterfactual inference with two stages. At the model training stage, we build a causal graph and model how sentiment influences the final rating score. During the inference stage, we decouple the direct and indirect effects to mitigate the impact of sentiment bias and remove the indirect effect using counterfactual inference. We have conducted extensive experiments, and the results validate that our model can achieve comparable performance on rating prediction for better recommendations and effective mitigation of sentiment bias. To the best of our knowledge, this is the first work to employ counterfactual inference on sentiment bias mitigation in RSs.

Related papers

• Pairwise or Pointwise? Evaluating Feedback Protocols for Bias in LLM-Based Evaluation [57.380464382910375]
  We show that the choice of feedback protocol can significantly affect evaluation reliability and induce systematic biases.<n>In particular, we show that pairwise evaluation protocols are more vulnerable to distracted evaluation.
  arXiv  Detail & Related papers  (2025-04-20T19:05:59Z)
• Correcting for Popularity Bias in Recommender Systems via Item Loss Equalization [1.7771454131646311]
  A small set of popular items dominate the recommendation results due to their high interaction rates. This phenomenon disproportionately benefits users with mainstream tastes while neglecting those with niche interests. We propose an in-processing approach to address this issue by intervening in the training process of recommendation models.
  arXiv  Detail & Related papers  (2024-10-07T08:34:18Z)
• Measuring Recency Bias In Sequential Recommendation Systems [4.797371814812293]
  Recency bias in a sequential recommendation system refers to the overly high emphasis placed on recent items within a user session. This bias can diminish the serendipity of recommendations and hinder the system's ability to capture users' long-term interests. We propose a simple yet effective novel metric specifically designed to quantify recency bias.
  arXiv  Detail & Related papers  (2024-09-15T13:02:50Z)
• Causal Distillation for Alleviating Performance Heterogeneity in Recommender Systems [142.3424649008479]
  We show the uneven distribution of historical interactions and the biased training of recommender models. The key to debiased training lies in eliminating the effect of confounders that influence both the user's historical behaviors and the next behavior. We propose a causal multi-teacher distillation framework (CausalD) to address unobserved confounders.
  arXiv  Detail & Related papers  (2024-05-31T05:31:00Z)
• 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)
• 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)
• Correcting the User Feedback-Loop Bias for Recommendation Systems [34.44834423714441]
  We propose a systematic and dynamic way to correct user feedback-loop bias in recommendation systems. Our method includes a deep-learning component to learn each user's dynamic rating history embedding. We empirically validated the existence of such user feedback-loop bias in real world recommendation systems.
  arXiv  Detail & Related papers  (2021-09-13T15:02:55Z)
• Online Evaluation Methods for the Causal Effect of Recommendations [0.20305676256390934]
  We propose the first interleaving methods that can efficiently compare recommendation models in terms of causal effects. We measure the outcomes of both items on an interleaved list and items not on the interleaved list, since the causal effect is the difference between outcomes with and without recommendations. We then verify the unbiasedness and efficiency of online evaluation methods through simulated online experiments.
  arXiv  Detail & Related papers  (2021-07-14T12:12:59Z)
• Probabilistic and Variational Recommendation Denoising [56.879165033014026]
  Learning from implicit feedback is one of the most common cases in the application of recommender systems. We propose probabilistic and variational recommendation denoising for implicit feedback. We employ the proposed DPI and DVAE on four state-of-the-art recommendation models and conduct experiments on three datasets.
  arXiv  Detail & Related papers  (2021-05-20T08:59:44Z)

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.