The paper investigates how continuous latent states in large language models can store multiple reasoning steps through superposition. It challenges the intuition that retaining only the current reasoning frontier is optimal, showing that cumulative superposition of the full reasoning history can actually require fewer representational dimensions. The authors demonstrate that this approach preserves more valid evidence, improves downstream outcome discrimination, and delays unreliability, while also establishing that uniform cumulative weighting of memories is minimax‑optimal for future reasoning.
By Hongyu Gu, Chang Liu, Jingwen Fu
Latent Recurrent Thoughts (LRT) proposes a method for reasoning with frozen large language models by operating in the model’s continuous representation space. A small auxiliary network generates initial latent vectors, which a tiny recurrent reasoner refines over multiple steps, decoupling computational depth from model size. Experiments on symbolic and natural‑language reasoning tasks show that LRT outperforms prior frozen‑decoder continuous‑space methods and chain‑of‑thought prompting while using far less inference compute.
By Zhaoliang Chen, Jie Fu
arXiv:2609.07406v1 Announce Type: new
Abstract: Chain-of-thought (CoT) reasoning improves the reasoning ability of large language models by introducing intermediate computation, but explicit rational...
By Yuwen Hao, Menglin Yang
The paper investigates the effectiveness of activation steering in latent chain-of-thought (CoT) reasoning compared to explicit CoT. It finds that steering continuous latent thoughts yields weaker impacts on language generation, even when hidden representations are shifted similarly. The authors propose a latent-to-language transition gap, supported by evidence of abrupt output distribution changes at the transition boundary and weaker bidirectional control in latent CoT.
By Gaoxiang Huang, Lei Qi
arXiv:2606. 16360v1 Announce Type: cross Abstract: Chain-of-thought (CoT) prompting improves reasoning in large language models (LLMs) by externalizing intermediate computation as discrete text tokens, but this textual interface also introduces redundancy and inference overhead.
By Hanyu Lin, Min Cai, Jiawei Wen, Haodi Zhang
The paper investigates whether different forms of intermediate computation in large language models—such as token-based traces, pause tokens, and latent reasoning—rely on the same underlying mechanism. By training five variants of GPTNeoX on an extended multi-hop reasoning task, the authors find that while vanilla, Chain-of-Thought, and Pause Token models perform well on in-distribution data, they fail to generalize to longer-hop out-of-distribution problems. In contrast, latent-reasoning models exhibit better depth generalization, with causal analysis revealing a sparse recurrent search circuit that implements forward reachability propagation across the graph.