Skip to content
Preprint

What Iterated Self-Feeding Probes of Language Models Measure, and a test that separates the construction from the model

Aug 2026 · 3 citations · 17 references
Computer Science

TL;DR

The instrument is validated by reproduction first, recovering a Domany-Kinzel damage field bit-exactly against an independent prediction, and the estimator failures that this discipline caught are reported -- four retracted verdicts, each on a quantity that looked like a measurement.

Abstract

A growing class of methods probes a language model by feeding it its own output: self-consistency, iterated refinement, agentic loops. We ask what such a probe measures, in a construction chosen to make the question sharp: a ring of token cells resampled in place by the model's own windowed conditional p_r(x_i | x_{i+-r}). The substrate is Glauber dynamics on token sequences and is not new; what we change is the coupling. Advancing two rings that differ in one token under common random numbers makes undamaged copies diverge by exactly zero, so damage spreading becomes measurable where a maximal coupling gives mixing times instead. The answer is that it measures two different things at once, in readings that look alike. Some quantities are fixed by the construction: the damage light cone is kinematic, and the radius scaling of the token-space Lyapunov exponent lambda_ca(r) is model-invariant across 19 models and two scale ladders spanning 70x. Others genuinely track the model: lambda_ca crosses zero at a reproducible point in training, and the attractor share ranks models consistently however the lattice is built. Left undistinguished, the first kind is readily mistaken for the second -- we did so ourselves for four months, and report a phase transition we measured to three decimal places that belongs to the probe rather than to any language model. We give the test that separates them: hold the construction fixed and vary the model, or hold the model fixed and vary the construction, and see which readings move. We validate the instrument by reproduction first, recovering a Domany-Kinzel damage field bit-exactly against an independent prediction, and we report the estimator failures that this discipline caught -- four retracted verdicts, each on a quantity that looked like a measurement. The methodology ships as a package.

View source

Similar papers

#machine learning Preprint Oct 2026

Objects Without Morphisms: What LLMs for Mathematics Do Not Represent

Large language models (LLMs) have reached expert-level performance on competition mathematics largely through the volume of search placed around them: candidate solutions are sampled in quantity and retained only when an external criterion accepts them. Such a procedure improves the outcome that survives it while leavi...

Yan-Lin Wang, Sui-Jin Wang, Xiao-Peng Yuan et al. · 0 citations
#natural language process... Preprint Aug 2026

Ladders in Chaos: When, How, (and Perhaps Why) Does Test-Time Scaling Improve LLM Machine Translation

This study shows that sequential sampling has a higher performance ceiling, providing a more diverse and effective pool of samples, particularly under smaller sampling budgets, and suggests an explanation of the mechanism through which sequential scaling improves machine translation.

Di Wu, S. Troshin, C. Monz et al. · 1 citation
#machine learning Preprint Sep 2026

In-Context Binding Capacity in Language Models

This work derives why interference can lower measured capacity by reducing single-binding recall even when the load-dependent recall profile is unchanged, and characterize capacity at the model's query interface.

Manas Venkata Sai Ravulapalli, Samrath Singh Chadha · 0 citations
#artificial intelligence Preprint Sep 2026

Self-Cleaning and Captured Anyway: One Measured Primitive for Error in a Store an Agent Writes to Itself, and What a Falling Score Actually Measures

"An agent that writes its conclusions into a store it later retrieves from closes a loop usually reported as one-way contamination. Taking the loop to the infinite-tenure limit against an append-only store gives a different picture: because writing never deletes, the reachable state space has a hard upper edge at (n-1)...

Wen-Hui Chen, Jian-Lin Chen, Zi-Yao Lin 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.