Reinforced knowledge graph search improves LLM fact-checking accuracy

Fact-checking remains a weak point for LLMs, particularly when retrieval systems fail under query variation. DeLIVeR addresses this by treating evidence discovery as a reinforcement learning problem, where a planner LLM breaks down claims into targeted questions that guide traversal through structured knowledge graphs. The framework trains its policy using Group Relative Policy Optimization, optimizing for both structural diversity in evidence and verdict accuracy. Results on three major benchmarks show meaningful gains over existing approaches, suggesting that decomposition plus strategic graph exploration may be a more robust path to grounded reasoning than end-to-end retrieval.
Modelwire context
ExplainerThe key detail the summary underplays is that DeLIVeR's reinforcement signal is dual-objective: it rewards the agent not just for reaching correct verdicts but for structural diversity in the evidence paths it explores, which is a deliberate hedge against the known failure mode where retrieval systems collapse onto superficially similar but informationally redundant sources.
The RL training methodology here sits in direct conversation with MADA-RL, covered the same day, which also applies Group Relative Policy Optimization to shape reasoning behavior in language models through structured role decomposition. Both papers are betting that explicit process rewards, rather than outcome-only supervision, produce more reliable reasoning. The difference is that MADA-RL targets compact models under resource constraints, while DeLIVeR is optimizing for external grounding quality in a fact-checking pipeline. Together they suggest GRPO is becoming a preferred tool for researchers who want to shape how a model reasons, not just what it concludes.
The real test is whether DeLIVeR's gains on LIAR and FEVER hold when evaluated against claims that require multi-hop reasoning across knowledge graphs with sparse or contested edges, since the current benchmarks skew toward claims with relatively clean supporting structure. If a follow-up ablation removes the diversity reward and performance drops significantly on FEVER specifically, that validates the dual-objective design as load-bearing rather than incidental.
Coverage we drew on
This analysis is generated by Modelwire’s editorial layer from our archive and the summary above. It is not a substitute for the original reporting. How we write it.
MentionsDeLIVeR · Qwen2.5-7B · LIAR · FEVER · PolitiFact · Group Relative Policy Optimization
Modelwire Editorial
This synthesis and analysis was prepared by the Modelwire editorial team. We use advanced language models to read, ground, and connect the day’s most significant AI developments, providing original strategic context that helps practitioners and leaders stay ahead of the frontier.
Modelwire summarizes, we don’t republish. arXiv cs.CL originally reported this story as “DeLIVeR: Decomposed Learning for Information-grounded Veracity Recognition via Reinforced Knowledge Graph Exploration”. The full content lives on arxiv.org. If you’re a publisher and want a different summarization policy for your work, see our takedown page.