论文标题
公正项目推荐的跨成对排名
Cross Pairwise Ranking for Unbiased Item Recommendation
论文作者
论文摘要
大多数推荐系统在观察到的相互作用数据上优化了模型,该模型受到先前的暴露机制的影响,并表现出许多偏见,例如受欢迎程度偏见。损失函数(例如大多数使用的二进制二进制跨透镜和成对的贝叶斯个性化排名)并非旨在考虑观察到的数据中的偏见。结果,对损失进行优化的模型将继承数据偏见,甚至更糟,会扩大偏见。例如,一些受欢迎的物品占用越来越多的曝光机会,严重伤害了利基市场的建议质量 - 称为臭名昭著的Mathew效果。在这项工作中,我们开发了一个名为Cross成对排名(CPR)的新学习范式,该范式在不知道暴露机制的情况下实现了无偏见的建议。不同于反向倾向评分(IPS),我们改变了样本的损失项 - 我们创新地对多个观察到的相互作用进行了创新,并形成损失作为其预测的组合。从理论上讲,我们证明,这种方式抵消了用户/项目倾向对学习的影响,从而消除了由暴露机制引起的数据偏见的影响。对于IPS来说,我们提出的CPR可确保每个培训实例的无偏学习,而无需设定倾向分数。实验结果表明,在模型概括和训练效率中,CPR比最先进的词汇解决方案具有优势。这些代码可在https://github.com/qcactus/cpr上找到。
Most recommender systems optimize the model on observed interaction data, which is affected by the previous exposure mechanism and exhibits many biases like popularity bias. The loss functions, such as the mostly used pointwise Binary Cross-Entropy and pairwise Bayesian Personalized Ranking, are not designed to consider the biases in observed data. As a result, the model optimized on the loss would inherit the data biases, or even worse, amplify the biases. For example, a few popular items take up more and more exposure opportunities, severely hurting the recommendation quality on niche items -- known as the notorious Mathew effect. In this work, we develop a new learning paradigm named Cross Pairwise Ranking (CPR) that achieves unbiased recommendation without knowing the exposure mechanism. Distinct from inverse propensity scoring (IPS), we change the loss term of a sample -- we innovatively sample multiple observed interactions once and form the loss as the combination of their predictions. We prove in theory that this way offsets the influence of user/item propensity on the learning, removing the influence of data biases caused by the exposure mechanism. Advantageous to IPS, our proposed CPR ensures unbiased learning for each training instance without the need of setting the propensity scores. Experimental results demonstrate the superiority of CPR over state-of-the-art debiasing solutions in both model generalization and training efficiency. The codes are available at https://github.com/Qcactus/CPR.