arXiv:2601. 11670v3 Announce Type: replace-cross Abstract: Pseudo-label selection in semi-supervised learning is commonly driven by maximum-confidence thresholds, yet confidence alone can be unreliable under model overconfidence and class imbalance.
By Jinshi Liu, Lei He, Pan Liu
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.
By Ali Aghababaei-Harandi, Aude Sportisse, Massih-Reza Amini
arXiv:2605. 13674v2 Announce Type: replace-cross Abstract: Weakly supervised semantic segmentation (WSSS) trains dense pixel-level segmentation models from partial or coarse annotations such as bounding boxes, scribbles, or image-level tags.
By Stefano Colamonaco, Andrei-Bogdan Florea, Jaron Maene
SAUF-Net is a semi‑supervised medical image segmentation framework that learns structure–appearance representations with uncertainty feedback. It decomposes bottleneck features into structural and appearance components, injects them into decoding, and uses auxiliary decoders and a dual‑head discriminator to estimate reliability and uncertainty. Experiments on ISIC‑2016 and Kvasir‑SEG show that SAUF‑Net surpasses state‑of‑the‑art methods, particularly when few labels are available.
By Qin Lu, Zheyang Jing, Yujie Yang, Jianwang Li, Chen Yi, Shaofeng Jiang
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:2606. 31603v1 Announce Type: cross Abstract: Semantic segmentation models struggle with data sparsity and rare or visually diverse regions, e.
By Nikolai R\"ohrich, Julian Glei{\ss}ner, Ahmed H. A. Ibrahim, Silvan Mertes, Tobias Huber