Papers › FreeMatch: Self-adaptive Thresholding for Semi-supervised Learning
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
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 https://github.com/microsoft/Semi-supervised-learning.
In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.
Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
Syntology holds a reference implementation of FreeMatch, generated from the paper text (not the authors' code), at level 3 on Syntology's ladder: V2 “two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs” “neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)”; V3 “paper-derived property tests pass on both of those same two generations.” (quoted from Syntology's server card). No rung compares this code against the authors' implementation. For agents: get_reference_implementation(name='FreeMatch') (how to connect); the free check have('2205.07246') needs no token.
For agents, on Syntology's MCP service (how to connect):
get_harvested_code_for_paper(arxiv_id="2205.07246")get_code(code_sha256="…")with a sample'scode_sha256from the list belowget_citation_path(paper_1="2205.07246", paper_2="…")with another paper's arXiv id or titleget_concepts_for_paper(arxiv_id="2205.07246")
Code
Syntology 14 code samples harvested from 5 repositories linked to this paper: 9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 5 unverified. Where Syntology's instrument failed: 1 where our contract draft was wrong; 1 where the contract check could not run; failures of Syntology's instrument, not of the code.
By repository: official repository: 4 samples from 2 repositories, 3 ran (1 with no instrument failure; 2 where Syntology's instrument failed); community (archive-listed): 10 samples from 3 repositories, 6 ran (6 with no instrument failure; 0 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.
No sample is linked to this paper from 1 of its repositories that Syntology harvested for other papers:
- beandkay/epass, community (archive-listed): harvested for another paper, listed under the repository
Levels written between 2026-09-22 and 2026-09-25 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed. 2 of the 9 samples that ran have no recorded date.
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.
Code Syntology ran Syntology
14 samples harvested: 9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 5 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.
Licence: 2 of the 14 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.
Harvested from 5 repositories linked to this paper, official or community; the list below is grouped by repository, each group headed by its name and what it is to the paper. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.
Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.
Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.
A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity. A census tag appears when Syntology's census ran implementations with that name on one shared input per bucket: it gives how many were compared, from how many papers, and how many distinct outputs they produced, and names this sample's bucket when this sample was one of them.
census: 5 implementations from 5 papers, 2 distinct outputs across 2 buckets, one shared input per bucket semilearn/algorithms/freematch/freematch.py ran · our draft was wrong fingerprinted MIT (permissive) ·
e4d38b3bf55a8430 · report
fixture: signature mask:Tensor/1/bool, logits_s:Tensor/2/float, prob_model:Tensor/1/float, label_hist:Tensor/1/float · returned tuple · level recorded, date not recorded c5976b5c715825f6 · report
fixture: signature val:Tensor/2/float · returned Tensor · level recorded, date not recorded 8d4e503501f8115a · report
fixture: signature dataset:str/0/str, logits_s:Tensor/2/float, logits_w:Tensor/2/float, time_p:float/0/float, p_model:Tensor/1/float, name:str/0/str, use_hard_labels:bool/0/bool · returned tuple · level recorded 2026-09-22 26ae35625bab2b43 · report
ad8a877057eed809 · report
8837096520e4398d · report
fixture: signature logits:Tensor/2/float, targets:Tensor/1/int, mask:Tensor/1/float · returned Tensor · level recorded 2026-09-22 7487c583dca6a842 · report
fixture: signature in_planes:int/0/int, out_planes:int/0/int, stride:int/0/int · returned Conv2d · level recorded 2026-09-25 c5e915e62a479bd7 · report
fixture: signature in_planes:int/0/int, out_planes:int/0/int, stride:int/0/int, groups:int/0/int, dilation:int/0/int · returned Conv2d · level recorded 2026-09-25 b45ebdf32841b261 · report
fixture: signature x:Tensor/2/int · returned Tensor · level recorded 2026-09-25 4e0f862bc1278ba0 · report
fixture: signature x:ndarray/3/float · returned Tensor · level recorded 2026-09-25 4369fbda3bd2eef3 · report
fixture: signature x:ndarray/3/float · returned Tensor · level recorded 2026-09-25 cec899f733d5acb7 · report
Method as code Syntology
What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. For a generated assembly, an independent peer is a second implementation generated separately from the same paper text; neither implementation read the authors' code. At level 2 the two agreed numerically on the fixture's inputs; level 3 is recorded when property tests derived from the paper also passed on both, and each level 3 card prints how many its report lists. Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it. A generated assembly's label was set when its code was generated for the method, and no model judged it; its card prints it as "by construction" or "not judged by a model". Siblings are assemblies lifted from this paper in the same batch for the same method: alternative readings kept side by side; none replaces or supersedes another. Where an assembly's phrase has no constructed figure, a brick that ran is not among the harvested samples this build reads, and whether a brick's run only constructed an object is read from that brick's harvested sample, so the figure was not counted; it does not say there were none.
4 assemblies on this paper: 3 harvested, 1 generated, listed in 2 groups (siblings lifted in one batch form one group).
generated Assembly for FreeMatch (graph method: FreeMatch), generated from the paper text, not the repository's code. 1 brick; individually on a fixture: 1 ran (1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified. Ran end-to-end against an independent peer (level 3; 5 property tests passed on both).
label matches by construction: the code was generated for this method (not judged by a model)
- freematch_self_adaptive_threshold entry · level 3 · ran · violated contract ·
fc3765f24928a369eac6cc794e49884e3bcc33b7063766032689e81427c1419b
3 sibling assemblies for FreeMatch (harvested), lifted in the same batch on 2026-09-09: alternative readings kept side by side; none replaces or supersedes another.
harvested Assembly for FreeMatch (graph method: FreeMatch). 2 bricks; individually on a fixture: 0 ran · 2 unverified. The assembly has not been run end-to-end.
one of 3 siblings
- SelfAdaptiveThresholdLoss entry · level 0 · unverified ·
ad8a877057eed809 - ConsistencyLoss loss · level 0 · unverified ·
26ae35625bab2b43
harvested Assembly for FreeMatch (graph method: FreeMatch). 5 bricks; individually on a fixture: 4 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified. The assembly has not been run end-to-end.
one of 3 siblings
- FreeMatch entry · level 0 · unverified ·
68352b4ace632b5c - Bn_Controller helper · level 1 · ran ·
c7df675a6572bbc0 - EMA helper · level 1 · ran ·
53e087b47be18e2f - ce_loss helper · level 1 · ran; the contract check could not run ·
ceaa5f15ab49feba - consistency_loss helper · level 1 · ran; the contract check could not run (RAISES) ·
8d4e503501f8115a
harvested Assembly for FreeMatch (graph method: FreeMatch). 2 bricks; individually on a fixture: 1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified. The assembly has not been run end-to-end.
one of 3 siblings
- SelfAdaptiveThresholdLoss entry · level 0 · unverified ·
a169b5b35ae13821 - ConsistencyLoss loss · level 1 · ran ·
8837096520e4398d
Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="2205.07246") returns these assemblies with each brick's role and wiring (how to connect).
Tasks
Results from the paper archive 2025-07-28
| Task | Dataset | Model | Metric | Value | Rank at snapshot | Leaderboard | Report |
|---|---|---|---|---|---|---|---|
| Semi-Supervised Image Classification | CIFAR-10, 250 Labels | FreeMatch | Percentage error | 4.88 | #14 of 27 | Archive leaderboard | report |
| Semi-Supervised Image Classification | CIFAR-10, 40 Labels | FreeMatch | Percentage error | 4.9 | #2 of 21 | Archive leaderboard | report |
| Semi-Supervised Image Classification | CIFAR-100, 2500 Labels | FreeMatch | Percentage error | 26.47 | #9 of 16 | Archive leaderboard | report |
| Semi-Supervised Image Classification | CIFAR-100, 400 Labels | FreeMatch | Percentage error | 37.98 | #9 of 21 | Archive leaderboard | report |
| Semi-Supervised Image Classification | cifar-100, 10000 Labels | FreeMatch | Percentage error | 21.68 | #10 of 29 | Archive leaderboard | report |
Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections