Skip to content

Reasoning Error from Known Fact: Step-Level Self-Consistency Group Relative Policy Optimization for LLM

Jul 2026 · arXiv.org · Vol abs/2607.18915 · 0 citations · 33 references
Computer Science

TL;DR

This work conducts a fine-grained analysis of hallucinations arising in LLM reasoning and finds that the reasoning traces are particularly prone to Context-Sensitive Factual Hallucinations: cases where the model actually has the relevant knowledge, yet makes factual errors due to contextual interference during reasoning.

Abstract

With the rapid advancement of large language models (LLMs), modern systems not only possess strong foundational capabilities and extensive knowledge, but can also solve complex problems via long, multi-step reasoning. However, as reasoning traces become longer, LLMs may produce a substantial amount of hallucinated content during the reasoning process, which is often difficult to detect. In this work, we conduct a fine-grained analysis of hallucinations arising in LLM reasoning and find that the reasoning traces are particularly prone to Context-Sensitive Factual Hallucinations: cases where the model actually has the relevant knowledge, yet makes factual errors due to contextual interference during reasoning. To address this issue, we propose Step-level Self-Consistency Group Relative Policy Optimization (SSC-GRPO), which assigns step-level rewards to reasoning traces by computing self-consistency scores of individual steps across multiple rollouts. Compared with prior methods, SSC-GRPO achieves state-of-the-art performance on both mathematical reasoning benchmarks and hallucination leaderboards. Our results offer a new perspective for detecting and mitigating hallucinations in the reasoning process of large language models.

View source

Similar papers

Jul 2026

REFACT: Adaptive Fact Restatement for Compact and Faithful Chain-of-Thought Reasoning

REFACT is an adaptive fact-restatement citation framework that enables LLMs to determine when contextual grounding is needed and selectively restate source facts at appropriate levels of detail for reliable reasoning.

Zhensheng Jin, Xin Dai, Zhenghao Liu et al. · 0 citations
Preprint Aug 2026

The Tell-Tale Trace: Detecting Reasoning Failures in LLMs Using Chain-of-Thought Dynamics

Results show that capability failures can manifest as distributed, task-dependent changes in the structure of visible reasoning, and that CoT dynamics agnostic to whether the verbalized trace reflects the model's internal computations can help diagnose and correct failures.

Shashwat Sourav, Aishwarya H. Balwani · 1 citation
Preprint Aug 2026

ChainPrune: Evaluating and Reducing Redundancy in Long Chain-of-Thought Reasoning

This work proposes ChainPrune, a novel reasoning path semantic structural optimization method to efficiently and controllably synthesize self-generated high-quality training data and incorporates a DPO-based preference learning method combined with supervised loss, effectively mitigating false reward suppression.

Weihang Pan, Zhengxu Yu, Yuxiang Zhang et al. · 1 citation
Preprint Aug 2026

Reasoning Jury: Multi-Model Consensus for Evaluating Reasoning Traces

Reasoning Jury, a system that replaces the single judge with a jury of LLMs and a moderated consensus mechanism, is introduced to improve the fidelity of judgments for identifying reasoning defects and can be leveraged to understand failure modes of reasoning LLMs on benchmarks, which allows much deeper understanding o...

Congchao Wang, D. Singh, Qiaozi Gao et al. · 0 citations
Book Open access Jul 2026

R3Check: Reinforcement Learning for Iterative Retrieval and Structured Reasoning in Complex Fact Checking

R3Check is proposed, a rule-guided reinforcement learning framework that enables LLMs to perform iterative retrieval–reasoning for multi-hop fact-checking under weak supervision, and demonstrates the potential of pure reinforcement learning to induce effective retrieval–reasoning behaviors for fact-checking under weak...

Peng Qi, Yuyang Zhao, W. Hsu et al. · 0 citations
Jul 2026

Reason Popper-ly: Patching In-Context Reasoning with Inductive Logic Programming

Reason Popper-ly, a neurosymbolic framework that uses inductive logic programming (ILP) to learn relation composition rules from reasoning traces and deploys them as an online verifier for step-level correction, consistently improves terminal accuracy over standard CoT.

Zi-Rong Chen, Mei-Yi Ma · 0 citations

Related blog posts

MIT News · Artificial Intelligence Oct 15, 2026

AI model decodes the language cells use to communicate

A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.

Microsoft Research Blog Oct 15, 2026

Proof-based general-purpose computing with Magnetar

Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.

MIT News · Artificial Intelligence Sep 24, 2026

Estimating suicide risk from text

A new language-processing tool could help identify the highest-risk individuals from natural language, enabling swifter interventions.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.