SimMatchV2: Semi-Supervised Learning with Graph Consistency
Mingkai Zheng Shan You Lang Huang Chen Luo Fei Wang Chen Qian Chang Xu
Semi-Supervised image classification is one of the most fundamental problem
in computer vision, which significantly reduces the need for human labor. In
this paper, we introduce a new semi-supervised learning algorithm - SimMatchV2,
which formulates various consistency regularizations between labeled and
unlabeled data from the graph perspective. In SimMatchV2, we regard the
augmented view of a sample as a node, which consists of a label and its
corresponding representation. Different nodes are connected with the edges,
which are measured by the similarity of the node representations. Inspired by
the message passing and node classification in graph theory, we propose four
types of consistencies, namely 1) node-node consistency, 2) node-edge
consistency, 3) edge-edge consistency, and 4) edge-node consistency. We also
uncover that a simple feature normalization can reduce the gaps of the feature
norm between different augmented views, significantly improving the performance
of SimMatchV2. Our SimMatchV2 has been validated on multiple semi-supervised
learning benchmarks. Notably, with ResNet-50 as our backbone and 300 epochs of
training, SimMatchV2 achieves 71.9\% and 76.2\% Top-1 Accuracy with 1\% and
10\% labeled examples on ImageNet, which significantly outperforms the previous
methods and achieves state-of-the-art performance. Code and pre-trained models
are available at
\href{https://github.com/mingkai-zheng/SimMatchV2}{https://github.com/mingkai-zheng/SimMatchV2}.