arXiv Machine Learning
Steering Recurrent Reasoners at Inference Time with Readout Feedback
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv AI
Jul 29
Penelope: Localized Latent Recurrence for Efficient Structured Reasoning
arXiv:2607. 25915v1 Announce Type: new Abstract: Complex structured reasoning tasks often require additional computation, yet current language models obtain it mainly by increasing parameter scale or by serializing intermediate steps as chain-of-thought (CoT) tokens.
Hugging Face Trending Papers
Oct 7
Invariant-Measure Reasoners: Stable Representations for Latent Reasoning
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...
arXiv Machine Learning
Oct 9
Invariant-Measure Reasoners: Stable Representations for Latent Reasoning
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 AI
Jul 21
Can We Break LLMs Out of Self-Loops? Fine-Grained Reasoning Control with Activation Steering
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 AI
Sep 2
Latent Recurrent Thoughts: Recurrent Refinement of Proposed Latents for Reasoning with Frozen LLMs
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 Computation and Language
Oct 1
LatentHarness: Learning Latent Actions for Memory and Reasoning via Counterfactual Policy Distillation
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.