JEPAMatch: Geometric Representation Shaping
for Semi-Supervised Learning

Ali Aghababaei-Harandi · Aude Sportisse · Massih-Reza Amini
Université Grenoble Alpes, CNRS, Computer Science Laboratory LIG, Grenoble, France

JEPAMatch combines FlexMatch-style adaptive pseudo-labeling with a LeJEPA-inspired representation-level objective, so that instead of only thresholding softmax outputs, the model also explicitly shapes its latent space into well-separated, isotropic per-class clusters. This fixes two long-standing FixMatch-family bottlenecks — majority-class dominance in pseudo-labeling, and the ~2²⁰ iteration convergence tax — cutting the iteration budget by while matching or beating prior SSL methods on CIFAR-100, STL-10, and Tiny-ImageNet.

JEPAMatch architecture diagram
A shared backbone feeds two levels: the Curriculum Level (top) does FlexMatch-style adaptive pseudo-labeling on weak/strong views; the Representation Level (bottom) aligns global and local crops via a JEPA prediction loss, regularized by Adaptive Class-wise SIGReg — per-class isotropic Gaussians instead of one global one, kept apart by an active repulsion term.

Highlights

Results

Error rate (%), lower is better, 3 seeds.

CIFAR-100 & STL-10
MethodIter.CIFAR-100 (400)CIFAR-100 (2.5K)CIFAR-100 (10K)STL-10 (40)STL-10 (1K)
FixMatch2²⁰46.42 ± 0.8228.03 ± 0.1622.20 ± 0.1235.97 ± 4.146.25 ± 0.33
FlexMatch2²⁰39.94 ± 1.6226.49 ± 0.2021.90 ± 0.1529.15 ± 4.165.77 ± 0.18
FreeMatch2²⁰37.98 ± 0.4226.47 ± 0.2021.68 ± 0.0315.56 ± 0.555.63 ± 0.15
SoftMatch2²⁰37.10 ± 0.7726.66 ± 0.2522.03 ± 0.0321.42 ± 3.485.73 ± 0.24
CrMatch2²⁰39.45 ± 1.6925.43 ± 0.1420.40 ± 0.084.89 ± 0.17
SimMatch2²⁰37.81 ± 2.2125.07 ± 0.3220.58 ± 0.11
FlatMatch2²⁰38.76 ± 1.6225.38 ± 0.8519.01 ± 0.4316.20 ± 4.344.82 ± 1.21
Suave*2²⁰35.4023.0018.40
RegMixMatch*2²⁰35.2723.7819.4111.744.66
JEPAMatch (Ours)2¹⁷34.25 ± 1.9722.59 ± 1.1718.55 ± 0.8513.44 ± 3.24.28 ± 1.43

*standard deviation not reported in the original paper. Full baseline table (PseudoLabel, MeanTeacher, MixMatch, ReMixMatch, UDA) in the paper.

Tiny-ImageNet
MethodIter.1K labels10K labels
FlexMatch2¹⁸41.7327.89
SoftMatch2¹⁸40.0925.92
JEPAMatch2¹⁸38.8224.50
Drop-in module on other curricula (CIFAR-100, 400)
MethodIter.Error
FlexMatch2²⁰50.15 ± 1.51
FreeMatch2²⁰49.64 ± 1.46
SoftMatch2²⁰49.24 ± 2.16
JEPAMatch (Flex)2¹⁷45.77 ± 2.77
JEPAMatch (Free)2¹⁷45.12 ± 1.98
JEPAMatch (Soft)2¹⁷44.65 ± 2.14

Convergence speed & pseudo-labeling quality

Convergence speed vs FlexMatch
JEPAMatch reaches FlexMatch's peak accuracy (CIFAR-100, 4 labels/class) roughly 50k iterations earlier, and keeps climbing to a substantially higher final accuracy.
Data utilization vs FlexMatch
JEPAMatch keeps more pseudo-labels above the confidence threshold, at higher correctness, than FlexMatch.
Class dominance comparison
FlexMatch's majority class can claim up to a quarter of all pseudo-labels in a batch; JEPAMatch keeps this far more balanced.

Code

Training code, all configs, and the full paper are on GitHub: aah94/JEPAMatch.

git clone https://github.com/aah94/JEPAMatch.git
cd JEPAMatch
pip install -r requirements.txt
python train.py --c config/classic_cv/jepamatch/jepamatch_cifar100_400_0.yaml

Citation

@article{aghababaeiharandi2026jepamatch,
  title   = {JEPAMatch: Geometric Representation Shaping for Semi-Supervised Learning},
  author  = {Aghababaei-Harandi, Ali and Sportisse, Aude and Amini, Massih-Reza},
  journal = {arXiv preprint arXiv:2604.21046},
  year    = {2026}
}