概念约束提示学习用于少样本CLIP适应

Concept-Constrained Prompt Learning for Few-Shot CLIP Adaptation

精选理由

这篇论文提出了CCPL,用概念原型约束提示学习,在DTD和EuroSAT上比CoOp有稳定提升,值得少样本CLIP调优的读者看看。

AI 摘要

提出概念约束提示学习(CCPL)框架,使用共享上下文标记和冻结概念原型,通过文本空间余弦一致性对齐learnable类提示。默认设lambda=0.5、概念dropout p=0.3、弱概念引导融合alpha=0.1。在DTD上基类到新类调和平均数提升0.6,EuroSAT提升2.9,OxfordPets下降0.1。实验表明概念约束在概念原型与数据集语义自然对齐时效果最佳。

原文 · arXiv cs.LG

Concept-Constrained Prompt Learning for Few-Shot CLIP Adaptation

Few-shot prompt learning is an effective strategy for adapting CLIP to downstream tasks, but class-only prompt optimization can overfit base-class supervision and weaken transfer to unseen classes. We propose Concept-Constrained Prompt Learning (CCPL), a lightweight regularization framework that anchors learnable class prompts to frozen concept-level text prototypes without updating CLIP encoders. CCPL learns a set of shared context tokens, instantiates class prompts by appending class names, and constructs frozen concept prototypes from a class-level concept bank. During training, a text-space cosine consistency objective aligns learnable class-prompt embeddings with frozen concept prototypes; concept dropout provides additional regularization against over-reliance on fixed concept lists. At inference, CCPL optionally fuses class-prompt logits with concept-prototype logits using a controllable ensemble weight alpha. Our default configuration uses text-space concept regularization lambda = 0.5, concept dropout p = 0.3 and weak concept-guided fusion (alpha = 0.1), with no KL-based prediction consistency term. Experiments under identical automatically-generated fallback splits show that CCPL improves the base-to-new harmonic mean on DTD (+0.6) and EuroSAT (+2.9) compared with CoOp, while remaining near-neutral on OxfordPets (-0.1). Ablations indicate that text-space concept regularization is consistently beneficial, while the best concept-guided inference strength is dataset- and protocol-sensitive. These results suggest concept constraints are most effective when concept prototypes align naturally with dataset semantics, and identify fine-grained categories as a current boundary condition. The code is released at: https://github.com/richael-sang/concept-constrained-prompt-learning.