A Similarity Paradigm Through Textual Regularization Without Forgetting
Fangming Cui, Jan Fong, Rongfei Zeng, Xinmei Tian, Jun Yu

TL;DR
This paper introduces SPTR, a prompt learning method that uses textual regularization and a similarity paradigm to prevent forgetting generalized knowledge, thereby enhancing model robustness and generalization across diverse tasks and datasets.
Contribution
The paper proposes a novel prompt learning framework combining textual regularization with optimal transport and a similarity paradigm to improve generalization without forgetting prior knowledge.
Findings
SPTR outperforms existing prompt learning methods on multiple tasks.
It improves generalization in few-shot, cross-dataset, and domain adaptation scenarios.
The method effectively balances knowledge retention and adaptability.
Abstract
Prompt learning has emerged as a promising method for adapting pre-trained visual-language models (VLMs) to a range of downstream tasks. While optimizing the context can be effective for improving performance on specific tasks, it can often lead to poor generalization performance on unseen classes or datasets sampled from different distributions. It may be attributed to the fact that textual prompts tend to overfit downstream data distributions, leading to the forgetting of generalized knowledge derived from hand-crafted prompts. In this paper, we propose a novel method called Similarity Paradigm with Textual Regularization (SPTR) for prompt learning without forgetting. SPTR is a two-pronged design based on hand-crafted prompts that is an inseparable framework. 1) To avoid forgetting general textual knowledge, we introduce the optimal transport as a textual regularization to finely…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsText and Document Classification Technologies
