In-Person Poster presentation / poster accept

FreeMatch: Self-adaptive Thresholding for Semi-supervised Learning

Yidong Wang · Hao Chen · Qiang Heng · Wenxin Hou · Yue Fan · Zhen Wu · Jindong Wang · Marios Savvides · Takahiro Shinozaki · Bhiksha Raj · Bernt Schiele · Xing Xie

MH1-2-3-4 #71

Keywords: [ Deep Learning and representational learning ] [ semi-supervised learning ] [ semi-supervised classification ]

[ Abstract ]
[ Poster [ OpenReview
Wed 3 May 2:30 a.m. PDT — 4:30 a.m. PDT


Semi-supervised Learning (SSL) has witnessed great success owing to the impressive performances brought by various methods based on pseudo labeling and consistency regularization. However, we argue that existing methods might fail to utilize the unlabeled data more effectively since they either use a pre-defined / fixed threshold or an ad-hoc threshold adjusting scheme, resulting in inferior performance and slow convergence. We first analyze a motivating example to obtain intuitions on the relationship between the desirable threshold and model's learning status. Based on the analysis, we hence propose FreeMatch to adjust the confidence threshold in a self-adaptive manner according to the model's learning status. We further introduce a self-adaptive class fairness regularization penalty to encourage the model for diverse predictions during the early training stage. Extensive experiments indicate the superiority of FreeMatch especially when the labeled data are extremely rare. FreeMatch achieves 5.78%, 13.59%, and 1.28% error rate reduction over the latest state-of-the-art method FlexMatch on CIFAR-10 with 1 label per class, STL-10 with 4 labels per class, and ImageNet with 100 labels per class, respectively. Moreover, FreeMatch can also boost the performance of imbalanced SSL. The codes can be found at

Chat is not available.