arXiv Computer Vision

FedBST: Bilateral Self-Training for Unsupervised Federated Classification

FedBST introduces a bilateral self‑training framework for unsupervised federated classification using Vision‑Language Models. It addresses the shortcomings of prior methods by exploiting both high‑confidence and ambiguous samples through uncertainty‑aware confidence penalization (UACP) during local training and a visual‑text ensemble strategy at inference. Experiments show that FedBST consistently outperforms existing approaches under standard federated aggregation protocols.

arXiv AI
Oct 21

Language Guidance for Supervised Vision Training: An Empirical Study of Generalization

The paper investigates whether pretrained language models can act as lightweight auxiliary supervision for supervised vision training, without requiring paired image-text data or complex objectives. Two forms of language guidance—Explicit Language Guidance (ExLG) and Implicit Language Guidance (ImLG)—are evaluated across six generalization regimes, including in‑distribution, out‑of‑distribution, shortcut resistance, texture/shape bias, adversarial robustness, and continual learning. Results show that ExLG improves in‑distribution, low‑data performance, and continual learning retention, while ImLG is more effective in shortcut‑sensitive and adversarial settings, and both add minimal parameters and training overhead.

By Shruthi Gowda, Nikita Jain, Elahe Arani, Bahram Zonooz
arXiv AI
Jun 15

Learning What to Predict: Downstream-Guided Task Design for Continued Pretraining

arXiv:2601. 22108v2 Announce Type: replace-cross Abstract: Continued pretraining is optimized with fixed self-supervised tasks but selected by downstream performance, creating a coarse feedback loop in which practitioners evaluate checkpoints, change data mixtures or objectives, and restart runs, while individual updates remain blind to target capabilities.

By Shuqi Ke, Giulia Fanti
arXiv Machine Learning
Aug 27

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.

By Ali Aghababaei-Harandi, Aude Sportisse, Massih-Reza Amini
arXiv Machine Learning
Aug 3

Visual Distribution Anchoring for Efficient Prompt Tuning

arXiv:2607. 28967v1 Announce Type: cross Abstract: Prompt tuning adapts vision--language models with few trainable parameters, but existing approaches trade off efficiency and adaptation: static textual prompts can overfit source classes, image-conditioned prompts add per-instance computation, and multimodal tuning modifies the visual branch.

By Pouya Parsa, Raoof Zare Moayedi, Seongjin Choi