arXiv:2608.24136v1 Announce Type: new Abstract: Recurrent models, which repeatedly update latent states with shared computation blocks, have emerged as powerful architectures for solving complex reas...
Latent reasoning models repeatedly update a latent state using the same recurrent block. As the recurrent depth increases, the sequence of latent states may converge to a compact subset of the state s...
Invariant-Measure Reasoners (ImR) introduce a stable representation for latent reasoning models by using an invariant measure that captures the long‑run distribution of latent states on a compact subset of the state space. Unlike traditional approaches that predict from a single latent state, ImR predicts from the expectation of the prediction head’s output under this invariant measure, thereby reducing prediction instability across recurrent depths. Experiments on maze and Sudoku tasks show that both fine‑tuning and training from scratch with ImR improve accuracy and allow models to exploit non‑fixed‑point dynamics that were previously destabilizing.
arXiv:2607. 09698v1 Announce Type: new Abstract: Recent latent reasoning methods, such as CODI and COCONUT, face a fundamental interpretability problem: they maintain multiple superimposed candidate traces in the hidden space at each step, unlike explicit- CoT, which follows a single transparent reasoning trace.
arXiv:2606. 29164v1 Announce Type: cross Abstract: Latent reasoning models perform multi-step inference directly in hidden-state space, yet the structure of these latent reasoning trajectories remains poorly understood.
arXiv:2609.24196v1 Announce Type: new Abstract: Looped Language Models (LoopLMs) perform "latent reasoning" by recursively refining internal latent representations with shared weights, offering a mor...
arXiv:2607. 18100v1 Announce Type: new Abstract: Extended reasoning has become standard for frontier Large Language Models (LLMs), yet the trajectories these models produce remain largely uncontrollable.
arXiv:2609.36636v1 Announce Type: new Abstract: Looped language models (LoopLMs) increase computational depth through parameter sharing, offering a path to scale inference computation without adding...
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.
The paper investigates how monitoring the internal representations of Large Reasoning Models (LRMs) during their Chain-of-Thought (CoT) reasoning can predict future behavior. By evaluating a probe at each generated token, the authors construct probe trajectories that capture the continuous evolution of a concept’s probability, and extract signal‑processing features to characterize volatility, trend, and steady‑state behavior. These trajectory features improve predictive performance over static probes, adding an average of 21.7 AUROC points, and the study demonstrates that template‑based training data and pooling operations are essential for effective monitoring across multiple reasoning models and datasets.
arXiv:2505. 24273v2 Announce Type: replace Abstract: Recent advancements in large language models (LLMs) suggest that reinforcement learning (RL) effectively internalizes search strategies, yielding significant improvements on challenging reasoning tasks through extended chains of thought.
The paper introduces InfiLoop, a loop-native residual connection designed for looped Transformers to prevent performance degradation as iterations increase. InfiLoop learns which past computations to retain and how much to accept from each new update, combining content-based weighting with learned temporal decay to maintain a running summary of recurrent states. Across extensive reasoning tasks, a 7M-parameter InfiLoop model outperforms existing recursive architectures, achieving 97.9% exact accuracy on Sudoku-Extreme and 13.6% pass@2 on ARC-AGI-2, and continues to improve with test-time looping beyond 20,000 effective steps.