Sep 2026· Journal of King Saud University: Computer and Information Sciences· Vol 38· 0 citations· 46 references
TL;DR
This paper proposes SPO-PA, which combines self-correcting prompt optimization (SPO) and preference alignment (PA), which compares LLM predictions with reference annotations and applies source-specific constraints to these signals.
Abstract
Document-level relation extraction (DocRE) finds relations across a whole document. It often needs evidence from several sentences. It also needs to link repeated entity mentions and follow multi-hop clues. Many large language model (LLM) based DocRE methods use fixed relation descriptions. They make little use of confident errors or samples with missing labels. We propose SPO-PA, which combines self-correcting prompt optimization (SPO) and preference alignment (PA). SPO compares LLM predictions with reference annotations. It then revises relation descriptions, clarifies relation boundaries, and adds role constraints. PA uses false negative (FN) conflicts as the main supervision signal. It also tests false positive (FP) conflicts under similar constraints. PA applies source-specific constraints to these signals. The constraints help smaller DocRE models separate correct relations from wrong candidates. On Re-DocRED, SPO improves F1 to 26.23% and Precision to 41.93%. It also achieves 37.60% F1 on HacRED. Both are the best LLM-only scores in our comparison and reproduce on a second, more recent backbone, though both stay far below supervised encoders; the extraction stage supplies conflict signals rather than final predictions. Among the PA variants, PAFN\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\text {PA}_{FN}$$\end{document} gives the most stable gains on ATLOP, KD-DocRE, DREEAM, and DAATF. The largest gain is 2.89%.
Document-level relation extraction must identify relations when entity mentions and supporting evidence are distributed across multiple sentences. Existing methods often use entity representations that remain fixed after encoding and provide limited support for progressively retrieving and combining dispersed evidence....
Yi Zhang, Xiu-Qi Ruan, Xin-Bin Cheng et al.· Evaluation review· 0 citations
Long-document question-answering experiments show that human-verified TOC hierarchies and contextual relationships improve reasoning, with their combination providing complementary benefits.
Yuefeng Zou, Yi-Chen Lu, Jingxiao Yang et al.· 0 citations
Multi-negative direct preference optimisation (MDPO), a reference-based pairwise objective that compares the correct entity with all valid rejected candidates associated with each mention, demonstrates that incorporating all within-instance negative candidates is a simple and effective improvement for LLM-based histori...
Tien N. Nguyen, Emanuela Boros, Ahmed Hamdi et al.· 0 citations
Collaboration depends on shared context, and technical documentation is one way that context persists across people and AI teammates. Specificity, the amount and exactness of detail expressed in language, shapes what information documentation captures and how precisely that information is communicated. This work audits...
Rocker D'Antonio, Thomas Benton Townsend, D. Manias· 0 citations
The experimental results show that API-based LLM prompting, combined with simple post-processing operations, is competitive for low-resource relation extraction on historical documents, while also raising reproducibility, cost, and data-governance considerations.