mlsanityData to 14 Oct 2026

Why Limit the Residual Stream to Layers and Not Tokens? Persistent Memory for Continuous Latent Reasoning

arXiv 2606.07720 ↗First posted 5 Jun 2026cs.AI cs.CL cs.LGcited by 1

On the map: LLM reasoning → Test-time compute and efficient thinking

Abstract (arXiv)

Large language models (LLMs) have demonstrated remarkable reasoning abilities on mathematical and multi-hop planning tasks. The CoCoNuT (Chain of Continuous Thought) paradigm~citehao2024coconut extends this by enabling models to reason in latent space, exploring multiple reasoning paths simultaneously rather than committing to a single chain early on. However, we identify a limitation we term the concept bottleneck. At each reasoning pass, intermediate hidden states are overwritten, causing the model to lose critical facts computed in earlier steps as reasoning depth increases. We observe this empirically. On HotpotQA, vanilla CoCoNuT (10.4% EM) fails to improve over the CoT baseline (11.0% EM), and performance degrades with curriculum depth on GSM8K. To address this, we propose AGCLR (Adaptive Gated Continuous Latent Reasoning), which augments CoCoNuT with a textitGated Concept Stream. A persistent residual memory maintained across all reasoning passes, controlled by three learned gates: a textitwrite gate that commits intermediate facts to memory, a textitread gate that retrieves relevant prior states, and a textitforget gate that prunes irrelevant context. Evaluated on GSM8K, HotpotQA, and ProsQA using GPT-2 as our base model, AGCLR achieves consistent improvements across all types of datasets. With the performance gap compounding as curriculum depth increases, directly resolving the concept bottleneck. Code available at https://anonymous.4open.science/r/JJJJ/README.md

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Placed in Test-time compute and efficient thinking, one of 17 directions in LLM reasoning. Builds on 12 of its 15 references that are in the map. First posted on arXiv 5 Jun 2026.

Builds on

12 of 15 references.

Closest ancestors · 3

Same direction, newest first

  1. 2026Broken Chains: The Cost of Incomplete Reasoning in LLMs16 Feb
  2. 2025Efficient Post-Training Refinement of Latent Reasoning in Large Language Models10 Jun
  3. 2023Think before you speak: Training Language Models With Pause Tokens3 Oct

Other references · 9

  1. 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,459
  2. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  3. 2018HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answeringcited by 3,754
  4. 2024Training Large Language Models to Reason in a Continuous Latent Spacecited by 797
  5. 2014Neural Turing Machinescited by 644
  6. 2023Implicit Chain of Thought Reasoning via Knowledge Distillationcited by 176
  7. 2024Evaluating Open-Source Sparse Autoencoders on Disentangling Factual Knowledge in GPT-2 Smallcited by 34
  8. 2025FRIT: Using Causal Importance to Improve Chain-of-Thought Faithfulnesscited by 9
  9. 2025Amortized Latent Steering: Low-Cost Alternative to Test-Time Optimizationcited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2026Unlocking the Working Memory of Large Language Models for Latent Reasoning
  2. 2026When to Re-Plan: Subgoal Persistence in Hierarchical Latent Reasoning
  3. 2026Why Struggle with Continuous Latents? Interpretable Discrete Latent Reasoning via Rendered Compression
  4. 2026Learning without Overwriting: A Theory of Self-Distillation and Supervised Fine-Tuning in Continual Reasoning
  5. 2025On the Failure of Latent State Persistence in Large Language Models
  6. 2026Latent Reasoning with Normalizing Flows
  7. 2026Tyler: Typed Latent Reasoning for Language Models -- When to Think, What to Compute, and How Much to Allocate
  8. 2026LaTER: Efficient Test-Time Reasoning via Latent Exploration and Explicit Verification