Think Deep, Speak Once: Relit, A Recursive Latent Implicit Transformer Framework
On the map: LLM reasoning → Test-time compute and efficient thinking
Abstract (arXiv)
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.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Placed in Test-time compute and efficient thinking, one of 17 directions in LLM reasoning. Builds on 18 of its 25 references that are in the map. First posted on arXiv 8 Aug 2026.
Builds on
18 of 25 references.
Closest ancestors · 4
Same direction, newest first
- 2025A Survey on Latent Reasoning8 Jul
- 2025Hierarchical Reasoning Model26 Jun
- 2025Scaling up Test-Time Compute with Latent Reasoning: A Recurrent Depth Approach7 Feb
- 2024Dualformer: Controllable Fast and Slow Thinking by Learning with Randomized Reasoning Traces13 Oct
Other references · 14
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2020GLU Variants Improve Transformercited by 1,724
- 2019Root Mean Square Layer Normalizationcited by 1,425
- 2024Training Large Language Models to Reason in a Continuous Latent Spacecited by 763
- 2018Universal Transformerscited by 613
- 2024TinyLlama: An Open-Source Small Language Modelcited by 604
- 2016Adaptive Computation Time for Recurrent Neural Networkscited by 479
- 2014Deeply-Supervised Netscited by 364
- 2023Implicit Chain of Thought Reasoning via Knowledge Distillationcited by 165
- 2022Not another Negation Benchmark: The NaN-NLI Test Suite for Sub-clausal Negationcited by 24
- 2023GLoRE: Evaluating Logical Reasoning of Large Language Modelscited by 13
- 2024AlgoFormer: An Efficient Transformer Framework with Algorithmic Structurescited by 11
2 more
Built on by
Citing papers per year: 2026: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2026Latent Recurrent Thoughts: Recurrent Refinement of Proposed Latents for Reasoning with Frozen LLMs
- 2026Bridging the Gap Between Latent and Explicit Reasoning with Looped Transformers
- 2025Latent Chain-of-Thought? Decoding the Depth-Recurrent Transformer
- 2026Thinking in Latents: Adaptive Anchor Refinement for Implicit Reasoning in LLMs
- 2026Loop, Think, & Generalize: Implicit Reasoning in Recurrent-Depth Transformers
- 2025Implicit Reasoning in Large Language Models: A Comprehensive Survey
- 2026J-CoT: Chain-of-Thought in J-Space
- 2026Reproducing Recurrent Transformers: The CoTFormer