mlsanityData to 7 Oct 2026

A Theory-Driven Self-Labeling Refinement Method for Contrastive Representation Learning

arXiv 2106.14749 ↗First posted 28 Jun 2021cs.CV cs.AI cs.LGcited by 7

Not on the map. Why?

Abstract (arXiv)

For an image query, unsupervised contrastive learning labels crops of the same image as positives, and other image crops as negatives. Although intuitive, such a native label assignment strategy cannot reveal the underlying semantic similarity between a query and its positives and negatives, and impairs performance, since some negatives are semantically similar to the query or even share the same semantic class as the query. In this work, we first prove that for contrastive learning, inaccurate label assignment heavily impairs its generalization for semantic instance discrimination, while accurate labels benefit its generalization. Inspired by this theory, we propose a novel self-labeling refinement approach for contrastive learning. It improves the label quality via two complementary modules: (i) self-labeling refinery (SLR) to generate accurate labels and (ii) momentum mixup (MM) to enhance similarity between query and its positive. SLR uses a positive of a query to estimate semantic similarity between a query and its positive and negatives, and combines estimated similarity with vanilla label assignment in contrastive learning to iteratively generate more accurate and informative soft labels. We theoretically show that our SLR can exactly recover the true semantic labels of label-corrupted data, and supervises networks to achieve zero prediction error on classification tasks. MM randomly combines queries and positives to increase semantic similarity between the generated virtual queries and their positives so as to improves label accuracy. Experimental results on CIFAR10, ImageNet, VOC and COCO show the effectiveness of our method. PyTorch code and model will be released online.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 59 of its 81 references that are in the map. First posted on arXiv 28 Jun 2021.

Builds on

59 of 81 references.

References · 59

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  3. 2014Microsoft COCO: Common Objects in Contextcited by 17,498
  4. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
  5. 2015Distilling the Knowledge in a Neural Networkcited by 10,076
  6. 2018Representation Learning with Contrastive Predictive Codingcited by 7,662
  7. 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,482
  8. 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
  9. 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 4,993
  10. 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,712
  11. 2020Exploring Simple Siamese Representation Learningcited by 2,853
  12. 2020Unsupervised Learning of Visual Features by Contrasting Cluster Assignmentscited by 2,845
38 more
  1. 2020Improved Baselines with Momentum Contrastive Learningcited by 2,282
  2. 2018Unsupervised Feature Learning via Non-Parametric Instance-level Discriminationcited by 1,838
  3. 2018Unsupervised Representation Learning by Predicting Image Rotationscited by 1,586
  4. 2019MixMatch: A Holistic Approach to Semi-Supervised Learningcited by 1,390
  5. 2016Unsupervised Learning of Visual Representations by Solving Jigsaw Puzzlescited by 1,379
  6. 2020Big Self-Supervised Models are Strong Semi-Supervised Learnerscited by 1,375
  7. 2019Contrastive Multiview Codingcited by 1,297
  8. 2018Learning deep representations by mutual information estimation and maximizationcited by 1,265
  9. 2016Colorful Image Colorizationcited by 1,113
  10. 2019When Does Label Smoothing Help?cited by 985
  11. 2020What Makes for Good Views for Contrastive Learning?cited by 843
  12. 2019Self-Supervised Learning of Pretext-Invariant Representationscited by 806
  13. 2018A Convergence Theory for Deep Learning via Over-Parameterizationcited by 784
  14. 2019Learning Representations by Maximizing Mutual Information Across Viewscited by 733
  15. 2019Data-Efficient Image Recognition with Contrastive Predictive Codingcited by 672
  16. 2018Gradient Descent Provably Optimizes Over-parameterized Neural Networkscited by 655
  17. 2020Prototypical Contrastive Learning of Unsupervised Representationscited by 636
  18. 2018Gradient Descent Finds Global Minima of Deep Neural Networkscited by 572
  19. 2019A Theoretical Analysis of Contrastive Unsupervised Representation Learningcited by 530
  20. 2019Self-labelling via simultaneous clustering and representation learningcited by 525
  21. 2020Debiased Contrastive Learningcited by 354
  22. 2014Training Deep Neural Networks on Noisy Labels with Bootstrappingcited by 322
  23. 2017The Expressive Power of Neural Networks: A View from the Widthcited by 318
  24. 2017Empirical Analysis of the Hessian of Over-Parametrized Neural Networkscited by 283
  25. 2018Learning Overparameterized Neural Networks via Stochastic Gradient Descent on Structured Datacited by 260
  26. 2016Benefits of depth in neural networkscited by 248
  27. 2019Large Scale Adversarial Representation Learningcited by 238
  28. 2019Local Aggregation for Unsupervised Learning of Visual Embeddingscited by 204
  29. 2017Multi-task Self-Supervised Visual Learningcited by 200
  30. 2015The Power of Depth for Feedforward Neural Networkscited by 181
  31. 2019Towards moderate overparameterization: global convergence guarantees for training shallow neural networkscited by 176
  32. 2019Gradient Descent with Early Stopping is Provably Robust to Label Noise for Overparameterized Neural Networkscited by 158
  33. 2020Towards Theoretically Understanding Why SGD Generalizes Better Than ADAM in Deep Learningcited by 125
  34. 2021Contrastive Learning with Stronger Augmentationscited by 100
  35. 2015On the Expressive Power of Deep Learning: A Tensor Analysiscited by 97
  36. 2018Overparameterized Nonlinear Learning: Gradient Descent Takes the Shortest Path?cited by 87
  37. 2016Why Deep Neural Networks for Function Approximation?cited by 82
  38. 2020Towards Domain-Agnostic Contrastive Learningcited by 75

50 most cited of 59 All 59 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 4; 2023: 0; 2024: 2; 2025: 0; 2026: 1.

7 papers.