Challenge: Existing approaches to cross-document relation extraction (RE) focus on identifying relations between head and tail entities from single sentence or document.
Approach: They propose a hierarchical relation tree-based LLM-based hierarchic classification model for cross-document relation extraction (HCRE) based on predefined relations, the model can perform hierarchically classification level by level.
Outcome: The proposed model outperforms existing baselines and validates its effectiveness.

Similar Papers

Rethinking the Role of LLMs for Document-level Relation Extraction: a Refiner with Task Distribution and Probability Fusion (2025.naacl-long)

Copied to clipboard

Challenge: Document-level relation extraction (DocRE) provides a broad context for extracting relations for entities.
Approach: They propose a method that utilizes LLMs as a refiner and task distribution and probability fusion to refine LLM-based relation extraction methods.
Outcome: The proposed method outperforms existing LLM-based methods without fine-tuning by 25.2% F1.
AutoRE: Document-Level Relation Extraction with Large Language Models (2024.acl-demos)

Copied to clipboard

Challenge: Existing methods for relation extraction are limited to Sentence-level Relation Extraction (SentRE) tasks.
Approach: They propose an end-to-end DocRE model that adopts a novel RE extraction paradigm named RHF (Relation-Head-Facts) Unlike existing approaches, AutoRE does not rely on the assumption of known relation options, making it more reflective of real-world scenarios.
Outcome: The proposed model surpasses TAG by 10.03% and 9.03% on the dev and test set.
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.
ToHRE: A Top-Down Classification Strategy with Hierarchical Bag Representation for Distantly Supervised Relation Extraction (2020.coling-main)

Copied to clipboard

Challenge: Existing methods to find relational facts from texts lack hierarchical information of relations.
Approach: They propose a hierarchical classification framework which extracts relation in a top-down manner.
Outcome: The proposed method significantly outperforms state-of-the-art methods on NYT dataset . the proposed method generates large amounts of training data by aligning KBs with unlabeled corpora .
HiCLRE: A Hierarchical Contrastive Learning Framework for Distantly Supervised Relation Extraction (2022.findings-acl)

Copied to clipboard

Challenge: Existing approaches of distantly supervised relation extraction (DSRE) focus on sentence-level or bag-level de-noising, neglecting the explicit interaction with cross levels.
Approach: They propose a hierarchical contrastive learning framework for distantly supervised relation extraction to reduce noisy sentences.
Outcome: The proposed framework outperforms baselines in various mainstream DSRE datasets.
TTM-RE: Memory-Augmented Document-Level Relation Extraction (2024.acl-long)

Copied to clipboard

Challenge: Existing methods for document-level relation extraction are ineffective in exploiting the full potential of large amounts of training data with varied noise levels.
Approach: They propose a novel approach that integrates a trainable memory module with a noisy-robust loss function that accounts for the positive-unlabeled setting to unlock the full potential of large-scale noisy training data.
Outcome: The proposed model outperforms existing methods on a ReDocRED benchmark dataset with an absolute F1 score improvement of over 3%.
SRF: Enhancing Document-Level Relation Extraction with a Novel Secondary Reasoning Framework (2024.emnlp-main)

Copied to clipboard

Challenge: Existing methods for document-level relation extraction ignore bidirectional mention interaction when generating relational features for entity pairs.
Approach: They propose a document-level relation extraction model that incorporates bidirectional mention fusion and a simple yet effective evidence extraction module for relation prediction.
Outcome: The proposed model achieves SOTA performance and the proposed method is effective and general when integrated into existing models.
Leveraging Taxonomy and LLMs for Improved Multimodal Hierarchical Classification (2025.coling-main)

Copied to clipboard

Challenge: Multi-level Hierarchical Classification (MLHC) is a critical tool in modern data analysis.
Approach: They propose a taxonomy-embedded transitional LLM-agnostic framework for multimodality classification that leverages large language models to enforce consistency across hierarchical levels.
Outcome: The proposed framework improves on the MEP-3M dataset with various hierarchical levels compared to conventional models.
DuRE: Dual Contrastive Self Training for Semi-Supervised Relation Extraction (2024.naacl-long)

Copied to clipboard

Challenge: Existing document-level relation extraction methods require manual training and labeled data to obtain supervised learning.
Approach: They propose a document-level relation extraction framework that integrates RE and text generation as a dual process.
Outcome: The proposed framework significantly boosts recall and F1 score with comparable precision on two document-level RE tasks against several strong baselines.
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.

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