mlsanityData to 7 Oct 2026

Supervised Contrastive Learning with Hard Negative Samples

arXiv 2209.00078 ↗First posted 31 Aug 2022cs.LGcited by 13

Not on the map. Why?

Abstract (arXiv)

Through minimization of an appropriate loss function such as the InfoNCE loss, contrastive learning (CL) learns a useful representation function by pulling positive samples close to each other while pushing negative samples far apart in the embedding space. The positive samples are typically created using "label-preserving" augmentations, i.e., domain-specific transformations of a given datum or anchor. In absence of class information, in unsupervised CL (UCL), the negative samples are typically chosen randomly and independently of the anchor from a preset negative sampling distribution over the entire dataset. This leads to class-collisions in UCL. Supervised CL (SCL), avoids this class collision by conditioning the negative sampling distribution to samples having labels different from that of the anchor. In hard-UCL (H-UCL), which has been shown to be an effective method to further enhance UCL, the negative sampling distribution is conditionally tilted, by means of a hardening function, towards samples that are closer to the anchor. Motivated by this, in this paper we propose hard-SCL (H-SCL) {wherein} the class conditional negative sampling distribution {is tilted} via a hardening function. Our simulation results confirm the utility of H-SCL over SCL with significant performance gains {in downstream classification tasks.} Analytically, we show that {in the} limit of infinite negative samples per anchor and a suitable assumption, the {H-SCL loss} is upper bounded by the {H-UCL loss}, thereby justifying the utility of H-UCL {for controlling} the H-SCL loss in the absence of label information. Through experiments on several datasets, we verify the assumption as well as the claimed inequality between H-UCL and H-SCL losses. We also provide a plausible scenario where H-SCL loss is lower bounded by UCL loss, indicating the limited utility of UCL in controlling the H-SCL loss.

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

Builds on

43 of 60 references.

References · 43

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
  3. 2018Representation Learning with Contrastive Predictive Codingcited by 7,662
  4. 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,482
  5. 2018How Powerful are Graph Neural Networks?cited by 4,355
  6. 2020Supervised Contrastive Learningcited by 2,803
  7. 2019Contrastive Multiview Codingcited by 1,297
  8. 2020Graph Contrastive Learning with Augmentationscited by 1,203
  9. 2020What Makes for Good Views for Contrastive Learning?cited by 843
  10. 2020CURL: Contrastive Unsupervised Representations for Reinforcement Learningcited by 745
  11. 2020TUDataset: A collection of benchmark datasets for learning with graphscited by 718
  12. 2019Data-Efficient Image Recognition with Contrastive Predictive Codingcited by 672
31 more
  1. 2020Contrastive Learning with Hard Negative Samplescited by 619
  2. 2019A Theoretical Analysis of Contrastive Unsupervised Representation Learningcited by 530
  3. 2019InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximizationcited by 441
  4. 2020Hard Negative Mixing for Contrastive Learningcited by 399
  5. 2019S4L: Self-Supervised Semi-Supervised Learningcited by 335
  6. 2019Label Propagation for Deep Semi-supervised Learningcited by 287
  7. 2017Sampling Matters in Deep Embedding Learningcited by 285
  8. 2020Contrastive Clusteringcited by 264
  9. 2019Local Aggregation for Unsupervised Learning of Visual Embeddingscited by 204
  10. 2021Dual Contrastive Learning for General Face Forgery Detectioncited by 100
  11. 2021AutoGCL: Automated Graph Contrastive Learning via Learnable View Generatorscited by 73
  12. 2020Conditional Negative Sampling for Contrastive Learning of Visual Representationscited by 57
  13. 2018Improving Generalization via Scalable Neighborhood Component Analysiscited by 53
  14. 2021Molecular Contrastive Learning with Chemical Element Knowledge Graphcited by 50
  15. 2016Hard-Aware Deeply Cascaded Embeddingcited by 44
  16. 2020Contrastive Triple Extraction with Generative Transformercited by 44
  17. 2020Contrastive and Generative Graph Convolutional Networks for Graph-based Semi-Supervised Learningcited by 43
  18. 2021Mutual Contrastive Learning for Visual Representation Learningcited by 42
  19. 2021A Primer on Contrastive Pretraining in Language Processing: Methods, Lessons Learned and Perspectivescited by 41
  20. 2020Enhancing Unsupervised Video Representation Learning by Decoupling the Scene and the Motioncited by 39
  21. 2022Image Difference Captioning with Pre-training and Contrastive Learningcited by 39
  22. 2021Improved Text Classification via Contrastive Adversarial Trainingcited by 38
  23. 2021Semantically Contrastive Learning for Low-light Image Enhancementcited by 31
  24. 2020SAIL: Self-Augmented Graph Contrastive Learningcited by 20
  25. 2022Utilizing Expert Features for Contrastive Learning of Time-Series Representationscited by 17
  26. 2020A Simple and Effective Self-Supervised Contrastive Learning Framework for Aspect Detectioncited by 13
  27. 2022Hard Negative Sampling Strategies for Contrastive Representation Learningcited by 13
  28. 2021Contrastive Spatio-Temporal Pretext Learning for Self-supervised Video Representationcited by 11
  29. 2018DeepChannel: Salience Estimation by Contrastive Learning for Extractive Document Summarizationcited by 6
  30. 2021Hard Negative Sampling via Regularized Optimal Transport for Contrastive Representation Learningcited by 4
  31. 2021Interpretable contrastive word mover's embeddingcited by 2

Built on by

Cited by year (2026 to 7 Oct)

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

13 papers.

Sort: