Challenge: Existing methods for relation classification suffer from the scarcity of manually annotated data.
Approach: They propose a novel relation classification model that incorporates query representation into the encoding of novel prototypes and utilizes iteratively to achieve more interaction.
Outcome: The proposed model outperforms the state-of-the-art model on two benchmark datasets.

Similar Papers

A Two-phase Prototypical Network Model for Incremental Few-shot Relation Classification (2020.coling-main)

Copied to clipboard

Challenge: Existing supervised and distantly supervised RC models ignore the emergence of novel relations in open environment.
Approach: They propose a two-phase prototypical network with prototype attention alignment and triplet loss to dynamically recognize the novel relations with a few support instances without catastrophic forgetting.
Outcome: Experiments show that the proposed model performs better on deep learning and few-shot learning . it can recognize the novel relations with a few support instances without catastrophic forgetting .
Density-Aware Prototypical Network for Few-Shot Relation Classification (2023.findings-emnlp)

Copied to clipboard

Challenge: Existing studies treat NOTA as an extra class and treat it the same as known relations.
Approach: They propose a density-aware prototypical network to treat various instances distinctly . they separate known instances and isolate NOTA instances, respectively . their code will be made public after the paper is accepted .
Outcome: The proposed method outperforms strong baselines with robustness towards different NOTA rates.
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.
Enhancing the Prototype Network with Local-to-Global Optimization for Few-Shot Relation Extraction (2025.findings-naacl)

Copied to clipboard

Challenge: Relation Extraction (RE) is a task that aims to extract semantic relationships from unstructured text.
Approach: They propose a local optimization strategy that indirectly optimizes the prototypical networks by optimizing the other information contained within the prototypes.
Outcome: The proposed model improves on the FewRel 1.0 and FewRela 2.0 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.
GRADUAL: Granularity-aware Dual Prototype Learning for Better Few-Shot Relation Extraction (2024.findings-acl)

Copied to clipboard

Challenge: Existing methods for few-shot relation extraction use text labels and context sentences to learn prototype representations.
Approach: They propose a "dual prototype learning method" that integrates text labels and context sentences into prototype representations.
Outcome: The proposed method achieves state-of-the-art performance in few-shot relation extraction.
Learn from Relation Information: Towards Prototype Representation Rectification for Few-Shot Relation Extraction (2022.findings-naacl)

Copied to clipboard

Challenge: Existing methods for Few-shot Relation Extraction focus on implicitly introducing relation information to constrain the prototype representation learning.
Approach: They propose a parameter-less method to promote few-shot relation extraction . they use a prototype rectification module to rectify original prototypes by relation information .
Outcome: The proposed method achieves state-of-the-art on fewRel 1.0 and 2.0 datasets.
RAPL: A Relation-Aware Prototype Learning Approach for Few-Shot Document-Level Relation Extraction (2023.emnlp-main)

Copied to clipboard

Challenge: Existing methods to identify semantic relations between entities are time-consuming and labor-intensive.
Approach: They propose a relation-aware prototype learning method for document-level relation extraction (FSDLRE) they propose RAPL, which judiciously leverages relation descriptions and real NOTA instances as guidance .
Outcome: The proposed method outperforms state-of-the-art approaches by 2.61% F1 . it generates task-specific NOTA prototypes and refines relation prototypes .
Consistent Prototype Learning for Few-Shot Continual Relation Extraction (2023.acl-long)

Copied to clipboard

Challenge: Existing methods for few-shot continual relation extraction are overfitting memory samples, resulting in insufficient activation of old relations and limited ability to handle confusion of similar classes.
Approach: They propose a few-shot continual relation extraction task that uses memory-enhanced modules to train a model on incrementally few-shot data to avoid forgetting old relations.
Outcome: The proposed method outperforms existing methods on two commonly-used 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.

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