Classical Sequence Match Is a Competitive Few-Shot One-Class Learner (2022.coling-1)
Copied to clipboard
| Challenge: | Existing models that use transformers are unable to learn new knowledge in the few-shot scenarios. |
| Approach: | They propose a few-shot one-class problem which takes a known sample as a reference to detect whether an unknown instance belongs to the same class. |
| Outcome: | The proposed method significantly outperforms transformer models under meta-learning and fine-tuning. |
Similar Papers
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. |
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. |
MGIMN: Multi-Grained Interactive Matching Network for Few-shot Text Classification (2022.naacl-main)
Copied to clipboard
| 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. |
Learning to Few-Shot Learn Across Diverse Natural Language Classification Tasks (2020.coling-main)
Copied to clipboard
| Challenge: | Pre-trained transformer models have shown great success in improving performance on downstream tasks, but fine-tuning on a new task still requires large amounts of labeled data. |
| Approach: | They propose a method which allows optimization-based meta-learning across tasks . they use transformers to train transformer models and find better generalizations . |
| Outcome: | The proposed method outperforms self-supervised training and pre-trained models on 17 NLP tasks. |
Pre-training to Match for Unified Low-shot Relation Extraction (2022.acl-long)
Copied to clipboard
| Challenge: | Low-shot relation extraction (RE) aims to recognize novel relations with very few or even no samples. |
| Approach: | They propose a method that leverages triplet paraphrase to pre-train zero-shot label matching ability and uses meta-learning paradigm to learn few-shot instance summarizing ability. |
| Outcome: | The proposed method outperforms strong baselines and achieves the best performance on few-shot RE leaderboard. |
Learning Prototype Representations Across Few-Shot Tasks for Event Detection (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing training data for event detection are too expensive to achieve in real applications where novel event types emerge . Typical ED systems require labeled data for each predefined event type, but only a few examples are available. |
| Approach: | They propose to introduce cross-task prototypes to model relationships between training tasks in few-shot learning for event detection. |
| Outcome: | The proposed model improves on three few-shot learning 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. |
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. |
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. |
Towards Realistic Few-Shot Relation Extraction: A New Meta Dataset and Evaluation (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing methods for few-shot relation extraction are not realistic due to the large amount of training data required. |
| Approach: | They propose a meta dataset for few-shot relation extraction based on existing supervised relation extraction datasets and a few-shot form of the TACRED dataset. |
| Outcome: | The proposed methods perform poorly on the few-shot relation extraction task. |