ReLIT (Recursive Latent Implicit Transformer), a hybrid framework that grounds deep recursive reasoning within the rich semantic representations of a foundational model, is introduced, offering a principled framework for semantically grounded implicit reasoning.
Abstract
Chain-of-Thought (CoT) prompting has become the dominant paradigm for eliciting reasoning in Large Language Models (LLMs), yet it creates substantial computational overhead by forcing models to externalize intermediate reasoning steps as discrete tokens. Recent latent reasoning approaches attempt to internalize this process within continuous hidden states. One of the latest advancements in the field of latent reasoning, Tiny Recursive Models (TRMs) excel at symbolic reasoning but struggle to preserve semantic coherence in natural language settings. To bridge this gap, we introduce ReLIT (Recursive Latent Implicit Transformer), a hybrid framework that grounds deep recursive reasoning within the rich semantic representations of a foundational model. ReLIT augments a frozen LLM backbone (TinyLlama-1.1B) with a lightweight, trainable recursive block that iteratively refines its latent thinking (z) before committing to a final output, structurally solving linguistic intuition from algorithmic processing and enabling"deep thinking"via gradient-isolated recurrent loops without the latency of explicit token generation. Empirically, ReLIT achieves high parameter efficiency on the GLoRE logical reasoning benchmark, matching or outperforming significantly larger models on challenging tasks such as ProofWriter and RuleTaker despite minimal supervision. These results demonstrate that reasoning capability can be scaled efficiently through recurrent depth rather than parameter width, offering a principled framework for semantically grounded implicit reasoning.
Latent Recurrent Thoughts substantially outperforms prior frozen-decoder continuous-space reasoning methods under an identical decoder, prompt, data, and training budget, and outperforms non-thinking-mode chain-of-thought prompting on the same backbone at a small fraction of its inference compute.
Under matched backbone and inference settings, J-CoT-Zero matches or exceeds the strongest evaluated latent-reasoning baseline on every benchmark, while J-CoT-Train obtains the highest score across the evaluated mathematical, scientific, coding, and structured path-reasoning tasks.
Jun-De Wu, Jiayuan Zhu, Feng-Lin Liu et al.· arXiv.org· 1 citation
Penelope is introduced, an efficient latent-reasoning framework for pretrained decoder-only Transformers that localizes recurrent computation to a selected decoder interval and attains competitive accuracy relative to established latent-reasoning models while reducing measured inference latency.
Yutong Chen, Shouqian Shi, Xin-Ran Liu et al.· arXiv.org· 0 citations
LatentMT is introduced, the first systematic study of latent-reasoning LoopLMs for machine translation that adapts a small 2.6B-parameter backbone model with lightweight training and shows that hidden-representation differences shrink along the recurrent reasoning-step axis, supporting the observed saturation in perfor...
Wei-Rui Chen, Samar M. Magdy, Chiyu Zhang et al.· arXiv.org· 0 citations
MUX, a simple method for high-bandwidth and compact reasoning based on distillation of discrete reasoning into continuous multiplexed tokens in a latent space, is proposed and suggests that lossless superposition as local learning targets constitutes a sufficient condition for achieving strong and efficient latent cont...
Ayhan Suleymanzade, Halil Alperen Gozeten, Michael M. Bronstein et al.· 1 citation
Hourglass reasoning is introduced, which enforces strict context isolation between reasoning stages, and raises best-of-5 accuracy over an iterative-refinement baseline with GPT-5.5 and Gemini 3.1 Pro.
Huan Zhu· arXiv.org· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.