paper-with-me

홈 › Papers

TART: Improved Few-shot Text Classification Using Task-Adaptive Reference Transformation

2023-06-03 · Shuo Lei, Xuchao Zhang, Jianfeng He, Fanglan Chen, Chang-Tien Lu

Meta-learning has emerged as a trending technique to tackle few-shot text classification and achieve state-of-the-art performance. However, the performance of existing approaches heavily depends on the inter-class variance of the support set. As a result, it can perform well on tasks when the semantics of sampled classes are distinct while failing to differentiate classes with similar semantics. In this paper, we propose a novel Task-Adaptive Reference Transformation (TART) network, aiming to enhance the generalization by transforming the class prototypes to per-class fixed reference points in task-adaptive metric spaces. To further maximize divergence between transformed prototypes in task-adaptive metric spaces, TART introduces a discriminative reference regularization among transformed prototypes. Extensive experiments are conducted on four benchmark datasets and our method demonstrates clear superiority over the state-of-the-art models in all the datasets. In particular, our model surpasses the state-of-the-art method by 7.4% and 5.4% in 1-shot and 5-shot classification on the 20 Newsgroups dataset, respectively.

📄 PDF Abstract BibTeX arXiv:2306.02175

Code (1)

slei109/tart 공식 구현 pytorch

Tasks

Few-Shot Text ClassificationMeta-Learningtext-classificationText Classification

Similar Papers 제목 키워드 기반

An empirical study of pretrained representations for few-shot classification

2019-10-03 · Tiago Ramalho, Thierry Sousbie, Stefano Peluchetti

Recent algorithms with state-of-the-art few-shot classification results start their procedure by computing data features output by a large pretrained model. In this paper we systematically investigate which models provid…

Adversarial RobustnessClassificationFew-Shot Image ClassificationGeneral Classification+2

Zero-shot Relation Classification as Textual Entailment

2018-11-01 · WS 2018 11 · Abiola Obamuyide, Andreas Vlachos

We consider the task of relation classification, and pose this task as one of textual entailment. We show that this formulation leads to several advantages, including the ability to (i) perform zero-shot relation classif…

ClassificationGeneral ClassificationKnowledge Base PopulationNatural Language Inference+7

Cold-Start and Interpretability: Turning Regular Expressions into Trainable Recurrent Neural Networks

2020-11-01 · EMNLP 2020 11 · Chengyue Jiang, Yinggong Zhao, Shanbo Chu, Libin Shen 외

Neural networks can achieve impressive performance on many natural language processing applications, but they typically need large labeled data for training and are not easily interpretable. On the other hand, symbolic r…

text-classificationText Classification

Grad2Task: Improved Few-shot Text Classification Using Gradients for Task Representation

2022-01-27 · NeurIPS 2021 12 · Jixuan Wang, Kuan-Chieh Wang, Frank Rudzicz, Michael Brudno

Large pretrained language models (LMs) like BERT have improved performance in many disparate natural language processing (NLP) tasks. However, fine tuning such models requires a large number of training examples for each…

Few-Shot Text ClassificationMeta-Learningtext-classificationText Classification+1

Revisiting Local Descriptor for Improved Few-Shot Classification

2021-03-30 · Jun He, Richang Hong, Xueliang Liu, Mingliang Xu 외

Few-shot classification studies the problem of quickly adapting a deep learner to understanding novel classes based on few support images. In this context, recent research efforts have been aimed at designing more and mo…

ClassificationDecision MakingGeneral Classification