Veri-R1: Toward Precise and Faithful Claim Verification via Online Reinforcement Learning

Read full text
Authors: Qile He, Cheng Qian, Xiusi Chen, Bin He, Yi R. Fung, Heng Ji
Cited by: 0

Abstract

Claim verification with large language models (LLMs) has recently attracted growing attention, due to their strong reasoning capabilities and transparent verification processes compared to traditional answer-only judgments.However, existing approaches to online claim verification, which requires iterative evidence retrieval and reasoning, still mainly rely on prompt engineering or pre-designed reasoning workflows, without unified training to improve necessary skills.Therefore, we introduce Veri-R1, an online reinforcement learning (RL) framework that enables an LLM to interact with a search engine and to receive reward signals that explicitly shape its planning, retrieval, and reasoning behaviors.The dynamic interaction between models and retrieval systems more accurately reflects real-world verification scenarios and fosters comprehensive verification skills.Empirical results show that Veri-R1 improves joint accuracy by up to 30% and doubles evidence score, often surpassing its larger-scale model counterparts.Ablation studies further reveal the impact of reward components, and the link between output logits and label accuracy.Our results highlight the effectiveness of online RL for precise and faithful claim verification, and provide a foundation for future research.

Fields of Study & Subjects

Law Economics and Judicial Systems Artificial Intelligence in Law AI and Intellectual Property

Publication details

Journal / source
Findings of the Association for Computational Linguistics: ACL 2026
Publisher
Association for Computational Linguistics
Pages
20372–20391
Publication date
1 January 2026
Language
EN