通过自适应负样本抑制提升视觉语言模型少样本泛化能力
Generalizable Vision-Language Few-Shot Adaptation with Predictive Prompts and Negative Learning
- 按查询动态选择最易混淆的类别进行负样本抑制,无需额外参数
- 用大模型生成对比提示词,强化关键类间的文本区分边界
- 自动融合视觉与语言特征,免调参且抗噪声能力强
视觉语言模型的少样本适配仍受限于推理阶段负类信号的处理方式。现有方法对所有查询采用统一负样本抑制,忽略了最致命的混淆是查询相关的,并随支持集几何结构变化。我们提出SCAN(选择性混淆感知负样本)框架,通过三项贡献填补这一空白:在推理时,查询自适应负样本路由仅对每个查询的前K个最易混淆类别实施抑制,零额外参数;通用负样本模板被大模型生成的对比提示替代,描述易混淆类别对之间的判别性特征,强化关键位置的文本决策边界;基于支持集费舍尔可分性估算的无参数自适应融合权重,消除视觉-语言权衡的手动调参。在11个标准基准上评估,SCAN在16样本下平均领先先前提示和适配器方法4.61%,细粒度数据集最高提升7.70%。在分布外场景下也表现优异,四类ImageNet OOD变体平均提升2.95%,在标签噪声达50%时仍优于最强竞争方法的干净基线。
原文摘要 · Abstract (English)
Few-shot adaptation of vision-language models remains fundamentally limited by how negative class signals are handled at inference. Existing methods apply uniform negative suppression across all queries, ignoring that the most damaging confusions are query-specific and shift with support-set geometry. We introduce SCAN (Selective Confusion-Aware Negatives), a framework that addresses this gap through three targeted contributions. In inference, query-adaptive negative routing restricts suppression to the top-K most confusable classes per query, requiring zero additional parameters. Generic negative text templates are replaced with LLM-bootstrapped contrastive prompts that describe discriminative attributes between confusable class pairs, sharpening the textual decision boundary where it matters most. A parameter-free adaptive fusion weight estimated from support-set Fisher discriminability removes the need for manual tuning of the vision-language trade-off. Evaluated across 11 standard benchmarks, SCAN consistently outperforms prior prompt-based and adapter-based methods by an average of 4.61% at 16-shot, with gains of up to 7.70% on fine-grained datasets where inter-class confusion is most severe. SCAN also generalizes strongly under distribution shift, improving by 2.95% on average across four ImageNet OOD variants, and maintains robust performance under significant label noise, with accuracy under 50% label corruption still exceeding the clean baseline of the strongest competing method.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。