Search arXivSearch

arXiv · 2608.03263

The Ignition Is Real, and It Lives at the Readout: Latent composition, difficulty-clocked ignition, and the interface-constituted commit in a recurrent-depth reasoner

Abstract

We test whether the "compositional ignition" reported in latent-reasoning models is real computation, an instrument artifact, or inherited from verbal training data. We grow an independent realization of a published 30M-parameter recurrent-depth reasoner from scratch (same recipe and seed), film its development, certify fidelity through a pre-registered whole-signature gate, and measure resolution in two channels at once: the vocabulary readout and the hidden state. The ignition is real and lives at the readout: arrival time rises lawfully with problem depth, resolution is sharp and holds, and the signature reproduces across two same-seed realizations with divergent training trajectories. At commitment the decision margin jumps 5.8-8.0 logits in one iteration, exceeding the 90th percentile of near-threshold non-event steps in 96% of cases; the signed margin's zero-crossing there is definitional and carries no evidential weight, so the evidence is that conditioned magnitude. The hidden-state direction snaps in raw geometry, meeting its pre-registered criterion (in the decoder's LayerNorm coordinates it attenuates just below our bar, so the composite decoder-coordinate claim is not confirmed), and then freezes in both (descriptively so in decoder coordinates; angular steps 52.9 to 1.2 degrees over eight iterations), while subsequent displacement is predominantly radial (0.961 of squared-norm) and readout-null to a measured bound (radial logit effect <=5.7e-6). An earlier velocity-trough claim is withdrawn: pre-registered normalization controls showed it coordinate-dependent. Intermediates were never recoverable through the tied readout (relay 0.00). All criteria were frozen before their data; the predictions ledger, including this paper's own withdrawn headline, ships in the companion repository.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Simon Lam-Muir. 2026-08-04. The Ignition Is Real, and It Lives at the Readout: Latent composition, difficulty-clocked ignition, and the interface-constituted commit in a recurrent-depth reasoner. https://arxiv.org/abs/2608.03263

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Online Regularized Statistical Learning in Reproducing Kernel Hilbert Space With Non-Stationary Data

We study recursive regularized learning algorithms in the reproducing kernel Hilbert space (RKHS) with non-stationary online data streams. We introduce the concept of a random Tikhonov regularization path and decompose the tracking error of the algorithm's output for the regularization path into random difference equations in RKHS. We show that the tracking error vanishes in mean square and almost surely if the regularization path is slowly time-varying. Then, leveraging the monotonicity of inverse operators and the spectral decomposition of compact operators, and introducing the RKHS persistence of excitation condition, we develop a dominated convergence method to prove the mean square and almost sure consistency between the regularization path and the unknown function to be learned. Especially, for independent and non-identically distributed data streams, the mean square and almost sure consistency between the algorithm's output and the unknown function is achieved if the input data's marginal probability measures are slowly time-varying and the average measure over each fixed-length time period is uniformly above a strictly positive finite Borel measure.

cs.LG

Reflective Policy Optimization

On-policy reinforcement learning methods, like Trust Region Policy Optimization (TRPO) and Proximal Policy Optimization (PPO), often demand extensive data per update, leading to sample inefficiency. This paper introduces Reflective Policy Optimization (RPO), a novel on-policy extension that amalgamates past and future state-action information for policy optimization. This approach empowers the agent for introspection, allowing modifications to its actions within the current state. Theoretical analysis confirms that policy performance is monotonically improved and contracts the solution space, consequently expediting the convergence procedure. Empirical results demonstrate RPO's feasibility and efficacy in two reinforcement learning benchmarks, culminating in superior sample efficiency. The source code of this work is available at https://github.com/Edgargan/RPO.

cs.LG

Transductive Off-policy Proximal Policy Optimization

Proximal Policy Optimization (PPO) is a popular model-free reinforcement learning algorithm, esteemed for its simplicity and efficacy. However, due to its inherent on-policy nature, its proficiency in harnessing data from disparate policies is constrained. This paper introduces a novel off-policy extension to the original PPO method, christened Transductive Off-policy PPO (ToPPO). Herein, we provide theoretical justification for incorporating off-policy data in PPO training and prudent guidelines for its safe application. Our contribution includes a novel formulation of the policy improvement lower bound for prospective policies derived from off-policy data, accompanied by a computationally efficient mechanism to optimize this bound, underpinned by assurances of monotonic improvement. Comprehensive experimental results across six representative tasks underscore ToPPO's promising performance.

cs.LG