2026· Annual Meeting of the Association for Computational Linguistics· pp. 34702-34716· 0 citations· 21 references
Computer Science
TL;DR
The ATGL serves as a general optimization objective that can be readily applied to different DocRE models and outperforms other DocRE losses and achieves state-of-the-art results, while consistently improving the performance of existing DocRE models.
Abstract
Document-level relation extraction (DocRE) aims to determine which relations hold between a given entity pair within a document. As a multi-label classification task, the most commonly adopted paradigm introduces a learnable threshold to distinguish positive and negative classes for an entity pair. Under this paradigm, existing losses decouple the optimization into independent positive and negative losses, which interact solely with a shared threshold. This leads to two inherent limitations: ( i ) threshold instability caused by conflicting gradient updates from the decoupled losses; and ( ii ) optimization bias exacerbated by the severe imbalance between limited positive samples and abundant negative samples inherent in DocRE, which makes the model more likely to predict that no relation exists. To address these issues, we propose the A daptive-T hreshold G lobal L oss (ATGL). Unlike prior work, ATGL integrates positive, negative, and threshold optimization into a unified logit space and explicitly enforces ranking constraints on their contributions to the objective. Furthermore, ATGL incorporates an imbalance-aware optimization mechanism, thereby effectively addressing the severe class imbalance in DocRE. Our ATGL serves as a general optimization objective that can be readily applied to different DocRE models. Experiments on four datasets show that ATGL outperforms other DocRE losses and achieves state-of-the-art results, while consistently improving the performance of existing DocRE models. Code is available at https: //github.com/xhm-code/ATGL .
Document-level relation extraction (DocRE) aims to extract relations among multiple entities across extended contexts while maintaining consistency across predicted triples. Although large language models (LLMs) show remarkable reasoning capabilities in information extraction, their predictions are typically generated...
A dynamic parsing and relationship inference model for entity features that incorporates gating units and pooling strategies to dynamically update hidden states is proposed that outperforms the baseline model Adaptive Thresholding and Localized Context Pooling, particularly in extracting potential relationships across...
Haoxiang Yang, Guang-Hui Chang, Kuo Chen et al.· 0 citations
AssistEM, a framework for efficient LLM adaptation to EM via principled data selection, demonstrates that selective fine-tuning not only accelerates adaptation but also improves training efficiency (requiring fewer GPU hours), enabling open-source LLMs to rival–and in some cases outperform–closed-source models.
John Bosco Mugeni, Steven J. Lynden, Toshiyuki Amagasa et al.· International Journal of Dat...· 1 citation
This work proposes the Cluster-Ranked Identifier (CRID), which decouples DocID into semantic clustering and business-value ranking, yielding collision-free identifiers that support incremental updates via intra-cluster reranking.
Gui Ling, Zhihong Chen, Yu Li et al.· arXiv.org· 2 citations
The results indicate that the proposed framework effectively enhances the quality and structural consistency of generated hyper-relational data while mitigating the effects of long-tail distributions and pseudo-negative samples without requiring additional manual annotations.
Xinzhi Du, Yan Chen, Siqi Xu et al.· Applied Sciences· 0 citations
A framework is proposed that identifies which label pairs the model struggles to distinguish, expands the candidate set to include confusable labels, and generates targeted rules to differentiate between similar candidates, which requires no fine-tuning and transfers to smaller, cheaper models.