Path-Enhanced Contrastive Learning for Recommendation
Haoran Sun, Fei Xiong, Yuanzhe Hu, Liang Wang
Abstract
Collaborative filtering (CF) methods are now facing the challenge of data sparsity in recommender systems. In order to reduce the effect of data sparsity, researchers proposed contrastive learning methods to extract self-supervised signals from raw data. Contrastive learning methods address this problem by graph augmentation and maximizing the consistency of node representations between different augmented graphs. However, these methods tends to unintentionally distance the target node from its path nodes on the interaction path, thus limiting its effectiveness. In this regard, we propose a solution that uses paths as samples in the contrastive loss function. In order to obtain the path samples, we design a path sampling method. In addition to the contrast of the relationship between the target node and the nodes within the path (intra-path contrast), we also designed a method of contrasting the relationship between the paths (inter-path contrast) to better pull the target node and its path nodes closer to each other. We use Simplifying and Powering Graph Convolution Network (LightGCN) as the basis and combine with a new path-enhanced graph approach proposed for graph augmentation. It effectively improves the performance of recommendation models. Our proposed Path Enhanced Contrastive Loss (PECL) model replaces the common contrastive loss function with our novel loss function, showing significant performance improvement. Experiments on three real-world datasets demonstrate the effectiveness of our model.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 0b449d88-287e-4da7-bc5c-6883dac5e5e9Builds on15
- A Simple Framework for Contrastive Learning of Visual RepresentationsTing Chen, Simon Kornblith, Mohammad Norouzi, Geoffrey E. HintonICML 2020 · 24,064 citations
- Bootstrap Your Own Latent - A New Approach to Self-Supervised LearningJean-Bastien Grill, Florian Strub, Florent Altché, Corentin Tallec et al.NeurIPS 2020 · 9,171 citations
- Unsupervised Learning of Visual Features by Contrasting Cluster AssignmentsMathilde Caron, Ishan Misra, Julien Mairal, Priya Goyal et al.NeurIPS 2020 · 5,249 citations
- LightGCN: Simplifying and Powering Graph Convolution Network for RecommendationXiangnan He, Kuan Deng, Xiang Wang, Yan Li et al.SIGIR 2020 · 4,448 citations
- Self-supervised Graph Learning for RecommendationJiancan Wu, Xiang Wang, Fuli Feng, Xiangnan He et al.SIGIR 2021 · 1,476 citations
Related papers
- Unveiling Contrastive Learning's Capability of Neighborhood Aggregation for Collaborative FilteringYu Zhang, Yiwen Zhang, Yi Zhang, Lei Sang et al.SIGIR 2025 · 19 citations
- LightGCL: Simple Yet Effective Graph Contrastive Learning for RecommendationXuheng Cai, Chao Huang, Lianghao Xia, Xubin RenICLR 2023 · 99 citations
- Automated Self-Supervised Learning for RecommendationLianghao Xia, Chao Huang, Chunzhen Huang, Kangyi Lin et al.WWW 2023 · 141 citations
- Improving Graph Collaborative Filtering with Neighborhood-enriched Contrastive LearningZihan Lin, Changxin Tian, Yupeng Hou, Wayne Xin ZhaoWWW 2022 · 606 citations
- Meta-optimized Structural and Semantic Contrastive Learning for Graph Collaborative FilteringYongjing Hao, Pengpeng Zhao, Jianfeng Qu, Lei Zhao et al.ICDE 2024 · 1 citation
