🛰️ Daily AI Frontier
‹ back to 2026-07-21

PRiSM: Prototype Regularization for Few-Shot VLMs

Research Multimodal & Generative

Ranking

Overall 65
Content 75
Popularity 41

Observed public metrics from 1 member.

Merged summary

TL;DR - PRiSM is a plug-and-play prototype regularization method for training-free few-shot adaptation of vision-language models. It improves robustness when labeled examples are class-imbalanced or span many classes.

  • Introduces a Dirichlet-sampled benchmark varying class balance and effective class count.
  • Finds substantial degradation in existing methods under realistic imbalance, sometimes worsening with more labeled samples.
  • Optimizes prototypes using inter-class separation, support-feature alignment, and baseline-fidelity terms.
  • Uses an efficient block Majorize-Minimize optimizer with Lipschitz bounds derived via the Gershgorin circle theorem.

Sources (1)

PRiSM: Prototype Regularization for Few-Shot VLMs

arXiv cs.CV Ghassen Baklouti, Omprakash Chakraborty, Jose Dolz, Ismail Ben Ayed 2026-07-20 arXiv:2607.17820
Public signals Semantic Scholar citations 0 · Semantic Scholar influential citations 0
Providers: Hugging Face · N/A OpenAlex · N/A Publisher · N/A Semantic Scholar · Citations 0 · Influential citations 0 X · N/A Fetched 2026-08-11 03:02:59.103916 UTC

TL;DR - PRiSM is a plug-and-play prototype regularization method for training-free few-shot adaptation of vision-language models. It improves robustness when labeled examples are class-imbalanced or span many classes.

  • Introduces a Dirichlet-sampled benchmark varying class balance and effective class count.
  • Finds substantial degradation in existing methods under realistic imbalance, sometimes worsening with more labeled samples.
  • Optimizes prototypes using inter-class separation, support-feature alignment, and baseline-fidelity terms.
  • Uses an efficient block Majorize-Minimize optimizer with Lipschitz bounds derived via the Gershgorin circle theorem.
item →