Challenge: Modern text classification systems achieve excellent accuracy across tasks and corpora.
Approach: They propose a Reinforcement Learning policy that uses many different aspects of the data and task to select the most informative unlabeled subset dynamically over the course of the AL procedure.
Outcome: The proposed framework outperforms baselines on four complex multi-class, multi-label text classification datasets.

Similar Papers

Investigating Active Learning Sampling Strategies for Extreme Multi Label Text Classification (2022.lrec-1)

Copied to clipboard

Challenge: Large scale, multi-label text datasets with high numbers of different classes are expensive to annotate due to domain experts taking a lot of time working through all the classes.
Approach: They propose to build classifiers on multi-label text datasets using Active Learning to reduce labeling effort.
Outcome: The proposed classifiers can be used to reduce labeling effort on multi-label datasets.
Combining Supervised Learning and Reinforcement Learning for Multi-Label Classification Tasks with Partial Labels (2024.acl-long)

Copied to clipboard

Challenge: Existing supervised learning methods rely on human annotations, but multi-label tasks pose challenges due to the specific domain knowledge and large class sets.
Approach: They propose a framework that can be used to annotate a subset of positive classes from a multi-label dataset.
Outcome: The proposed framework is generalized and effective across multiple tasks.
Self-Training for Sample-Efficient Active Learning for Text Classification with Pre-Trained Language Models (2024.emnlp-main)

Copied to clipboard

Challenge: Existing methods to train models without labeled data are lacking in supervised tasks . a lack of labeles is the main obstacle to real-world applications .
Approach: They propose a semi-supervised approach that uses a model to obtain pseudo-labels for unlabeled data.
Outcome: The proposed method outperforms the reproduced methods on four text classification benchmarks.
Learning a Policy for Opportunistic Active Learning (D18-1)

Copied to clipboard

Challenge: Prior work has shown that opportunistic active learning can be used to improve grounding of natural language descriptions in interactive object retrieval tasks.
Approach: They propose to use active learning to constrain possible queries during interactions to improve grounding of natural language descriptions in an interactive object retrieval task.
Outcome: The proposed policy trades off task completion with model improvement that would benefit future tasks while lowering the cost of annotation without sacrificing model performance.
Active2 Learning: Actively reducing redundancies in Active Learning methods for Sequence Tagging and Machine Translation (2021.naacl-main)

Copied to clipboard

Challenge: Existing approaches to deep learning for NLP require large amounts of labeled data.
Approach: They propose an approach that iteratively selects a small number of examples for expert annotation based on their estimated utility in training the model.
Outcome: The proposed approach reduces the data requirements of state-of-the-art AL strategies by 3-25% on multiple NLP tasks while achieving the same performance with virtually no additional computation overhead.
Active Learning for BERT: An Empirical Study (2020.emnlp-main)

Copied to clipboard

Challenge: Existing approaches to deal with data scarcity are active learning (AL) and pre-trained models are not being considered.
Approach: They propose to use active learning techniques to cope with data scarcity in binary text classification scenarios where the annotation budget is very small and the data is often skewed.
Outcome: The proposed methods improve BERT performance in binary text classification scenarios where the annotation budget is very small and the data is often skewed.
Data-efficient Active Learning for Structured Prediction with Partial Annotation and Self-Training (2023.findings-emnlp)

Copied to clipboard

Challenge: Structured prediction is a fundamental problem in NLP, wherein the label space consists of complex structured outputs with groups of interdependent variables.
Approach: They propose a partial annotation approach that selects only the most informative sub-structures for annotation and a method that incorporates the current model's automatic predictions as pseudo-labels for un-annotated sub-structurals.
Outcome: The proposed approach reduces annotation cost over strong full annotation baselines under a fair comparison scheme that takes reading time into consideration.
Multi-task Active Learning for Pre-trained Transformer-based Models (2022.tacl-1)

Copied to clipboard

Challenge: Multi-task learning requires annotating the same text with multiple annotation schemes, which can be costly and laborious.
Approach: They propose to use multi-task active learning paradigm to optimize annotation processes by iteratively selecting unlabeled examples whose annotation is most valuable for the NLP model.
Outcome: The proposed model minimizes annotation efforts for multi-task NLP models by iterating on the most valuable examples.
Zero-shot Text Classification via Reinforced Self-training (2020.acl-main)

Copied to clipboard

Challenge: Existing methods to learn from unlabeled data are difficult for zero-shot text classification tasks.
Approach: They propose a self-training based method to efficiently leverage unlabeled data.
Outcome: The proposed method significantly outperforms existing methods in zero-shot text classification tasks on benchmarks and a real-world e-commerce dataset.
On the Fragility of Active Learners for Text Classification (2024.emnlp-main)

Copied to clipboard

Challenge: Active learning (AL) techniques optimally utilize a labeling budget by iteratively selecting instances that are most valuable for learning.
Approach: They propose to use active learning techniques to iteratively select instances that are most valuable for learning.
Outcome: The proposed framework is used to benchmark active learning techniques for text classification using pre-trained representations.

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