Challenge: Document-Level Relation Extraction is a multi-label classification task . however, most entity pairs do not express any relations .
Approach: They propose to use a distance between the classification threshold and predicted score to reduce the imbalance problem by balancing the easy negatives.
Outcome: The proposed method is superior to other methods, the authors show . it reduces the threshold to an appropriate value, and increases quadratically with the number of entities.

Similar Papers

ATGL: An Adaptive-Threshold Global Loss for Document-level Relation Extraction (2026.acl-long)

Copied to clipboard

Challenge: Document-level relation extraction (DocRE) aims to determine which relations hold between a given entity pair in a document.
Approach: They propose a document-level relation extraction paradigm that decouples existing losses into independent positive and negative losses, which interact solely with a shared threshold.
Outcome: The proposed model outperforms existing models on four datasets and achieves state-of-the-art results.
An Adaptive Multi-Threshold Loss and a General Framework for Collaborating Losses in Document-Level Relation Extraction (2025.findings-acl)

Copied to clipboard

Challenge: Document-level relation extraction (DocRE) aims to identify relations for a given entity pair within a document.
Approach: They propose to partition the label space into different sub-label spaces and learn an adaptive threshold for each sub-labeled space.
Outcome: The proposed model outperforms single-loss methods on the concurrent application of multiple losses across four datasets.
Towards Integration of Discriminability and Robustness for Document-Level Relation Extraction (2023.eacl-main)

Copied to clipboard

Challenge: Document-level relation extraction (DocRE) predicts relations for entity pairs relying on context-dependent reasoning . a large number of annotation errors can make it difficult to distinguish large semantically close relations .
Approach: They propose a loss function to improve discriminability and robustness for DocRE . they also propose supervised contrastive learning and negative label sampling strategy .
Outcome: The proposed method achieves state-of-the-art results on the DocRED dataset and its recently cleaned version.
Document-Level Relation Extraction with Adaptive Focal Loss and Knowledge Distillation (2022.findings-acl)

Copied to clipboard

Challenge: Document-level relation extraction (DocRE) is a more challenging task than sentence-level one.
Approach: They propose a semi-supervised framework for document-level relation extraction with three components . they use an axial attention module for learning the interdependency among entity-pairs .
Outcome: The proposed model outperforms baseline models on two DocRE datasets and outperformed previous models on human annotated data and distantly supervised data.
A Unified Positive-Unlabeled Learning Framework for Document-Level Relation Extraction with Different Levels of Labeling (2022.emnlp-main)

Copied to clipboard

Challenge: Existing document-level relation extraction methods focus on fully supervised scenarios but in real-world, incomplete labeling is a common problem because the number of entity pairs grows quadratically with the number.
Approach: They propose a positive-unlabeled learning framework for document-level relation extraction (RE) that uses shift and squared ranking loss positive- unlabeles (SSR-PU) learning to solve incomplete labeling problem.
Outcome: The proposed framework outperforms state-of-the-art methods under fully supervised and extremely unlabeled conditions and achieves 14 F1 points over the baseline with incomplete labeling.
DocRED: A Large-Scale Document-Level Relation Extraction Dataset (P19-1)

Copied to clipboard

Challenge: Existing relation extraction methods focus on extracting intra-sentence relations for single entities.
Approach: They propose a relation extraction dataset from Wikipedia and Wikidata with three features . document-level relation extraction is a task to identify relational facts between entities .
Outcome: The proposed dataset is the largest human-annotated dataset for document-level RE from plain text.
Document-Level Relation Extraction via Pair-Aware and Entity-Enhanced Representation Learning (2022.coling-1)

Copied to clipboard

Challenge: Existing document-level relation extraction methods are sparse in relational entity pairs and the representation of entity pairs is insufficient.
Approach: They propose a Pair-Aware and Entity-Enhanced(PAEE) model to solve two challenges . they propose predicting potential relational entity pairs and assembling directional entity pairs .
Outcome: The proposed model can obtain state-of-the-art performance on four benchmark datasets . it can predict potential relational entity pairs and assemble directional entity pairs .
HiURE: Hierarchical Exemplar Contrastive Learning for Unsupervised Relation Extraction (2022.naacl-main)

Copied to clipboard

Challenge: Existing methods to extract relational feature signals from natural language sentences use self-supervised clustering and classification that cause gradual drift problems.
Approach: They propose a framework that derives hierarchical signals from relational feature space using cross hierarchy attention and effectively optimizes relation representation of sentences under exemplar-wise contrastive learning.
Outcome: The proposed framework can extract the relationship between entities from natural language sentences without prior knowledge on relation scope or distribution.
Revisiting DocRED - Addressing the False Negative Problem in Relation Extraction (2022.emnlp-main)

Copied to clipboard

Challenge: Using incomplete annotations, we find that false negative samples are prevalent in the DocRED dataset . we reannotate 4,053 documents in the dataset by adding the missed relation triples back to the original DocRED.
Approach: They propose to re-annotate 4,053 documents in the document-level relation extraction dataset by adding missing relation triples back to the original DocRED.
Outcome: The proposed dataset improves on the existing DocRED dataset by 13 F1 points.
Towards Better Document-level Relation Extraction via Iterative Inference (2022.emnlp-main)

Copied to clipboard

Challenge: Existing methods only consider feature information of entity pairs, but our model exploits both feature information and previous predictions of entity pair.
Approach: They propose a document-level relation extraction model with iterative inference to extract relations between entities from raw texts.
Outcome: The proposed model outperforms existing methods on three commonly-used datasets.

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