arXiv Machine Learning

JEPAMatch: Geometric Representation Shaping for Semi-Supervised Learning

JEPAMatch introduces a new semi‑supervised learning framework that replaces traditional output‑thresholding with explicit geometric shaping of latent representations. By combining the FlexMatch loss with a latent‑space regularization inspired by LeJEPA, the method encourages isotropic Gaussian structure in the embedding space, mitigating class imbalance and noisy pseudo‑labels. Experiments on CIFAR‑100, STL‑10, and Tiny‑ImageNet show consistent performance gains and faster convergence compared to existing FixMatch‑based baselines.

arXiv AI
Sep 25

ReCalMatch:Reliability-Calibrated Semantic Guidance for Semi-Supervised Fine-Grained Recognition

ReCalMatch introduces a reliability‑calibrated semantic framework for semi‑supervised fine‑grained visual recognition, addressing the problem of overconfident pseudo‑label errors that arise when visually similar categories produce incorrect high‑confidence predictions. The method constructs class‑conditioned semantic prototypes from class names and domain‑specific aspects, and computes a visual‑semantic agreement score to calibrate pseudo‑label reliability alongside prediction confidence and entropy. Experiments on datasets such as CUB‑200‑2011, Stanford Dogs, NABirds, and iNaturalist18 demonstrate that ReCalMatch consistently improves strong SSL baselines, especially in low‑label regimes where pseudo‑label noise is most severe.

By Yundi Hong, Hongyang He, Zheng Fang, Xuanyu Liu, Victor Sanchez
arXiv Machine Learning
Jul 27

Unbiased Open World Regularization for Fair Self-Supervised Learning

arXiv:2607. 22149v1 Announce Type: new Abstract: Despite recent advances, self-supervised learning (SSL) models and Joint-Embedding Predictive Architectures (JEPAs) remain susceptible to learning spurious biases in the dataset.

By L{\'e}o Nicollier (CB, ATT), Marc Pic (ATT), Pablo Mus{\'e} (CB, IFUMI), Enric Meinhardt-Llopis (CB), Gabriele Facciolo (CB)
arXiv AI
Aug 20

From Inference to Adaptation: A Unified Optimal Transport View of Vision Language Model

arXiv:2608. 18339v1 Announce Type: cross Abstract: Vision-language models (VLMs) have demonstrated remarkable zero-shot capabilities yet remain sensitive to real-world distribution shifts during inference.

By Qi Yu, Zhichen Zeng, Katherine Tieu, Xiyuan Yang, Ruizhong Qiu, Yuchen Yan, Lihui Liu, Yanjun Zhao, Lingjie Chen, Jingrui He, Hanghang Tong
arXiv Computer Vision
Sep 22

Training-Free Spectral Transductive Refinement for Cross-Domain Few-Shot Classification

The paper introduces Spectral Transductive Refinement (STR), a training‑free method that refines class prototypes at test time using the geometry of a joint k‑nearest‑neighbour graph and a normalized‑Laplacian spectral coordinate system. STR operates solely on frozen visual embeddings, iteratively updating pseudo‑labelled queries to improve one‑shot and few‑shot classification under domain shift. Experiments on ResNet‑18 and ResNet‑10 backbones show STR outperforms single‑prototype baselines and rivals meta‑trained cross‑domain few‑shot methods, achieving the best 1‑shot average across eight target domains.

By Fahim Rahman, S. M. Tanjeeb Meheran Rohan, Md. Taimum Ibne Sayed, Asaduzzaman Herok, Md. Bakhtiar Hasan