Revisiting Contrastive Learning through the Lens of Neighborhood Component Analysis: an Integrated Framework
Not on the map. Why?
Abstract (arXiv)
As a seminal tool in self-supervised representation learning, contrastive learning has gained unprecedented attention in recent years. In essence, contrastive learning aims to leverage pairs of positive and negative samples for representation learning, which relates to exploiting neighborhood information in a feature space. By investigating the connection between contrastive learning and neighborhood component analysis (NCA), we provide a novel stochastic nearest neighbor viewpoint of contrastive learning and subsequently propose a series of contrastive losses that outperform the existing ones. Under our proposed framework, we show a new methodology to design integrated contrastive losses that could simultaneously achieve good accuracy and robustness on downstream tasks. With the integrated framework, we achieve up to 6% improvement on the standard accuracy and 17% improvement on the robust accuracy.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). Builds on 33 of its 46 references that are in the map. First posted on arXiv 8 Dec 2021.
Builds on
33 of 46 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
- 2014Explaining and Harnessing Adversarial Examplescited by 7,287
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
- 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
- 2013Intriguing properties of neural networkscited by 5,114
- 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,712
- 2020Unsupervised Learning of Visual Features by Contrasting Cluster Assignmentscited by 2,845
- 2020Supervised Contrastive Learningcited by 2,803
- 2020Improved Baselines with Momentum Contrastive Learningcited by 2,282
- 2018Unsupervised Feature Learning via Non-Parametric Instance-level Discriminationcited by 1,838
21 more
- 2015DeepFool: a simple and accurate method to fool deep neural networkscited by 1,315
- 2019Contrastive Multiview Codingcited by 1,297
- 2016Adversarial Machine Learning at Scalecited by 934
- 2020What Makes for Good Views for Contrastive Learning?cited by 843
- 2014Deep Neural Networks are Easily Fooled: High Confidence Predictions for Unrecognizable Imagescited by 774
- 2020Fast is better than free: Revisiting adversarial trainingcited by 723
- 2020Contrastive Multi-View Representation Learning on Graphscited by 651
- 2020Contrastive Learning with Hard Negative Samplescited by 619
- 2019A Theoretical Analysis of Contrastive Unsupervised Representation Learningcited by 530
- 2020Debiased Contrastive Learningcited by 354
- 2021With a Little Help from My Friends: Nearest-Neighbor Contrastive Learning of Visual Representationscited by 324
- 2021Provable Guarantees for Self-Supervised Deep Learning with Spectral Contrastive Losscited by 311
- 2019Unsupervised Embedding Learning via Invariant and Spreading Instance Featurecited by 231
- 2018Adversarial Logit Pairingcited by 224
- 2016Exploring the Limits of Language Modelingcited by 172
- 2020Adversarial Self-Supervised Contrastive Learningcited by 138
- 2017Unsupervised Learning by Predicting Noisecited by 97
- 2020Contrastive Learning with Adversarial Examplescited by 91
- 2021When Does Contrastive Learning Preserve Adversarial Robustness from Pretraining to Finetuning?cited by 76
- 2020Towards Domain-Agnostic Contrastive Learningcited by 75
- 2020Are Adversarial Examples Created Equal? A Learnable Weighted Minimax Risk for Robustness under Non-uniform Attackscited by 14
Built on by
Citing papers per year: 2022: 2; 2023: 6; 2024: 0; 2025: 3.
11 papers.
- 2023Understanding Multimodal Contrastive Learning and Incorporating Unpaired Datacited by 43
- 2023The Trade-off between Universality and Label Efficiency of Representations from Contrastive Learningcited by 27
- 2023Understanding Contrastive Learning via Distributionally Robust Optimizationcited by 21
- 2023Rethinking Weak Supervision in Helping Contrastive Learningcited by 18
- 2022Hard Negative Sampling Strategies for Contrastive Representation Learningcited by 13
- 2023ConCerNet: A Contrastive Learning Based Framework for Automated Conservation Law Discovery and Trustworthy Dynamical System Predictioncited by 5
- 2023Towards the Sparseness of Projection Head in Self-Supervised Learningcited by 4
- 2025An Augmentation-Aware Theory for Self-Supervised Contrastive Learningcited by 3
- 2022Self-supervised Representation Learning on Electronic Health Records with Graph Kernel Infomaxcited by 2
- 2025Difficult Examples Hurt Unsupervised Contrastive Learning: A Theoretical Perspectivecited by 2
- 2025Revisiting Theory of Contrastive Learning for Domain Generalizationcited by 0
- 2025Revisiting Theory of Contrastive Learning for Domain Generalization2 Dec 2025
- 2025An Augmentation-Aware Theory for Self-Supervised Contrastive Learning28 May 2025
- 2025Difficult Examples Hurt Unsupervised Contrastive Learning: A Theoretical Perspective2 Jan 2025
- 2023Understanding Contrastive Learning via Distributionally Robust Optimization17 Oct 2023
- 2023Towards the Sparseness of Projection Head in Self-Supervised Learning18 Jul 2023
- 2023Rethinking Weak Supervision in Helping Contrastive Learning7 Jun 2023
- 2023The Trade-off between Universality and Label Efficiency of Representations from Contrastive Learning28 Feb 2023
- 2023Understanding Multimodal Contrastive Learning and Incorporating Unpaired Data13 Feb 2023
- 2023ConCerNet: A Contrastive Learning Based Framework for Automated Conservation Law Discovery and Trustworthy Dynamical System Prediction11 Feb 2023
- 2022Self-supervised Representation Learning on Electronic Health Records with Graph Kernel Infomax1 Sep 2022
- 2022Hard Negative Sampling Strategies for Contrastive Representation Learning2 Jun 2022