Reward-based Input Construction for Cross-document Relation Extraction
Relation extraction (RE) is a fundamental task in natural language processing, aiming to identify relations between target entities in text. While many RE methods are designed for a single sentence or document, cross-document RE has emerged to address relations across multiple long documents. Given the nature of long documents in cross-document RE, extracting document embeddings is challenging due to the length constraints of pre-trained language models. Therefore, we propose REward-based Input Construction (REIC), the first learning-based sentence selector for cross-document RE. REIC extracts sentences based on relational evidence, enabling the RE module to effectively infer relations. Since supervision of evidence sentences is generally unavailable, we train REIC using reinforcement learning with RE prediction scores as rewards. Experimental results demonstrate the superiority of our method over heuristic methods for different RE structures and backbones in cross-document RE. Our code is publicly available at https://github.com/aailabkaist/REIC.
Code (1)
Tasks
RelationRelation ExtractionSentenceSimilar Papers 제목 키워드 기반
Entity-centered Cross-document Relation Extraction
Relation Extraction (RE) is a fundamental task of information extraction, which has attracted a large amount of research attention. Previous studies focus on extracting the relations within a sentence or document, while …
RelationRelation ExtractionSentencePredicting Document Coverage for Relation Extraction
This paper presents a new task of predicting the coverage of a text document for relation extraction (RE): does the document contain many relational tuples for a given entity? Coverage predictions are useful in selecting…
Information RetrievalKnowledge Base ConstructionRelationRelation Extraction+1DocPO: Advancing Document Policy Optimization via Tailored Step-Aware Rewards
Reinforcement learning (RL) for document parsing often relies on reference-based rewards rooted in edit distance (e.g., tree edit distance), yet it remains hard to optimize in the high-accuracy regime because such reward…
Reinforcement LearningReward Learning for Efficient Reinforcement Learning in Extractive Document Summarisation
Document summarisation can be formulated as a sequential decision-making problem, which can be solved by Reinforcement Learning (RL) algorithms. The predominant RL paradigm for summarisation learns a cross-input policy, …
Decision MakingLearning-To-Rankreinforcement-learningReinforcement Learning+2Better Rewards Yield Better Summaries: Learning to Summarise Without References
Reinforcement Learning (RL) based document summarisation systems yield state-of-the-art performance in terms of ROUGE scores, because they directly use ROUGE as the rewards during training. However, summaries with high R…
Reinforcement LearningReinforcement Learning (RL)