Multi-Sample based Contrastive Loss for Top-k Recommendation
Not on the map. Why?
Abstract (arXiv)
The top-k recommendation is a fundamental task in recommendation systems which is generally learned by comparing positive and negative pairs. The Contrastive Loss (CL) is the key in contrastive learning that has received more attention recently and we find it is well suited for top-k recommendations. However, it is a problem that CL treats the importance of the positive and negative samples as the same. On the one hand, CL faces the imbalance problem of one positive sample and many negative samples. On the other hand, positive items are so few in sparser datasets that their importance should be emphasized. Moreover, the other important issue is that the sparse positive items are still not sufficiently utilized in recommendations. So we propose a new data augmentation method by using multiple positive items (or samples) simultaneously with the CL loss function. Therefore, we propose a Multi-Sample based Contrastive Loss (MSCL) function which solves the two problems by balancing the importance of positive and negative samples and data augmentation. And based on the graph convolution network (GCN) method, experimental results demonstrate the state-of-the-art performance of MSCL. The proposed MSCL is simple and can be applied in many methods. We will release our code on GitHub upon the acceptance.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 33 of its 66 references that are in the map. First posted on arXiv 1 Sep 2021.
Builds on
33 of 66 references.
References · 33
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,662
- 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,482
- 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,712
- 2015FaceNet: A Unified Embedding for Face Recognition and Clusteringcited by 2,833
- 2020Supervised Contrastive Learningcited by 2,803
- 2018Unsupervised Feature Learning via Non-Parametric Instance-level Discriminationcited by 1,838
- 2018Learning deep representations by mutual information estimation and maximizationcited by 1,265
- 2020Graph Contrastive Learning with Augmentationscited by 1,203
- 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,134
- 2018Graph Convolutional Neural Networks for Web-Scale Recommender Systemscited by 1,133
- 2017Neural Collaborative Filteringcited by 1,108
21 more
- 2019Learning Representations by Maximizing Mutual Information Across Viewscited by 733
- 2019Neural Graph Collaborative Filteringcited by 660
- 2020Contrastive Multi-View Representation Learning on Graphscited by 651
- 2020Prototypical Contrastive Learning of Unsupervised Representationscited by 636
- 2020Graph Contrastive Learning with Adaptive Augmentationcited by 519
- 2020GCC: Graph Contrastive Coding for Graph Neural Network Pre-Trainingcited by 461
- 2020Debiased Contrastive Learningcited by 354
- 2018Variational Autoencoders for Collaborative Filteringcited by 308
- 2020Self-supervised Graph Learning for Recommendationcited by 305
- 2020Data Augmentation for Graph Neural Networkscited by 200
- 2017Attentional Factorization Machines: Learning the Weight of Feature Interactions via Attention Networkscited by 126
- 2020Revisiting Graph based Collaborative Filtering: A Linear Residual Graph Convolutional Network Approachcited by 119
- 2020Disentangled Graph Collaborative Filteringcited by 118
- 2021Contrastive Learning for Cold-Start Recommendationcited by 77
- 2021Graph-MLP: Node Classification without Message Passing in Graphcited by 73
- 2017On Sampling Strategies for Neural Network-based Collaborative Filteringcited by 71
- 2019POG: Personalized Outfit Generation for Fashion Recommendation at Alibaba iFashioncited by 63
- 2018Outer Product-based Neural Collaborative Filteringcited by 41
- 2021Adversarial and Contrastive Variational Autoencoder for Sequential Recommendationcited by 28
- 2020Contrastive Learning for Sequential Recommendationcited by 13
- 2021Leveraging Tripartite Interaction Information from Live Stream E-Commerce for Improving Product Recommendationcited by 7
Built on by
Citing papers per year: 2022: 1; 2023: 3; 2024: 2; 2025: 1.
7 papers.
- 2022Improving Graph Collaborative Filtering with Neighborhood-enriched Contrastive Learningcited by 86
- 2023Adap-τ: Adaptively Modulating Embedding Magnitude for Recommendationcited by 19
- 2024A Survey on Self-Supervised Graph Foundation Models: Knowledge-Based Perspectivecited by 9
- 2024Guidelines for Augmentation Selection in Contrastive Learning for Time Series Classificationcited by 5
- 2023Graph-based Alignment and Uniformity for Recommendationcited by 4
- 2023A Comparative Analysis of Bias Amplification in Graph Neural Network Approaches for Recommender Systemscited by 0
- 2025Context-Enriched Contrastive Loss: Enhancing Presentation of Inherent Sample Connections in Contrastive Learning Frameworkcited by 0
- 2025Context-Enriched Contrastive Loss: Enhancing Presentation of Inherent Sample Connections in Contrastive Learning Framework1 Dec 2025
- 2024Guidelines for Augmentation Selection in Contrastive Learning for Time Series Classification12 Jul 2024
- 2024A Survey on Self-Supervised Graph Foundation Models: Knowledge-Based Perspective24 Mar 2024
- 2023Graph-based Alignment and Uniformity for Recommendation18 Aug 2023
- 2023Adap-τ: Adaptively Modulating Embedding Magnitude for Recommendation9 Feb 2023
- 2023A Comparative Analysis of Bias Amplification in Graph Neural Network Approaches for Recommender Systems18 Jan 2023
- 2022Improving Graph Collaborative Filtering with Neighborhood-enriched Contrastive Learning13 Feb 2022