Hierarchical Attention Prototypical Networks for Few-Shot Text Classification (D19-1)
Copied to clipboard
| Challenge: | Existing methods for text classification are based on large-scale labeled data, but few data are available. |
| Approach: | They propose a hierarchical attention prototypical networks for few-shot text classification . they use attention mechanism to highlight or weaken the importance of features, words, and instances . |
| Outcome: | The proposed model can capture more important features, words, and instances . it can also increase support set augmentability and accelerate convergence speed in training stage . |
Similar Papers
A Hierarchical Neural Attention-based Text Classifier (D18-1)
Copied to clipboard
| Challenge: | Existing hierarchical classification models are unable to handle large corpora and the number of categories increases with increasing corpus. |
| Approach: | They propose to use external knowledge to introduce a hierarchical neural attention-based classifier to help with the classification of documents. |
| Outcome: | The proposed model performs better than or comparable to state-of-the-art hierarchical models at significantly lower computational cost while maintaining high interpretability. |
Multi-Label Few-Shot Learning for Aspect Category Detection (2021.acl-long)
Copied to clipboard
| Challenge: | Existing few-shot learning methods focus on single-label predictions, which can not work well for ACD since a sentence may contain multiple aspect categories. |
| Approach: | They propose a few-shot learning method that uses the prototypical network to learn aspects from a set of aspects. |
| Outcome: | The proposed method significantly outperforms baseline methods on three datasets. |
Hierarchical Verbalizer for Few-Shot Hierarchical Text Classification (2023.acl-long)
Copied to clipboard
| Challenge: | Existing work on the hierarchical text classification problem is limited due to the complexity of label hierarchy and intensive labeling cost. |
| Approach: | They propose a path-based few-shot setting and a strict path-basic evaluation metric to further explore few- shot HTC tasks. |
| Outcome: | The proposed framework outperforms those who inject hierarchy through graph encoders on three popular HTC datasets under the few-shot setting. |
Disentangling Task Relations for Few-shot Text Classification via Self-Supervised Hierarchical Task Clustering (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for Few-Shot Text Classification are limited by their global knowledge-shared mechanisms. |
| Approach: | They propose a self-supervised hierarchical task clustering method to address task heterogeneity . they use prior knowledge from historical tasks to leverage prior knowledge . |
| Outcome: | The proposed method can learn a classifier efficiently with few examples . it disentangles the underlying relations between tasks to improve interpretability . |
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. |
Bridging Text and Knowledge with Multi-Prototype Embedding for Few-Shot Relational Triple Extraction (2020.coling-main)
Copied to clipboard
| Challenge: | Existing approaches to supervised relational triple extraction require huge amounts of labeled data. |
| Approach: | They propose a multi-prototype embedding network model to extract the composition of relational triples from unstructured text. |
| Outcome: | The proposed method improves the performance of the few-shot relational triple extraction problem. |
Few-Shot Text Classification with Edge-Labeling Graph Neural Network-Based Prototypical Network (2020.coling-main)
Copied to clipboard
| Challenge: | a few-shot text classification method is proposed to solve the few-sshot text problem . supervised learning methods require large corpus of labeled data, making them hindered in practical application. |
| Approach: | They propose a few-shot text classification method that takes advantage of advanced pre-trained language models to extract the semantic features of each document. |
| Outcome: | The proposed method achieves state-of-the-art on sentiment analysis and relation datasets. |
Dependency-aware Prototype Learning for Few-shot Relation Classification (2022.coling-1)
Copied to clipboard
| Challenge: | Existing methods for few-shot relation classification fail to distinguish multiple relations that co-exist in one sentence. |
| Approach: | They propose a dependency-aware prototype learning method for few-shot relation classification . they utilize dependency trees and shortest dependency paths as structural information . |
| Outcome: | The proposed method achieves better performance than baselines on the FewRel dataset. |
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. |
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. |