用推理链直接验证复杂声明,避免分解错误
Reasoning-CV: Fine-tuning Powerful Reasoning LLMs for Knowledge-Assisted Claim Verification
- 不拆分声明,用推理链直接验证原命题
- 80亿参数模型性能超越GPT-4o+CoT等强模型
- 适合需要高精度事实核查的场景
事实核查对遏制虚假信息至关重要,大语言模型(LLMs)已成为利用外部知识评估声明真伪的强大工具。现有基于LLM的方法通常采用‘分解-验证’范式,将复杂声明拆分为独立子声明并分别验证,但此过程常引入错误。为缓解该问题,我们提出‘推理链-验证’(CoT-Verify)范式,利用大模型推理能力生成针对原始复杂声明的推理链验证路径,无需拆解与分阶段验证。基于此范式,我们设计了名为Reasoning-CV的微调方法,包含监督微调(SFT)和自改进直接偏好优化(DPO)两个阶段。仅使用一个80亿参数预训练模型,Reasoning-CV在知识辅助的事实核查任务中表现优于现有‘分解-验证’方法,以及GPT-4o+CoT和o1-preview等强大黑盒模型。代码已开源。
原文摘要 · Abstract (English)
Claim verification is essential in combating misinformation, and large language models (LLMs) have recently emerged in this area as powerful tools for assessing the veracity of claims using external knowledge. Existing LLM-based methods for claim verification typically adopt a Decompose-Then-Verify paradigm, which involves decomposing complex claims into several independent sub-claims and verifying each sub-claim separately. However, this paradigm often introduces errors during the claim decomposition process. To mitigate these errors, we propose to develop the Chain-of-Thought (CoT)-Verify paradigm, which leverages LLM reasoning methods to generate CoT-verification paths for the original complex claim without requiring decompositions into sub-claims and separate verification stages. The CoT-Verify paradigm allows us to propose a natural fine-tuning method called Reasoning-CV to enhance the verification capabilities in LLMs. Reasoning-CV includes a supervised fine-tuning (SFT) stage and a self-improvement direct preference optimization (DPO) stage. Utilizing only an 8B pre-trained LLM, Reasoning-CV demonstrates superior knowledge-assisted claim verification performances compared to existing Decompose-Then-Verify methods, as well as powerful black-box LLMs such as GPT-4o+CoT and o1-preview. Our code is available.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。