Skip to content
Preprint

Beyond the Trace: Coupling an Interpretable Reasoning-State Readout to Native MoE Routing

Aug 2026 · 0 citations · 18 references
Computer Science

TL;DR

A two-level internal readout for mixture-of-experts reasoning that makes latent process state readable, while routing makes it deployable and actionable and improves single-branch selection and plain majority voting over completed candidate sets.

Abstract

What a reasoning model writes is only a partial record of the process that produces it. We introduce a two-level internal readout for mixture-of-experts reasoning. We first distill vocabulary-scale J-space into J64, a 64-axis semantic frame learned from the model's own reasoning states. J64 reveals readable process state that the emitted trace does not show: it separates inference effort from problem-induced strain. It also adds 0.096 to 0.135 held-out AUC over a baseline that reads the same rollout as token occupancy and aggregates it in exactly the same way. We then reconstruct J64 from native expert-routing statistics. The result is R64, a low-overhead proxy: its median per-axis correlation with J64 is 0.69 to 0.86 across three models and two families, and on gpt-oss-20b it preserves 95 to 100% of J64's predictive gain. The readout supports test-time decisions at two temporal resolutions. Over completed candidate sets, J64 and R64 improve single-branch selection, and R64-weighted voting improves plain majority voting in seven of eight settings. During generation, rolling readout windows drive a cumulative stop-and-resample policy whose operating point is fixed on training questions alone. J64 improves accuracy by 1.1 to 5.9 points over a sibling-permuted control, and the routing-only R64 proxy retains 0.9 to 3.2 of those points. Finally, router edits aimed at the mechanism J64 names induce the predicted reasoning behaviors and shift a diagnosed stall from numerical guessing toward exact symbolic execution. Together, J64 makes latent process state readable, while routing makes it deployable and actionable.

View source

Similar papers

ORCA-bench: How Ready Are Language Model Agents for Oncall?

The ORCA-bench benchmark is introduced, a benchmark that puts general-purpose coding agents in a production-fidelity oncall setting and is a lower bound on the engineering investment required before frontier coding agents can be safely entrusted with production reliability.

Albert Gong, Kyuseong Choi, Abhineet Agarwal et al. · 1 citation
Jul 2026

Can We Break LLMs Out of Self-Loops? Fine-Grained Reasoning Control with Activation Steering

This work treats each reasoning trace as a sequence of latent states rather than an unstructured texts, and investigates whether inference time interventions can provide fine-grained control over the self-looping reasoning process.

Sheldon Yu, Tong Yu, Xunyi Jiang et al. · 0 citations
Preprint Aug 2026

One Recipe, Many Harnesses: What Self-Evolution Encodes Across Languages and Models

Together, these results recast the evolved harness as a legible compensation layer, shaped jointly by the language's engineering demands and the model's behavioral gaps, rather than an opaque benchmark-tuned scaffold.

Siqi Yang, Qianlan Yang, Yu-Xiong Wang et al. · 2 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
Preprint Aug 2026

How Much Does a Reasoning Summary Reveal? An Observability Ladder for Large Language Models

An observability ladder is introduced that holds each completed run fixed and varies only what a reader inspects to judge whether the answer is correct: the response, a self-summary the model writes from the trace, the trace itself, and internal signals, each with and without the prompt.

A. Algaba, Francesca Carlon, Lynn Delcon et al. · 0 citations

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