FixMatch
Algorithms AIMech:FixMatch DRAFT
A semi-supervised classifier-training procedure that fits labeled examples and trains on strongly augmented unlabeled inputs using hard pseudo-labels retained only when the corresponding weakly augmented prediction reaches a confidence threshold.
Identity Notes & Concept Scope
FixMatch’s defining combination is weak-to-strong consistency with confidence-masked hard pseudo-labels. It differs from MixMatch’s soft guessed targets and interpolation, ReMixMatch’s distribution alignment and anchored soft targets, and an EMA-target Mean Teacher. AIO SemiSupervisedLLM is a narrower, differently structured LLM model class, not this classifier-training algorithm. No normalized identity match was found across all 442 pinned AIO labels/scoped synonyms and 234 preceding native IDs/names/aliases. Full-checkout fixed-string searches included ignored and hidden files in both worktree and main checkout, returning 21 lines in each from prior discovery and the related MixMatch record. Twelve exact AIO CLASS nodes, their scoped synonyms and outgoing edges, plus six neighboring native mechanisms were inspected. This absence assessment is bounded to the pinned snapshot and inspected semantic neighborhood.
Claims & Grounded Evidence
2 Claims
Mechanism
#method
Use B labeled examples and an unlabeled-input batch of size mu*B. Compute average cross-entropy on weakly augmented labeled inputs. For each unlabeled input u_b, compute q_b from the current model on its weak augmentation and make a one-hot pseudo-label at argmax(q_b). With these target predictions detached from gradients, use mask 1[max(q_b)≥tau] and cross-entropy against the model prediction on a strong augmentation of the same input. Sum masked losses and divide by the full mu*B, not by the number retained. Add this loss with fixed weight lambda_u to the labeled loss; the stated core algorithm does not require a separate weight ramp. The paper’s input pool can include labeled examples with their labels ignored in this branch. The source uses weak flip/shift augmentation and strong RandAugment or CTAugment plus Cutout; these generators and hyperparameters instantiate the procedure. EMA parameters are used for reported evaluation, while weak-view pseudo-labels come from the current model. The core does not require MixUp or distribution alignment.
Limitation
#threshold-convention
Main-paper Equation4 and the inspected author code use max(q)≥tau, whereas supplementary Algorithm1 writes max(q)>tau. Equality can change whether an example contributes. The inclusive convention is used here; the supplement’s strict inequality is not silently treated as identical.
⚠️ Curated Limitations & Negative Results
- High confidence need not mean correctness; the threshold trades target coverage against potential confirmation errors rather than proving label quality.
- The denominator includes masked-out inputs, so changing the retained fraction changes the effective contribution at fixed lambda_u.
- Class-preserving augmentations and labeled/unlabeled distribution assumptions affect applicability. Strong-augmentation extensions and distribution alignment are separate variants.
- Published source notation differs at the threshold boundary; the record follows the inclusive main-paper and pinned-code convention. No performance score is asserted.
Artificial Intelligence Ontology (AIO) Grounding
Mapped AIO Classes
| AIO Target Class | Mapping Relation | Mapping Rationale |
|---|---|---|
AIO:Classification
Classification
|
related_match | This algorithm learns class predictions from labeled and unlabeled examples. The pinned target is a classification task under SupervisedLearning; the association is not an equivalence or an is-a assertion. |
AIO:MachineLearningTask
Machine Learning Task
|
related_match | This training algorithm realizes learning from data; the AIO target is a general learning task at a different abstraction level, so the relation is associative. |
Evidence Sources & Primary Literature
3 Sources| Source ID | Publication / Document | Type / Access | Reference & Checksum |
|---|---|---|---|
method-source
|
Kihyuk Sohn, David Berthelot, Chun-Liang Li, Zizhao Zhang, Nicholas Carlini, Ekin D. Cubuk, Alex Kurakin, Han Zhang, Colin Raffel
|
primary paper
full_text
|
sha256:c405d1d8a3e8…
|
implementation
|
Google Research
|
official documentation
documentation
|
sha256:46fb0f881c17…
|
supplement
|
Kihyuk Sohn, David Berthelot, Chun-Liang Li, Zizhao Zhang, Nicholas Carlini, Ekin D. Cubuk, Alex Kurakin, Han Zhang, Colin Raffel
|
primary paper
full_text
|
sha256:0483c3a036f6…
|
Curation Provenance
Curator: Codex
Method: ai_assisted
Model: GPT-6
Created: 2026-10-11T10:22:43Z
Updated: 2026-10-11T10:22:43Z
Source File:
data/curated/FixMatch.yaml