Cross Pairwise Ranking for Unbiased Item Recommendation
Qi Wan, Xiangnan He, Xiang Wang, Jiancan Wu, Wei Guo, Ruiming Tang

TL;DR
This paper introduces Cross Pairwise Ranking (CPR), a novel unbiased learning paradigm for recommender systems that mitigates exposure bias without requiring known propensity scores, improving recommendation fairness and efficiency.
Contribution
The paper proposes CPR, a new loss-based approach that offsets data biases in recommendation models without relying on exposure mechanism knowledge, outperforming existing debiasing methods.
Findings
CPR achieves unbiased recommendation without exposure mechanism knowledge.
CPR outperforms state-of-the-art debiasing methods in accuracy.
CPR improves training efficiency and model generalization.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRecommender Systems and Techniques · Advanced Bandit Algorithms Research · Text and Document Classification Technologies
