SOTAVerified

CoMatch: Semi-supervised Learning with Contrastive Graph Regularization

2020-11-23ICCV 2021Code Available1· sign in to hype

Junnan Li, Caiming Xiong, Steven Hoi

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

Semi-supervised learning has been an effective paradigm for leveraging unlabeled data to reduce the reliance on labeled data. We propose CoMatch, a new semi-supervised learning method that unifies dominant approaches and addresses their limitations. CoMatch jointly learns two representations of the training data, their class probabilities and low-dimensional embeddings. The two representations interact with each other to jointly evolve. The embeddings impose a smoothness constraint on the class probabilities to improve the pseudo-labels, whereas the pseudo-labels regularize the structure of the embeddings through graph-based contrastive learning. CoMatch achieves state-of-the-art performance on multiple datasets. It achieves substantial accuracy improvements on the label-scarce CIFAR-10 and STL-10. On ImageNet with 1% labels, CoMatch achieves a top-1 accuracy of 66.0%, outperforming FixMatch by 12.6%. Furthermore, CoMatch achieves better representation learning performance on downstream tasks, outperforming both supervised learning and self-supervised learning. Code and pre-trained models are available at https://github.com/salesforce/CoMatch.

Tasks

Benchmark Results

DatasetModelMetricClaimedVerifiedStatus
CIFAR-10, 80 LabelsSimCLR (CoMatch)Percentage error5.98Unverified
ImageNet - 10% labeled dataCoMatch (w. MoCo v2)Top 1 Accuracy73.7Unverified
ImageNet - 1% labeled dataCoMatch (w. MoCo v2)Top 1 Accuracy67.1Unverified
STL-10, 1000 LabelsSimCLR (CoMatch)Accuracy77.46Unverified

Reproductions