Learning to Refine Hidden States for Reliable LLM Reasoning

Chia-Hsuan Hsu, Jui-Ming Yao
6/16/2026
cs.LG

No official code found. Best implementation: tongyu0924/Learning-to-Refine-Hidden-States-for-Reliable-LLM-Reasoning (7 stars, MIT, last commit 2026-06-10).

Abstract

Large language models show strong reasoning ability, but their internal reasoning process can remain unstable in complex multi-step settings, where early hidden-state errors may propagate to incorrect predictions. We propose ReLAR, a reinforcement-guided latent refinement framework that iteratively updates hidden representations before decoding. ReLAR maintains a compact latent reasoning state and uses learned depth and action controllers to adaptively determine both the number and direction of refinement steps. The controllers are trained with a policy gradient objective based on step-wise likelihood improvement, enabling efficient input-dependent reasoning without explicit chain-of-thought generation. Experiments on medical, mathematical, multi-hop reasoning, and open-ended generation benchmarks show that ReLAR improves accuracy, generation quality, and reasoning stability with substantially lower inference overhead than explicit reasoning baselines.

View on arXivView PDF

Code Implementations(1)

Similar Papers

Cite this paper

@article{hsu2026learning,
  title  = {Learning to Refine Hidden States for Reliable LLM Reasoning},
  author = {Chia-Hsuan Hsu and Jui-Ming Yao},
  year   = {2026},
  eprint = {2606.17524},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2606.17524v1}
}

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/2606.17524.svg)](https://codeofpaper.com/paper/2606.17524)

Discussion