Few-Shot Text Classification with Triplet Networks, Data Augmentation, and Curriculum Learning (2021.naacl-main)
Copied to clipboard
| Challenge: | a few-shot text classification task requires a large number of output classes, with few training examples per class. |
| Approach: | They propose a data augmentation technique suitable for training with limited data for few-shot, highly-multiclass text classification scenarios. |
| Outcome: | The proposed technique improves performance on four classification tasks by 3.0% on average. |
Similar Papers
PDAMeta: Meta-Learning Framework with Progressive Data Augmentation for Few-Shot Text Classification (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing text data augmentation methods can not ensure the diversity and quality of the generated data, which leads to sub-optimal performance. |
| Approach: | They propose a meta-learning framework with progressive data augmentation for few-shot text classification using prompt-based data augmented by attention-based methods. |
| Outcome: | The proposed framework outperforms state-of-the-art models and shows better robustness on four public few-shot text classification datasets. |
Neural Data-to-Text Generation with LM-based Text Augmentation (2021.eacl-main)
Copied to clipboard
| Challenge: | Neural data-to-text generation is a difficult task for many new applications because of a lack of training data. |
| Approach: | They propose a few-shot approach that augments the data available for training by generating new text samples based on replacing specific values by alternative ones from the same category and pairing the new text with data samples. |
| Outcome: | The proposed approach outperforms fully supervised sequence-to-sequence models with less than 10% of the training set on both datasets. |
On Evaluation Protocols for Data Augmentation in a Limited Data Scenario (2025.coling-main)
Copied to clipboard
| Challenge: | Textual data augmentation (DA) is a prolific field of study where novel techniques to create artificial data are regularly proposed. |
| Approach: | They propose to use textual data augmentation (DA) to generate new sentences for text classification in a limited data setting. |
| Outcome: | The proposed methods perform better on small data settings and on large datasets, but they are not as effective on large data sets. |
Few-Shot and Zero-Shot Learning for Historical Text Normalization (D19-61)
Copied to clipboard
| Challenge: | Historical text normalization often relies on small training datasets. |
| Approach: | They evaluate 63 multi-task learning configurations for sequence-to-sequence-based historical text normalization across ten datasets from eight languages. |
| Outcome: | The proposed learning architecture outperforms the simple, but strong identity baseline. |
Few-Shot Data-to-Text Generation via Unified Representation and Multi-Source Learning (2023.acl-long)
Copied to clipboard
Alexander Hanbo Li, Mingyue Shang, Evangelia Spiliopoulou, Jie Ma, Patrick Ng, Zhiguo Wang, Bonan Min, William Yang Wang, Kathleen McKeown, Vittorio Castelli, Dan Roth, Bing Xiang
| Challenge: | Existing methods for data-to-text generation focus on specific types of structured data. |
| Approach: | They propose a method that provides a unified representation that can handle various forms of structured data such as tables, knowledge graph triples, and meaning representations. |
| Outcome: | The proposed method improves zero-shot and few-shot scenarios and can adapt to new structured data. |
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. |
FlipDA: Effective and Robust Data Augmentation for Few-Shot Learning (2022.acl-long)
Copied to clipboard
| Challenge: | Existing methods for text data augmentation are limited to simple tasks and weak baselines. |
| Approach: | They propose a data augmentation method FlipDA that uses a generative model and a classifier to generate label-flipped data. |
| Outcome: | The proposed method improves many tasks while not negatively affecting the others. |
FastFit: Fast and Effective Few-Shot Text Classification with a Multitude of Classes (2024.naacl-demo)
Copied to clipboard
| Challenge: | Few-shot prompting of large language models (LLMs) via API calls presents a unique challenge when dealing with a multitude of classes that share similar semantic meanings. |
| Approach: | They present a Python package that integrates batch contrastive learning and token-level similarity score to provide fast few-shot classification. |
| Outcome: | The proposed method significantly improves multi-class classification speed and accuracy across English and Multilingual datasets. |
Dynamic Augmentation Data Selection for Few-shot Text Classification (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Data augmentation is a popular method for fine-tuning pre-trained language models to increase model robustness and performance. |
| Approach: | They propose a dynamic data selection method to select effective augmentation data from different augmentation sources according to the model’s learning stage by identifying a set of augmentation samples that optimally facilitates the learning process of the most current model. |
| Outcome: | The proposed method outperforms strong baselines on a variety of sentence classification tasks. |
A Closer Look At Feature Space Data Augmentation For Few-Shot Intent Classification (D19-61)
Copied to clipboard
| Challenge: | Recent studies have focused on the problem of generalizing from a few examples per category. |
| Approach: | They propose to use feature space data augmentation methods to improve intent classification performance in few-shot setting. |
| Outcome: | The proposed methods improve intent classification performance in few-shot setting beyond transfer learning approaches. |