Skip to content
Preprint

Steering Recurrent Reasoners at Inference Time with Readout Feedback

Aug 2026 · 0 citations · 40 references
Computer Science

TL;DR

Readout Feedback (RoFB), a test-time intervention that converts intermediate predictions into token-wise pairwise coupling forces injected into the latent dynamics, is introduced, suggesting that closed-loop steering of latent dynamics can serve as a complementary inference-time control mechanism for recurrent reasoning models.

Abstract

Recurrent models, which repeatedly update latent states with shared computation blocks, have emerged as powerful architectures for solving complex reasoning tasks. Existing inference-time methods scale computation by running more steps or sampling more trajectories, but ignore information revealed within each trajectory. Here we show that recurrent models can be improved at inference time by using their own readout probabilities to steer latent dynamics without retraining. We introduce Readout Feedback (RoFB), a test-time intervention that converts intermediate predictions into token-wise pairwise coupling forces injected into the latent dynamics. Across three recurrent models (AKOrN, ItrSA++, TRM) on Sudoku and Maze, RoFB yields clear gains in four of six model-task pairs, achieving performance unattainable by merely running more steps or selecting from multiple trajectories, at comparable or lower computational cost. These results suggest that closed-loop steering of latent dynamics can serve as a complementary inference-time control mechanism for recurrent reasoning models.

View source

Similar papers

Jul 2026

Penelope: Localized Latent Recurrence for Efficient Structured Reasoning

Penelope is introduced, an efficient latent-reasoning framework for pretrained decoder-only Transformers that localizes recurrent computation to a selected decoder interval and attains competitive accuracy relative to established latent-reasoning models while reducing measured inference latency.

Yutong Chen, Shouqian Shi, Xin-Ran Liu et al. · 0 citations
Book Open access Aug 2026

InfRL: Inference-time Reinforcement Learning for Research Idea Optimization

Large language models (LLMs) possess extensive latent knowledge yet remain largely static at inference. Once prompted, their generation policy typically cannot evolve, and post-hoc ''self-reflection'' methods provide no explicit principled learning signals. To address this limitation, we formally model iterative resear...

Sikun Guo, Amir Hassan Shariatmadari, Jiuqi Wang et al. · 0 citations
Jul 2026

Latent Memory Palace: Reasoning for Control as Autoregressive Variational Inference

This work shows that reasoning for control policies can emerge by organizing information in an autoregressive latent space reminiscent of a memory palace, where retrieval is iterative and adaptive.

Chu-Ning Zhu, E. Xu, Jose A. Barreiros et al. · 0 citations
Preprint Aug 2026

Allocating Recurrent Compute in Looped Language Models

Results show that the benefits of recurrent depth can be retained without repeatedly executing the dense FFN, and view recurrence as repeated composition of a state update and argue that an application is valuable when it exposes a new cross-position influence direction that remains observable at the task readout.

Ruhai Lin, Yi-Yang Guo, Ruiming Zhu et al. · 4 citations

Dissecting Reinforcement Learning: Mechanisms Behind Compositional Reasoning in LLMs

This thesis proposes a unified two-axis framework that organizes SFT and RL methods along a data axis (off-policy to on-policy) and a loss function axis (positive-only to positive-plus-negative to GRPO) and enables controlled ablations of individual components.

G. Kim, Chair Chenyan Xiong, Aditi Raghunathan · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.