提出真实场景下的事实核查新基准与多代理验证框架。
Recon, Answer, Verify: Agents in Search of Truth
- 设计去噪基准PFO,仅保留真实核查时可用信息。
- 提出三代理迭代验证框架RAV,显著提升跨领域准确率。
- 在低信息量环境下性能下降最小,适合真实应用。
基于大语言模型的自动化事实核查具有可扩展性优势,但现有评估数据集常包含事后分析和标注提示,缺乏现实场景中的即时性。为此,我们构建了包含2,982条政治声明的5类基准数据集PFO,手动移除了所有事后分析和标注线索,确保模型仅使用声明发布时的可用信息进行评估。在该数据集上,模型平均宏F1下降22%。针对现有系统局限,我们提出RAV(Recon Answer Verify)框架,包含问题生成、答案生成和标签生成三个代理,通过迭代生成并回答子问题来验证声明各维度。RAV在跨领域和不同标签粒度下表现优异,在已知基准RAWFC(3分类事实核查)上提升25.28%,在HOVER(2分类百科核查)上分别提升1.54%(2跳)、4.94%(3跳)和1.78%(4跳)。相比基线,其在PFO上的宏F1性能下降仅为16.3%。
原文摘要 · Abstract (English)
Automated fact checking with large language models (LLMs) offers a scalable alternative to manual verification. Evaluating fact checking is challenging as existing benchmark datasets often include post claim analysis and annotator cues, which are absent in real world scenarios where claims are fact checked immediately after being made. This limits the realism of current evaluations. We present Politi Fact Only (PFO), a 5 class benchmark dataset of 2,982 political claims from politifact.com, where all post claim analysis and annotator cues have been removed manually. This ensures that models are evaluated using only the information that would have been available prior to the claim's verification. Evaluating LLMs on PFO, we see an average performance drop of 22% in terms of macro f1 compared to PFO's unfiltered version. Based on the identified challenges of the existing LLM based fact checking system, we propose RAV (Recon Answer Verify), an agentic framework with three agents: question generator, answer generator, and label generator. Our pipeline iteratively generates and answers sub questions to verify different aspects of the claim before finally generating the label. RAV generalizes across domains and label granularities, and it outperforms state of the art approaches on well known baselines RAWFC (fact checking, 3 class) by 25.28%, and on HOVER (encyclopedia, 2 class) by 1.54% on 2 hop, 4.94% on 3 hop, and 1.78% on 4 hop, sub categories respectively. RAV shows the least performance drop compared to baselines of 16.3% in macro f1 when we compare PFO with its unfiltered version.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。