AtomicCheck: Learning Structured Reasoning for Fact Verification via Protocol-Guided Reinforcement Learning
Abstract
AbstractFact verification is a critical primitive for ensuring the reliability of Large Language Models (LLMs). While frontier LLMs are effective verifiers, their repeated long-context inference incurs substantial costs; meanwhile, existing specialized verifiers face a fundamental dilemma: label-only models suffer from black-box opacity, while free-form rationale generators, whether trained by distillation or explanation-oriented RL objectives, can produce fluent but not structurally checkable explanations. In this work, we propose AtomicCheck a Protocol-Guided Policy Optimization framework that trains specialized verifiers to produce protocol-guided, locally checkable traces, moving beyond opaque label-only predictions and free-form rationales. Rather than cloning teacher traces or optimizing unstructured explanations, AtomicCheck uses RL to make the verification protocol itself part of the policy objective. To preserve semantic integrity during atomic decomposition, we introduce a Contrastive Decomposition Reward that compares decomposed reasoning with a same-backbone holistic counterfactual and penalizes decompositions that reduce verification accuracy. Extensive experiments demonstrate that AtomicCheck outperforms existing specialized verifiers and approaches strong frontier LLMs while producing structured traces that expose local checks behind the final decision.