Friction as a Measurement of the Model: What Per-Token Entropy Density Measures, and When It Is Diagnostic
Per-token entropy — the spread of probability mass over the routes a language model did not take, here called density — is a free, always-available signal. But what does it actually measure about a model, how does it relate to the quantities a practitioner already has, and when is it diagnostic of error? This paper characterises it as a measurement instrument. Four results: (1) on near-greedy short answer spans density’s 0.90–0.98 correlation with perplexity is mechanical geometry, not an empirical equivalence — a two-model sampling sweep shows it degrade as the realised token departs from the argmax; (2) density predicts errors strongly inside a model’s competent regime (per-substrate AUROC 0.79–0.91, cluster-robust CIs) but drops toward chance once the model is crashed or overloaded (0.57–0.60) — its diagnosticity is itself capability-gated, and an effect-size check separates this from class imbalance; (3) the absolute friction level carries a proximity-to-capacity signal that per-substrate normalisation deletes, so a single pooled error-threshold on raw density out-performs the normalised version; (4) surface readability (LIX) is not LLM friction, and the length-weighted sum is a length artefact — density is the clean, length-free estimator. Item-level data and a script-to-dataset manifest are released for full reproducibility. Series position. Paper 27 in the Friction Theory series. It characterises the measurement of the model; it does not claim the framework proposal (Paper 0), the critical-slowing-down early-warning (Paper 2E), the measurement of the mind (Paper 21), or the human-readability side (Paper 16), which it cites as companions. v2 (August 2026) — attribution revision. The quantity is now placed in its lineage. Reading the negative log-probability of a produced token as a processing cost is Hale's (2001) surprisal, given its expectation-based form by Levy (2008), and perplexity is that quantity averaged; density is its distributional sibling. Saying so sharpens Result 1 rather than conceding it, since the two coincide under near-greedy decoding and the temperature sweep is what separates them. Result 2 is now read against the baseline it extends: that a model's output distribution separates its correct from its incorrect answers is Hendrycks & Gimpel (2016), scored by the signal-detection discriminability measure (Green & Swets, 1966). What this paper adds is where that separation stops working — the capability floor below which it collapses, which their models are all above. Mean entropy over a span is placed in the entropy-rate-constancy tradition (Genzel & Charniak, 2002; Levy & Jaeger, 2007) together with the failure to replicate it on neural models (Verma et al., 2023), so the tradition is not presented as settled. Capability-gated diagnosticity, previously written as a measurement-side reflection of a companion framework's claim, is restated as this paper's own result: measured on five substrates, with the base-rate alternative excluded by an effect size that does not depend on base rates, and with the deployment consequence stated. Editorial pass. Earlier versions remain in the version history.
Authors
- Tomas Pødenphant Lund (ORCID: https://orcid.org/0009-0000-4724-2427)
Institutions
- Aarhus University (DK)
Publication Details
- Journal
- Open MIND
- Published
- 2026-08-28
- DOI
- https://doi.org/10.5281/zenodo.20679635
- Primary Topic
- Statistical Mechanics and Entropy
- Type
- preprint