mlsanityData to 7 Oct 2026

Supervised Contrastive Learning for Recommendation

arXiv 2201.03144 ↗First posted 10 Jan 2022cs.IR cs.AIcited by 7

Not on the map. Why?

Abstract (arXiv)

In this work, we aim to consider the application of contrastive learning in the scenario of the recommendation system adequately, making it more suitable for recommendation task. We propose a learning paradigm called supervised contrastive learning(SCL) to support the graph convolutional neural network. Specifically, we will calculate the similarity between different nodes in user side and item side respectively during data preprocessing, and then when applying contrastive learning, not only will the augmented views be regarded as the positive samples, but also a certain number of similar samples will be regarded as the positive samples, which is different with SimCLR that treats other samples in a batch as negative samples. We apply SCL on the most advanced LightGCN. In addition, in order to consider the uncertainty of node interaction, we also propose a new data augment method called node replication. Empirical research and ablation study on Gowalla, Yelp2018, Amazon-Book datasets prove the effectiveness of SCL and node replication, which improve the accuracy of recommendations and robustness to interactive noise.

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

Builds on

30 of 43 references.

References · 30

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
  3. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  4. 2017Graph Attention Networkscited by 8,854
  5. 2018Representation Learning with Contrastive Predictive Codingcited by 7,662
  6. 2017Inductive Representation Learning on Large Graphscited by 6,284
  7. 2018How Powerful are Graph Neural Networks?cited by 4,355
  8. 2017Neural Message Passing for Quantum Chemistrycited by 3,460
  9. 2020Improved Baselines with Momentum Contrastive Learningcited by 2,282
  10. 2018Unsupervised Feature Learning via Non-Parametric Instance-level Discriminationcited by 1,838
  11. 2014DeepWalk: Online Learning of Social Representationscited by 1,543
  12. 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,134
18 more
  1. 2018Graph Convolutional Neural Networks for Web-Scale Recommender Systemscited by 1,133
  2. 2017Neural Collaborative Filteringcited by 1,108
  3. 2018Deeper Insights into Graph Convolutional Networks for Semi-Supervised Learningcited by 1,099
  4. 2019Neural Graph Collaborative Filteringcited by 660
  5. 2016Ups and Downs: Modeling the Visual Evolution of Fashion Trends with One-Class Collaborative Filteringcited by 517
  6. 2018Deep Interest Evolution Network for Click-Through Rate Predictioncited by 336
  7. 2018Variational Autoencoders for Collaborative Filteringcited by 308
  8. 2020Self-supervised Graph Learning for Recommendationcited by 305
  9. 2020Embedding-based Retrieval in Facebook Searchcited by 155
  10. 2015VBPR: Visual Bayesian Personalized Ranking from Implicit Feedbackcited by 151
  11. 2019Practice on Long Sequential User Behavior Modeling for Click-Through Rate Predictioncited by 118
  12. 2020Disentangled Graph Collaborative Filteringcited by 118
  13. 2019Inductive Matrix Completion Based on Graph Neural Networkscited by 85
  14. 2020Towards Domain-Agnostic Contrastive Learningcited by 75
  15. 2016Item2Vec: Neural Item Embedding for Collaborative Filteringcited by 72
  16. 2015Modeling User Exposure in Recommendationcited by 69
  17. 2018Collaborative Memory Network for Recommendation Systemscited by 30
  18. 2021Semi-Supervising Learning, Transfer Learning, and Knowledge Distillation with SimCLRcited by 1

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 3; 2024: 1; 2025: 2.

7 papers.