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.

Similar Papers

FewRel: A Large-Scale Supervised Few-Shot Relation Classification Dataset with State-of-the-Art Evaluation (D18-1)

Copied to clipboard

Challenge: Empirical results show that even the most competitive few-shot learning models struggle on this task, especially as compared with humans.
Approach: They propose a Few-Shot Relation Classification Dataset consisting of 70, 000 sentences on 100 relations derived from Wikipedia and annotated by crowdworkers.
Outcome: The proposed methods perform well on the most competitive few-shot learning models, especially as compared with humans.
A Simple yet Effective Relation Information Guided Approach for Few-Shot Relation Extraction (2022.findings-acl)

Copied to clipboard

Challenge: Existing approaches to introduce relation information into the model are limited by labeling and data scarcity.
Approach: They propose a direct addition approach to introduce relation information into a model by concatenating two views of relations and adding them to the original prototype.
Outcome: The proposed approach improves on the benchmark dataset FewRel 1.0 and shows comparable results to the state-of-the-art.
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.
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.
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.
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.
Towards Robust Few-Shot Relation Classification: Incorporating Relation Description with Agreement (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing approaches to recognize relational relationships with a few support samples are limited for unlimited queries.
Approach: They propose a simple but effective framework that uses relation descriptions as external knowledge to enhance the model’s comprehension of the relation semantics.
Outcome: The proposed framework outperforms strong baselines while being robust against various NOTA rates.
Towards Realistic Few-Shot Relation Extraction (2021.emnlp-main)

Copied to clipboard

Challenge: Recent studies have shown that few-shot relation classification models can be used to extract any relation of interest from a collection of text with only a few example instances.
Approach: They propose to modify the training routine to encourage models to better discriminate between relations involving similar entity types.
Outcome: The proposed models outperform human models on relation extraction tasks while relying on entity type information.
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.
Few-Shot Relation Extraction with Hybrid Visual Evidence (2024.lrec-main)

Copied to clipboard

Challenge: Existing few-shot relation extraction methods focus on uni-modal information such as text only. Existing methods focus only on text, requiring only a few labeled instances for training.
Approach: They propose a multi-modal few-shot relation extraction model that leverages both textual and visual semantic information to learn a multiple-modal representation jointly.
Outcome: The proposed model leverages both textual and visual semantic information to learn a multi-modal representation jointly.

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