COMM:Concentrated Margin Maximization for Robust Document-Level Relation Extraction
Not on the map. Why?
Abstract (arXiv)
Document-level relation extraction (DocRE) is the process of identifying and extracting relations between entities that span multiple sentences within a document. Due to its realistic settings, DocRE has garnered increasing research attention in recent years. Previous research has mostly focused on developing sophisticated encoding models to better capture the intricate patterns between entity pairs. While these advancements are undoubtedly crucial, an even more foundational challenge lies in the data itself. The complexity inherent in DocRE makes the labeling process prone to errors, compounded by the extreme sparsity of positive relation samples, which is driven by both the limited availability of positive instances and the broad diversity of positive relation types. These factors can lead to biased optimization processes, further complicating the task of accurate relation extraction. Recognizing these challenges, we have developed a robust framework called textitCOMM to better solve DocRE. textitCOMM operates by initially employing an instance-aware reasoning method to dynamically capture pertinent information of entity pairs within the document and extract relational features. Following this, textitCOMM takes into account the distribution of relations and the difficulty of samples to dynamically adjust the margins between prediction logits and the decision threshold, a process we call Concentrated Margin Maximization. In this way, textitCOMM not only enhances the extraction of relevant relational features but also boosts DocRE performance by addressing the specific challenges posed by the data. Extensive experiments and analysis demonstrate the versatility and effectiveness of textitCOMM, especially its robustness when trained on low-quality data (achieves textgreater 10% performance gains).
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 14 of its 27 references that are in the map. First posted on arXiv 18 Mar 2025.
Builds on
14 of 27 references.
References · 14
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2020Document-Level Relation Extraction with Adaptive Thresholding and Localized Context Poolingcited by 115
- 2020Double Graph Based Reasoning for Document-level Relation Extractioncited by 87
- 2020Coreferential Reasoning Learning for Language Representationcited by 80
- 2021Document-level Relation Extraction as Semantic Segmentationcited by 80
- 2021Entity Structure Within and Throughout: Modeling Mention Dependencies for Document-Level Relation Extractioncited by 68
- 2023FlexKBQA: A Flexible LLM-Powered Framework for Few-Shot Knowledge Base Question Answeringcited by 51
- 2021Relation Classification with Entity Type Restrictioncited by 31
- 2021SIRE: Separate Intra- and Inter-sentential Reasoning for Document-level Relation Extractioncited by 30
Built on by
Citing papers per year: 2026: 1.
1 paper.