Contrastive Learning for Recommender System
Recommender systems, which analyze users' preference patterns to suggest potential targets, are indispensable in today's society. Collaborative Filtering (CF) is the most popular recommendation model. Specifically, Graph Neural Network (GNN) has become a new state-of-the-art for CF. In the GNN-based recommender system, message dropout is usually used to alleviate the selection bias in the user-item bipartite graph. However, message dropout might deteriorate the recommender system's performance due to the randomness of dropping out the outgoing messages based on the user-item bipartite graph. To solve this problem, we propose a graph contrastive learning module for a general recommender system that learns the embeddings in a self-supervised manner and reduces the randomness of message dropout. Besides, many recommender systems optimize models with pairwise ranking objectives, such as the Bayesian Pairwise Ranking (BPR) based on a negative sampling strategy. However, BPR has the following problems: suboptimal sampling and sample bias. We introduce a new debiased contrastive loss to solve these problems, which provides sufficient negative samples and applies a bias correction probability to alleviate the sample bias. We integrate the proposed framework, including graph contrastive module and debiased contrastive module with several Matrix Factorization(MF) and GNN-based recommendation models. Experimental results on three public benchmarks demonstrate the effectiveness of our framework.
Code (0)
등록된 구현이 없습니다.
Tasks
Collaborative FilteringContrastive LearningGraph Neural NetworkRecommendation SystemsSelection biasMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
RDGCL: Reaction-Diffusion Graph Contrastive Learning for Recommendation
Contrastive learning (CL) has emerged as a promising technique for improving recommender systems, addressing the challenge of data sparsity by using self-supervised signals from raw data. Integration of CL with graph con…
Contrastive LearningData IntegrationDiversityRecommendation SystemsContrastive Learning for Debiased Candidate Generation in Large-Scale Recommender Systems
Deep candidate generation (DCG) that narrows down the collection of relevant items from billions to hundreds via representation learning has become prevalent in industrial recommender systems. Standard approaches approxi…
Contrastive LearningFairnessLanguage ModelingLanguage Modelling+2Why Multi-Interest Fairness Matters: Hypergraph Contrastive Multi-Interest Learning for Fair Conversational Recommender System
Unfairness is a well-known challenge in Recommender Systems (RSs), often resulting in biased outcomes that disadvantage users or items based on attributes such as gender, race, age, or popularity. Although some approache…
Contrastive LearningFairnessRecommendation SystemsDebiased Contrastive Representation Learning for Mitigating Dual Biases in Recommender Systems
In recommender systems, popularity and conformity biases undermine recommender effectiveness by disproportionately favouring popular items, leading to their over-representation in recommendation lists and causing an unba…
Contrastive LearningDiversityRecommendation SystemsRepresentation LearningIntent-aware Recommendation via Disentangled Graph Contrastive Learning
Graph neural network (GNN) based recommender systems have become one of the mainstream trends due to the powerful learning ability from user behavior data. Understanding the user intents from behavior data is the key to …
Contrastive LearningGraph Neural NetworkRecommendation Systems