Challenge: Existing methods for fewshot text classification depend on inter-class variance . Existing approaches suffer from MLADA, which performs poorly on tasks with high inter- class variance whereas it fails to distinguish samples from tasks with low inter-group variance.
Approach: They propose a task-adaptive reference transformation network to transform class prototypes to per-class fixed reference points in task-adapted metric spaces.
Outcome: The proposed method surpasses state-of-the-art methods in 1-shot and 5-shot classifications on the 20 Newsgroups dataset.

Similar Papers

Improve Meta-learning for Few-Shot Text Classification with All You Can Acquire from the Tasks (2024.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for few-shot text classification often encounter problems drawing accurate class prototypes from support set samples.
Approach: They propose a meta-learning method that leverages the information within the task itself . they propose Query-Data-Augmenter and Label-Adapter to build a task-adaptive metric space .
Outcome: The proposed method shows obvious advantages over state-of-the-art models on eight benchmark datasets.
Adaptive Meta-learner via Gradient Similarity for Few-shot Text Classification (2022.coling-1)

Copied to clipboard

Challenge: Existing methods for few-shot text classification suffer from overfitting due to the lack of matching between the few amount of samples and complicated models.
Approach: They propose a method to improve model generalization ability to a new task by leveraging a meta-learner via gradient similarity method.
Outcome: The proposed method improves few-shot text classification performance on several benchmarks.
Few-shot Slot Tagging with Collapsed Dependency Transfer and Label-enhanced Task-adaptive Projection Network (2020.acl-main)

Copied to clipboard

Challenge: Existing few-shot learning methods for slot tagging are based on similarity-based methods, but they are difficult to apply to an unseen domain due to the discrepancy of label sets.
Approach: They propose a label-enhanced task-adaptive projection network to transfer abstract label dependency patterns as transition scores into the conditional random field (CRF) Experimental results show that their model significantly outperforms the strongest few-shot learning baseline by 14.64 F1 scores in the one-shot setting.
Outcome: The proposed model outperforms the strongest few-shot learning baseline by 14.64 F1 scores in the one-shot setting.
Meta-Learning Adversarial Domain Adaptation Network for Few-Shot Text Classification (2021.findings-acl)

Copied to clipboard

Challenge: Existing approaches for few-shot text classification rely on exploitation of lexical features and distributional signatures on training data, while neglecting to strengthen the model's ability to adapt to new tasks.
Approach: They propose a meta-learning framework integrated with an adversarial domain adaptation network to improve the model's adaptive ability and generate high-quality text embedding for new classes.
Outcome: The proposed framework outperforms the state-of-the-art models on four datasets and shows clear superiority over existing models.
MetaSLRCL: A Self-Adaptive Learning Rate and Curriculum Learning Based Framework for Few-Shot Text Classification (2022.coling-1)

Copied to clipboard

Challenge: Existing few-shot text classification methods lack labeled data in many scenarios.
Approach: They propose a meta learning framework that obtains different learning rates for different tasks and neural network layers to enable the meta learner to quickly adapt to new training data.
Outcome: The proposed framework can obtain different learning rates for different tasks and neural network layers so as to enable the meta learner to quickly adapt to new tasks.
Diverse Few-Shot Text Classification with Multiple Metrics (N18-1)

Copied to clipboard

Challenge: Existing methods for few-shot learning are insufficient to capture task variations in natural language domains.
Approach: They propose an adaptive metric learning approach that automatically determines the best weighted combination from a set of metrics obtained from meta-training tasks for a newly seen few-shot task.
Outcome: The proposed method performs favorably against state-of-the-art few shot learning algorithms on real-world sentiment analysis and dialog intent classification datasets.
Transductive Learning for Textual Few-Shot Classification in API-based Embedding Models (2023.emnlp-main)

Copied to clipboard

Challenge: Proprietary and closed APIs are impacting the practical applications of natural language processing.
Approach: They propose a scenario where a pre-trained model is served through a gated API . they propose 'transductive inference' that leverages statistics of unlabelled data .
Outcome: The proposed model performs a few-shot classification task with unlabelled data using a gated API . the proposed model can be used to perform the task with a handful of classes .
Meta-Information Guided Meta-Learning for Few-Shot Relation Classification (2020.coling-main)

Copied to clipboard

Challenge: Existing meta-learning models rely on implicit instance statistics and are unreliability and weak interpretability.
Approach: They propose a meta-information guided meta-learning framework that uses semantics to guide meta- learning . experimental results demonstrate the effectiveness of the proposed framework .
Outcome: The proposed framework can establish connections between instance-based information and semantic-based data, enabling faster initialization and adaptation.
SELP: A Semantically-Driven Approach for Separated and Accurate Class Prototypes in Few-Shot Text Classification (2024.findings-acl)

Copied to clipboard

Challenge: Existing methods for few-shot text classification focus on enhancing separation of prototypes without taking semantic relationships into account.
Approach: They propose to utilize semantically enhanced labels to calibrate class Prototypes . they propose a center loss method to enhance intra-class compactness .
Outcome: The proposed method outperforms baseline methods on eight few-shot text classification datasets.
A Neural Few-Shot Text Classification Reality Check (2021.eacl-main)

Copied to clipboard

Challenge: Modern few-shot text classification models struggle when the amount of annotated data is scarce.
Approach: They compare neural few-shot classification models with NLP and computer vision models with transformers to test their performance.
Outcome: The proposed models perform almost equally on ARSC dataset, but not on the intent detection task.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations