arXiv:2607.23420cs.CL2026-07

让大模型自我纠错更精准,专治信息抽取中的标签错误

LA-RL: Label-Aware Self-Reflection for Reinforcement Learning in Information Extraction

论文配图:LA-RL: Label-Aware Self-Reflection for Reinforcement Learning in Information Extraction
图 1 · 摘自论文原文
  • 用诊断标签引导大模型自省,定位具体错误类型
  • 在多个数据集上平均提升6.83点F1,OoD关系抽取提升约20点
  • 适合需要高精度结构化输出的工业级信息抽取场景

大语言模型在信息抽取中表现优异,但现有基于反思的纠错方法常与结构化输出不匹配。自由形式的自省可发现错误,却难以区分是遗漏实体、标签错误、边界错位、关系类型无效还是参数顺序颠倒。本文提出LA-RL(Label-Aware Reflective Reinforcement Learning),一种以任务为导向的诊断标签监督框架,通过单一模型完成预测、诊断和修正。训练初始阶段使用标注模型生成的诊断数据进行冷启动微调,随后通过两阶段GRPO优化,直接奖励最终输出质量、格式有效性及首轮正确性,无需过程奖励模型。在命名实体识别、关系抽取和事件抽取任务上均实现优于SFT的性能,包括在SciER关系抽取上平均F1达6.83,分布外关系抽取提升约20点,以及在DuEE1.0上触发词F1提升14.80、论元F1提升17.50。消融实验表明,反思结构具有任务敏感性:关系抽取受益于更强约束,而命名实体识别在领域迁移下需更宽松的修正。

原文摘要 · Abstract (English)

Large language models show strong promise for information extraction (IE), but existing reflection-based correction methods are often misaligned with structured extraction outputs. Free-form self-reflection can flag an error, yet it rarely identifies whether the failure is a missing span, wrong label, boundary mismatch, invalid relation type, or reversed argument order. We introduce LA-RL (Label-Aware Reflective Reinforcement Learning), an outcome-supervised framework that guides IE self-correction with task-grounded diagnostic labels. A single backbone first predicts an extraction, diagnoses task-specific error labels, and then revises its output conditioned on the diagnosis. Training starts from diagnostic data labeled by an annotation model for cold-start supervised fine-tuning and proceeds through two GRPO stages that reward final extraction quality, format validity, and first-pass correctness, without a process reward model. Experiments on named entity recognition, relation extraction, and event extraction show consistent same-backbone gains over SFT, including 6.83 average F1 on SciER relation extraction, about 20 F1 on out-of-distribution relation extraction, and 14.80 trigger F1 plus 17.50 argument F1 on DuEE1.0. Ablations show that reflection structure is task-sensitive: stronger constraints benefit relation extraction, whereas named entity recognition needs less restrictive correction under domain shift.

信息抽取自反思强化学习大模型

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。