Learning to Reason for Hallucination Span Detection

Hsuan Su, Ting-Yao Hu, Hema Swetha Koppula, Kundan Krishna, Hadi Pouransari +5 more
10/2/2025
cs.CLcs.AIcs.LG

No confident code implementation found for this paper.

Abstract

Large language models (LLMs) often generate hallucinations -- unsupported content that undermines reliability. While most prior works frame hallucination detection as a binary task, many real-world applications require identifying hallucinated spans, which is a multi-step decision making process. This naturally raises the question of whether explicit reasoning can help the complex task of detecting hallucination spans. To answer this question, we first evaluate pretrained models with and without Chain-of-Thought (CoT) reasoning, and show that CoT reasoning has the potential to generate at least one correct answer when sampled multiple times. Motivated by this, we propose RL4HS, a reinforcement learning framework that incentivizes reasoning with a span-level reward function. RL4HS builds on Group Relative Policy Optimization and introduces Class-Aware Policy Optimization to mitigate reward imbalance issue. Experiments on the RAGTruth benchmark (summarization, question answering, data-to-text) show that RL4HS surpasses pretrained reasoning models and supervised fine-tuning, demonstrating the necessity of reinforcement learning with span-level rewards for detecting hallucination spans.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{su2025learning,
  title  = {Learning to Reason for Hallucination Span Detection},
  author = {Hsuan Su and Ting-Yao Hu and Hema Swetha Koppula and Kundan Krishna and Hadi Pouransari and Cheng-Yu Hsieh and Cem Koc and Joseph Yitan Cheng and Oncel Tuzel and Raviteja Vemulapalli},
  year   = {2025},
  eprint = {2510.02173},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2510.02173v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2510.02173.svg)](https://codeofpaper.com/paper/2510.02173)

Discussion