Challenge: Existing methods for text classification fail to generalize to unseen classes with very few labeled text instances per class.
Approach: They propose a meta-learning method which performs instance-wise comparison followed by aggregation to generate class-wise matching vectors instead of prototype learning.
Outcome: Experiments show that the proposed method outperforms existing methods under both the standard and generalized FSL settings.

Similar Papers

Multi-Level Matching and Aggregation Network for Few-Shot Relation Classification (P19-1)

Copied to clipboard

Challenge: Existing methods for few-shot relation classification use supervised training, but lack of large-scale manually labeled data.
Approach: They propose a multi-level matching and aggregation network (MLMAN) for few-shot relation classification.
Outcome: The proposed model achieves state-of-the-art performance on the FewRel dataset.
Active Few-Shot Learning for Text Classification (2025.naacl-long)

Copied to clipboard

Challenge: Recent advances in Large Language Models (LLMs) have boosted the use of Few-Shot Learning (FSL) methods in natural language processing.
Approach: They propose a method that identifies effective support instances from the unlabeled pool and can work with different LLMs.
Outcome: The proposed method improves on five tasks on which it is tested on five LLMs.
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.
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.
Semantic matching for text classification with complex class descriptions (2023.emnlp-main)

Copied to clipboard

Challenge: Existing methods for text classification support zero-shot learning but not both . Existing approaches do not support zero or few-shot, and are insufficient for complex classes .
Approach: They propose a method which rapidly adapts from seen classes to new/unseen ones . they use labels and complex class descriptions to perform zero- and few-shot learning .
Outcome: The proposed method beats baselines on complex class descriptions by 22.48% . it also improves zero-shot learning by 4.29% .
Induction Networks for Few-Shot Text Classification (D19-1)

Copied to clipboard

Challenge: Recent studies have used meta-learning to simulate the few-shot task . however, this sample-wise comparison may be severely disturbed by the various expressions in the same class.
Approach: They propose a meta-learning-based induction network to learn a generalized class-wise representation of each class in a support set.
Outcome: The proposed model outperforms existing state-of-the-art models on a sentiment and dialogue intent datasets.
Decomposed Meta-Learning for Few-Shot Named Entity Recognition (2022.findings-acl)

Copied to clipboard

Challenge: Named entity recognition systems aim at recognizing unseen entity types based on a few labeled examples.
Approach: They propose a decomposed meta-learning approach to solve few-shot span detection and few- shot entity typing problems by introducing a model-agnostic meta-loop algorithm.
Outcome: The proposed approach achieves superior performance over prior methods on benchmarks.
Incremental Few-shot Text Classification with Multi-round New Classes: Formulation, Dataset and System (2021.naacl-main)

Copied to clipboard

Challenge: Text classification is usually studied by labeling texts with relevant categories from a predefined set.
Approach: They propose a task where a system incrementally handles multiple rounds of new classes . they propose two entailment approaches, ENTAILMENT and HYBRID, which show promise .
Outcome: The proposed task is based on a few-shot text classification task in the NLP domain.
Dynamic Semantic Matching and Aggregation Network for Few-shot Intent Detection (2020.findings-emnlp)

Copied to clipboard

Challenge: Recent studies show that multi-level matching is difficult due to the scarcity of available annotated utterances.
Approach: They propose a method where semantic components are distilled from utterances via multi-head self-attention with additional dynamic regularization constraints.
Outcome: The proposed method improves representations of labeled and unlabeled instances while retaining high-level information.
Revisiting Few-shot Relation Classification: Evaluation Data and Classification Schemes (2021.tacl-1)

Copied to clipboard

Challenge: a recent study has focused on few-shot learning (FSL) for relation classification, but it requires large amounts of training data.
Approach: They propose a method for deriving more realistic few-shot test data from available datasets for supervised RC.
Outcome: The proposed method yields a challenging benchmark for FSL-RC on which state of the art models show poor performance.

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