paper-with-me

홈 › Papers

Loop, Think, & Generalize: Implicit Reasoning in Recurrent-Depth Transformers

2026-04-09 · Harsh Kohli, Srinivasan Parthasarathy, Huan Sun, Yuekun Yao arxiv

We study implicit reasoning, i.e. the ability to combine knowledge or rules within a single forward pass. While transformer-based large language models store substantial factual knowledge and rules, they often fail to compose this knowledge for implicit multi-hop reasoning, suggesting a lack of compositional generalization over their parametric knowledge. To address this limitation, we study recurrent-depth transformers, which enables iterative computation over the same transformer layers. We investigate two compositional generalization challenges under the implicit reasoning scenario: systematic generalization, i.e. combining knowledge that is never used for compositions during training, and depth extrapolation, i.e. generalizing from limited reasoning depth (e.g. training on up to 5-hop) to deeper compositions (e.g. 10-hop). Through controlled studies with models trained from scratch, we show that while vanilla transformers struggle with both generalization challenges, recurrent-depth transformers can effectively make such generalization. For systematic generalization, we find that this ability emerges through a three-stage grokking process, transitioning from memorization to in-distribution generalization and finally to systematic generalization, supported by mechanistic analysis. For depth extrapolation, we show that generalization beyond training depth can be unlocked by scaling inference-time recurrence, with more iterations enabling deeper reasoning. We further study how training strategies affect extrapolation, providing guidance on training recurrent-depth transformers, and identify a key limitation, overthinking, where excessive recurrence degrades predictions and limits generalization to very deep compositions.

📄 PDF Abstract BibTeX arXiv:2604.07822

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Test-Time Deep Thinking to Explore Implicit Rules

2026-05-24 · Wentong Chen, Xin Cong, Zhong Zhang, Yaxi Lu 외 arxiv

With the continuous advancement of Large Language Models (LLMs), intelligent agents are becoming increasingly vital. However, these agents often fail in environments governed by implicit rules--hidden constraints that ca…

Reinforcement Learning

Inner Thinking Transformer: Leveraging Dynamic Depth Scaling to Foster Adaptive Internal Thinking

2025-02-19 · Yilong Chen, Junyuan Shang, Zhenyu Zhang, Yanxi Xie 외

Large language models (LLMs) face inherent performance bottlenecks under parameter constraints, particularly in processing critical tokens that demand complex reasoning. Empirical analysis reveals challenging tokens indu…

Batch Prompting Suppresses Overthinking Reasoning Under Constraint: How Batch Prompting Suppresses Overthinking in Reasoning Models

2025-11-06 · Saurabh Srivastava, Janit Bidhan, Hao Yan, Abhishek Dey 외 arxiv

Large Reasoning Models (LRMs) achieve strong performance through explicit chain-of-thought reasoning but suffer from \textit{overthinking}: generating excessive reasoning tokens even for trivial queries. {Beyond inflatin…

Is It Thinking or Cheating? Detecting Implicit Reward Hacking by Measuring Reasoning Effort

2025-10-01 · Xinpeng Wang, Nitish Joshi, Barbara Plank, Rico Angell 외 arxiv

Reward hacking, where a reasoning model exploits loopholes in a reward function to achieve high rewards without solving the intended task, poses a significant threat. This behavior may be explicit, i.e. verbalized in the…

Decoding Looped Transformers Better for (Almost) Free

2026-10-01 · Weihao Liu, Huangjie Zheng, Tianrong Chen, Rohit Dilip 외 arxiv

Looped Transformers achieve parameter efficiency by repeatedly executing a shared block across recurrent loops. Each loop yields an intermediate representation decodable for the same next token, yet standard decoding dis…