Invariant-Measure Reasoners: Stable Representations for Latent Reasoning
Read the original on Hugging Face Trending Papers →The Flow has not summarised this story yet — read it at Hugging Face Trending Papers.
The Flow has not summarised this story yet — read it at Hugging Face Trending Papers.
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: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 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.
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:2608. 13570v1 Announce Type: cross Abstract: Latent reasoning has emerged as a powerful alternative to text-based Chain-of-Thought (CoT), offering significant gains in computational efficiency by compressing verbose reasoning into compact embeddings.
LatentHarness unifies memory access and latent reasoning by treating them as sequential latent actions—THINK, RECALL, and EXIT—within a language model. It is trained via counterfactual policy distillation, which evaluates the impact of each action on the emitted token and learns when to recall evidence versus continue reasoning. On six long‑context reasoning benchmarks, a 1.4B‑parameter LatentHarness model outperforms the strongest baselines by 2.8% and 10.0% relative, while running 5.9× faster than the leading long‑context baseline.