Learning to Refine Hidden States for Reliable LLM Reasoning
About
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.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Medical Reasoning | PubMedQA | Accuracy79.23 | 48 | |
| Mathematical Reasoning | GSM-Hard | Accuracy (GSM-Hard)48.57 | 24 | |
| Multi-hop Reasoning | HotpotQA | Accuracy59.64 | 24 | |
| Mathematical Reasoning | GSM8K | Accuracy71.28 | 24 | |
| Text Generation | CommonGen | ROUGE-L38.92 | 17 | |
| Open-ended generation | WritingPrompts | BERTScore87.8 | 8 |