论文标题
模型不合时宜的反事实推理,以消除推荐系统中的受欢迎程度偏见
Model-Agnostic Counterfactual Reasoning for Eliminating Popularity Bias in Recommender System
论文作者
论文摘要
推荐系统的总体目的是向用户提供个性化建议,这与建议流行物品相反。但是,正常的培训范式,即适合推荐模型,以旋转或成对损失恢复用户行为数据,使该模型偏向流行项目。这导致了马修效应可怕的效果,因此更频繁地推荐流行物品,并变得更加受欢迎。现有工作通过反向倾向加权(IPW)解决了这一问题,这降低了流行项目对培训的影响并增加了长尾项目的影响。尽管从理论上讲是合理的,但IPW方法对加权策略高度敏感,众所周知,这很难调节。在这项工作中,我们从新颖而基本的角度探索了普及偏见问题 - 原因效应。我们确定受欢迎程度的偏见在于从项目节点到排名分数的直接效果,因此项目的内在属性是错误分配其排名得分更高的原因。为了消除流行性偏见,必须回答反事实问题,即如果模型仅使用项目属性,排名得分将是多少。为此,我们制定了一个因果图,以描述建议过程中重要的原因效应关系。在培训期间,我们进行多任务学习以实现每个原因的贡献;在测试过程中,我们执行反事实推断,以消除项目流行的效果。值得注意的是,我们的解决方案修改了推荐的学习过程,该过程对广泛的模型不可知 - 可以在现有方法中轻松实施。我们在基质分解(MF)和LightGCN [20]上证明了这一点。五个现实世界数据集的实验证明了我们方法的有效性。
The general aim of the recommender system is to provide personalized suggestions to users, which is opposed to suggesting popular items. However, the normal training paradigm, i.e., fitting a recommender model to recover the user behavior data with pointwise or pairwise loss, makes the model biased towards popular items. This results in the terrible Matthew effect, making popular items be more frequently recommended and become even more popular. Existing work addresses this issue with Inverse Propensity Weighting (IPW), which decreases the impact of popular items on the training and increases the impact of long-tail items. Although theoretically sound, IPW methods are highly sensitive to the weighting strategy, which is notoriously difficult to tune. In this work, we explore the popularity bias issue from a novel and fundamental perspective -- cause-effect. We identify that popularity bias lies in the direct effect from the item node to the ranking score, such that an item's intrinsic property is the cause of mistakenly assigning it a higher ranking score. To eliminate popularity bias, it is essential to answer the counterfactual question that what the ranking score would be if the model only uses item property. To this end, we formulate a causal graph to describe the important cause-effect relations in the recommendation process. During training, we perform multi-task learning to achieve the contribution of each cause; during testing, we perform counterfactual inference to remove the effect of item popularity. Remarkably, our solution amends the learning process of recommendation which is agnostic to a wide range of models -- it can be easily implemented in existing methods. We demonstrate it on Matrix Factorization (MF) and LightGCN [20]. Experiments on five real-world datasets demonstrate the effectiveness of our method.