mlsanityData to 7 Oct 2026

Neighborhood-Enhanced Supervised Contrastive Learning for Collaborative Filtering

arXiv 2402.11523 ↗First posted 18 Feb 2024cs.IR cs.AIcited by 10

Not on the map. Why?

Abstract (arXiv)

While effective in recommendation tasks, collaborative filtering (CF) techniques face the challenge of data sparsity. Researchers have begun leveraging contrastive learning to introduce additional self-supervised signals to address this. However, this approach often unintentionally distances the target user/item from their collaborative neighbors, limiting its efficacy. In response, we propose a solution that treats the collaborative neighbors of the anchor node as positive samples within the final objective loss function. This paper focuses on developing two unique supervised contrastive loss functions that effectively combine supervision signals with contrastive loss. We analyze our proposed loss functions through the gradient lens, demonstrating that different positive samples simultaneously influence updating the anchor node's embeddings. These samples' impact depends on their similarities to the anchor node and the negative samples. Using the graph-based collaborative filtering model as our backbone and following the same data augmentation methods as the existing contrastive learning model SGL, we effectively enhance the performance of the recommendation model. Our proposed Neighborhood-Enhanced Supervised Contrastive Loss (NESCL) model substitutes the contrastive loss function in SGL with our novel loss function, showing marked performance improvement. On three real-world datasets, Yelp2018, Gowalla, and Amazon-Book, our model surpasses the original SGL by 10.09%, 7.09%, and 35.36% on NDCG@20, respectively.

Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 43 of its 61 references that are in the map. First posted on arXiv 18 Feb 2024.

Builds on

43 of 61 references.

References · 43

  1. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
  2. 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,482
  3. 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,712
  4. 2020Unsupervised Learning of Visual Features by Contrasting Cluster Assignmentscited by 2,845
  5. 2020Supervised Contrastive Learningcited by 2,803
  6. 2021SimCSE: Simple Contrastive Learning of Sentence Embeddingscited by 2,168
  7. 2018Unsupervised Representation Learning by Predicting Image Rotationscited by 1,586
  8. 2016Unsupervised Learning of Visual Representations by Solving Jigsaw Puzzlescited by 1,379
  9. 2020Graph Contrastive Learning with Augmentationscited by 1,203
  10. 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,134
  11. 2018Deep Graph Infomaxcited by 1,101
  12. 2019Neural Graph Collaborative Filteringcited by 660
31 more
  1. 2020Contrastive Learning with Hard Negative Samplescited by 619
  2. 2020GCC: Graph Contrastive Coding for Graph Neural Network Pre-Trainingcited by 461
  3. 2020Understanding the Behaviour of Contrastive Losscited by 397
  4. 2020Self-supervised Graph Learning for Recommendationcited by 305
  5. 2021Graph Contrastive Learning Automatedcited by 287
  6. 2020Whitening for Self-Supervised Representation Learningcited by 278
  7. 2021ConSERT: A Contrastive Framework for Self-Supervised Sentence Representation Transfercited by 231
  8. 2021R-Drop: Regularized Dropout for Neural Networkscited by 202
  9. 2021Adversarial Graph Augmentation to Improve Graph Contrastive Learningcited by 200
  10. 2021Are Graph Augmentations Necessary? Simple Graph Contrastive Learning for Recommendationcited by 173
  11. 2018DKN: Deep Knowledge-Aware Network for News Recommendationcited by 137
  12. 2020RecBole: Towards a Unified, Comprehensive and Efficient Framework for Recommendation Algorithmscited by 137
  13. 2020Revisiting Graph based Collaborative Filtering: A Linear Residual Graph Convolutional Network Approachcited by 119
  14. 2021Self-Supervised Multi-Channel Hypergraph Convolutional Network for Social Recommendationcited by 101
  15. 2021UltraGCN: Ultra Simplification of Graph Convolutional Networks for Recommendationcited by 87
  16. 2022Improving Graph Collaborative Filtering with Neighborhood-enriched Contrastive Learningcited by 86
  17. 2020Denoising Implicit Feedback for Recommendationcited by 80
  18. 2019A Neural Influence Diffusion Model for Social Recommendationcited by 69
  19. 2021SimpleX: A Simple and Strong Baseline for Collaborative Filteringcited by 65
  20. 2021A Survey on Accuracy-oriented Neural Recommendation: From Collaborative Filtering to Information-rich Recommendationcited by 59
  21. 2022Towards Representation Alignment and Uniformity in Collaborative Filteringcited by 57
  22. 2020On the Equivalence of Decoupled Graph Convolution Network and Label Propagationcited by 49
  23. 2020Clicks can be Cheating: Counterfactual Recommendation for Mitigating Clickbait Issuecited by 48
  24. 2020DiffNet++: A Neural Influence and Interest Diffusion Network for Social Recommendationcited by 46
  25. 2021Self-Supervised Graph Co-Training for Session-based Recommendationcited by 43
  26. 2022On the Effectiveness of Sampled Softmax Loss for Item Recommendationcited by 39
  27. 2020Joint Item Recommendation and Attribute Inference: An Adaptive Graph Convolutional Network Approachcited by 30
  28. 2022Incorporating Bias-aware Margins into Contrastive Loss for Collaborative Filteringcited by 29
  29. 2020Should Graph Convolution Trust Neighbors? A Simple Causal Inference Methodcited by 25
  30. 2022Negative Sampling for Contrastive Representation Learning: A Reviewcited by 23
  31. 2022A Review-aware Graph Contrastive Learning Framework for Recommendationcited by 18

Built on by

Cited by year

Citing papers per year: 2024: 9; 2025: 1.

10 papers.