Concept Based Continuous Prompts for Interpretable Text Classification
원문 초록
Continuous prompts have become widely adopted for augmenting performance across a wide range of natural language tasks. However, the underlying mechanism of this enhancement remains obscure. Previous studies rely on individual words for interpreting continuous prompts, which lacks comprehensive semantic understanding. Drawing inspiration from Concept Bottleneck Models, we propose a framework for interpreting continuous prompts by decomposing them into human-readable concepts. Specifically, to ensure the feasibility of the decomposition, we demonstrate that a corresponding concept embedding matrix and a coefficient matrix can always be found to replace the prompt embedding matrix. Then, we employ GPT-4o to generate a concept pool and choose potential candidate concepts that are discriminative and representative using a novel submodular optimization algorithm. Experiments demonstrate that our framework can achieve similar results as the original P-tuning and word-based approaches using only a few concepts while providing more plausible results. Our code is available at https://github.com/qq31415926/CD.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
TokenBreak: Bypassing Text Classification Models Through Token Manipulation
Incremental Sequence Classification with Temporal Consistency
Small Language Models in the Real World: Insights from Industrial Text Classification
Token Masking Improves Transformer-Based Text Classification
KDH-MLTC: Knowledge Distillation for Healthcare Multi-Label Text Classification
Towards Robust Few-Shot Text Classification Using Transformer Architectures and Dual Loss Strategies
토론
이 논문과 연결된 포럼 글이 아직 없습니다.