Source-linked AI summary

The Density of Thought: Predicting and Steering Reasoning in Large Language Models

Tanush Kalhan, Anupam Chattopadhyay, Sriram Ranga, Amritendu Mukherjee

arXiv:2610.21286v1cs.AI

TL;DR

The paper asks whether the distribution of information across chain-of-thought steps signals answer correctness and can be steered at inference time. It measures density using LP variance and Caveman compression, then tests its relation to correctness and several steering approaches. Density patterns vary by training paradigm; interventions that work with those patterns improve accuracy, while direct steering sharply reduces it.

  • Problem

    It is unclear whether a structural property of CoT traces can distinguish sound reasoning and be controlled at inference time to improve reliability.

    Source: §1 · p. 1
  • Method

    The study measures CoT step density with LP variance and Caveman compression and evaluates its relationship to correctness and inference-time interventions.

    Source: §3.2 · p. 3, §5.3 · p. 6
  • Results

    Density’s correctness relationship reverses between SFT and RL-distilled models; hint injection with KV-cache steering improves accuracy by +13.3pp, and EGDR improves it by +10.0pp.

    Source: §1 · p. 2, §8 · p. 7
  • Takeaways & Limitations

    Density is functionally load-bearing, so the reported interventions work with natural density organization rather than overriding it.

    Source: §8 · pp. 7–8

    EGDR’s entropy thresholds are derived from the same N=60 set used for evaluation; a held-out development set would be preferable.

    Source: §7 · p. 7

Abstract

from arXiv · show

We investigate whether variation in information density across chain-of-thought (CoT) reasoning steps predicts answer correctness and can serve as a controllable inference-time target. We prompt frozen pretrained models to solve problems via CoT and measure the density of each reasoning step with two independent metrics: LP variance (how unevenly information is distributed across steps, computed as the variance in mean per-token negative log-likelihood) and the Caveman compression ratio. We then test whether density correlates with, and can be steered to improve, answer correctness. Experiments across six model scales, two training paradigms, and 60 GSM8K problems yield four main findings. First, lower LP variance predicts correctness in supervised fine-tuned (SFT) models, but this relationship weakens with scale and reverses in reinforcement-learning (RL) distilled models. Training paradigm therefore appears more influential than model size in determining density behaviour. Second, synthetic experiments reveal an intrinsic complexity preference: models trained on uniformly distributed data learn complexity-favouring distributions 2.0 to 2.6 times more accurately than simplicity-favouring ones. Third, direct inference-time density steering reduces accuracy from 60.0% to 8.3%, indicating that natural density patterns are functionally important to reasoning. Fourth, pre-generation nudging combining hint injection with contrastive KV-cache steering improves accuracy by 13.3 percentage points, consistent across both metrics. Finally, we introduce Entropy-Gated Density Routing (EGDR), a self-supervised method using token-level Shannon entropy to gate proportional KVcache adjustments during generation, improving accuracy by 10.0 percentage points without any external guidance.

1 Introduction, Motivation, and Contributions

The paper asks whether information density—the distribution of predictable and hard-to-predict content across reasoning steps—signals CoT correctness and can be controlled at inference time. It finds that density’s relationship to correctness depends on training paradigm, and reports both harmful direct steering and gains from interventions designed to work with natural density patterns.

1 Introduction, Motivation, and Contributions

  • The paper asks whether a measurable structural property of CoT traces reveals sound reasoning and can be controlled to improve reliability.It proposes information density: genuine computations carry harder-to-predict content than predictable restatements or connective phrasing.Source: §1 · p. 1
  • Uniform Information Density motivates the prediction that correct reasoning chains should distribute information more evenly across steps.The paper tests whether this prediction holds across models, scales, and training paradigms, and whether density can improve accuracy when controlled.Source: §1 · pp. 1–2
  • Lower LP variance predicts correctness under SFT but reverses under RL distillation, making training paradigm more influential than model size.The study spans six model scales and two training paradigms.Source: §1 · p. 2
  • A 2.0–2.6× KL asymmetry shows models favor syntactically complex, high-density text over simplicity-favouring distributions across model sizes.The controlled synthetic experiments attribute this preference to the learning process rather than the training data.Source: §1 · p. 2
  • Naïve density steering reduces accuracy by 51.7pp, motivating interventions that preserve step-level generation integrity.The paper describes density as encoding accumulated computational context in the KV cache; overriding it mid-generation disrupts reasoning coherence.Source: §1 · p. 2
  • +13.3pp on GSM8K from hint injection with contrastive KV-cache steering, and +10.0pp from self-supervised EGDR without external input.The density footprints were confirmed by two independent measurements; EGDR uses per-token Shannon entropy to gate proportional KV-cache correction during generation (p=0.019).Source: §1 · p. 2

2 Related Work

The related work situates density-based reasoning among UID research, synthetic distribution-learning studies, and inference-time steering methods. The paper distinguishes its approach by intervening during a single generation rather than selecting among completed traces or using fixed global steering.

2 Related Work

  • Prior UID work links information distribution to communication: the paper connects discourse peaks and transitions, and cross-linguistic density-speed trade-offs, to CoT’s dense, narrow computational paths.The cited studies are Tsipidi et al. (12) and Aceves and Evans (1).Source: §2 · p. 2
  • Gwak et al. (4) report that selecting traces with more uniform step-level density improves AIME2025 accuracy by 10–32%; EGDR instead shapes density during generation.Zhao et al. (16) describe dense computational steps and sparse explanatory steps, motivating the paper’s concern that global steering can destroy useful structure.Source: §2 · p. 2
  • The paper extends Ranga et al.’s (11) synthetic number-language framework from syntactic cues to complexity-asymmetric distributions, while replicating its uniform-corpus KL result.It also contrasts its cross-generational evidence with Ranga et al.’s (10) GPT-2-based estimate of contraction in high-probability sentence space.Source: §2 · p. 2
  • Unlike self-consistency (14) and reranking, which aggregate or select completed traces with sampling overhead, this approach steers a single greedy generation with ≈0.3% per-token overhead.The paper characterizes its approach as orthogonal to those completed-trace methods.Source: §2 · p. 2
  • EGDR applies continuous, proportional KV correction during generation, unlike entropy-gated branching, post-hoc selection, or fixed global vectors.The paper also repurposes Caveman Compression to measure generated reasoning-step density independently of model probabilities.Source: §2 · pp. 2–3

3 Preliminaries and Density Measurement Framework

The framework treats a CoT trace as autoregressive steps whose information density varies, then measures that variation with model-internal and surface-form signals. It also reports that the cross-generational complexity-preference effect exceeds controlled within-family scaling.

3.1 Information Density in Reasoning Traces

  • A CoT trace comprises autoregressively generated steps that differ in information density: computations contribute hard-to-predict content, while transitions can be nearly deterministic.The paper uses this variation as the central object of study.Source: §3.1 · p. 3

3.2 Density Metrics

  • LP variance measures variation in step-level mean per-token negative log-likelihood after min–max normalization; higher step LP indicates greater density.Z-score normalization is excluded because it forces each chain’s variance to 1.0, removing between-chain signal.Source: §3.2 · p. 3
  • Caveman compression ratio is the fraction of tokens removed by rules stripping predictable grammatical tokens; lower ratios indicate higher density.It uses generated text’s surface form rather than model probabilities, making it independent of LP variance.Source: §3.2 · p. 3
  • The cross-generational complexity-preference effect is +21.3%, exceeding the +13.2% within-family scaling effect over 40× parameters in Pythia.The GPT-2 XL to GPT-Neo transition is weak (p=0.187, LOW tier), and the probability ratio for high- versus low-complexity sentences rises from 1.40 (2019) to 1.50 (2023).Source: Table 1 · p. 3

3.1 Information Density in Reasoning Traces; 3.2 Density Metrics

  • LP variance and Caveman ratio provide independent model-internal and linguistic signals; agreement in direction across conditions supports a density effect rather than a measurement artefact.The framework is motivated by the question of whether correct reasoning chains are more uniformly dense and whether steering density can improve correctness.Source: §3.2 · p. 3, §3.1 · p. 3

4 Information Density as a Signal

The section examines how complexity preference and reasoning density relate to correctness. The relationship between density and correctness varies by training paradigm, while synthetic experiments indicate an intrinsic preference for complex text.

4.1 LLMs Exhibit a Growing Complexity Preference

  • +21.3%: The cross-generational complexity-preference effect exceeds the +13.2% increase within the controlled Pythia family.The GPT-2 XL to GPT-Neo transition is notably weak (p=0.187, LOW tier), localising the major shift to 2021–2023.Source: §4.1 · p. 3
  • 2.0–2.6×: Under otherwise identical synthetic conditions, models learn complexity-favouring distributions more accurately than simplicity-favouring ones, even when training data are uniform.Uniform training still produces a positive complexity bias across models.Source: Table 2 · p. 4, §4.1 · p. 4

4.2 Density Variance Predicts Correctness, but Paradigm Determines Direction

  • SFT correct solutions show lower LP variance at 1.5B, but the signal fades with scale; RL-distilled correct solutions show higher variance at both 1.5B and 7B.The authors conclude that training paradigm, rather than parameter count, determines whether uniform or dual-density patterns characterize correct reasoning.Source: Table 3 · p. 4, §4.2 · pp. 4–5

5 Information Density as a Tool

Direct mid-step density steering can disrupt reasoning, while interventions that preserve generation integrity show improvements in accuracy. The section presents pre-generation hint and cache nudging, token-level entropy-gated routing, and ablations of density measurements and steering strength.

5.1 Naïve Steering Fails, and Reveals Why

  • −51.7pp: Adaptive mid-step steering drops accuracy from 60.0% to 8.3%, as inconsistent injected tokens sever the reasoning trajectory held in the KV cache.The authors’ design principle is to preserve step-level generation integrity, acting before generation or between tokens without interrupting a step.Source: §5.1 · p. 5

5.2 Principled Nudging via Hint Injection and KV Cache Steering

  • +13.3pp: Hint+Cache (D) is the highest-accuracy single condition; EGDR reaches 61.7% (+10.0pp) without external input.The reported comparison uses Qwen2.5-1.5B-Instruct on GSM8K with N=60.Source: Table 5 · p. 5, §5.2 · p. 5, Figure 2 · p. 6
  • Hint alone shifts density in the right direction but reduces accuracy by 5.0pp; cache steering alone adds 1.6pp, with the combination addressing complementary bottlenecks.The hint provides conceptual scaffolding, while cache steering supplies structural context.Source: §5.2 · p. 5

5.3 Entropy-Gated Density Routing (EGDR)

  • EGDR uses per-token Shannon entropy to apply stronger positive KV correction to high-entropy tokens and smaller negative correction to low-entropy tokens, without external guidance.It acts between tokens, preserving step completion; its entropy thresholds are derived from Conditions A–D on the same N=60 evaluation set.Source: Figure 2 · p. 6, §5.3 · p. 6

5.4 Ablation Studies

  • LP variance, per-token entropy, and Caveman compression show consistent directional patterns; EGDR accuracy plateaus at 58.3% for α=0.05–0.20 before reaching 61.7% at α=0.30.The ablation reports no accuracy degradation at α=0.30.Source: §5.4 · pp. 6–7

6 Discussion

The discussion frames information density as a reflection of model state, not a freely adjustable stylistic feature. It connects the effects of steering to both intervention granularity and the model’s training paradigm.

6 Discussion

  • Information density reflects the model’s internal computational state, so overriding it mid-generation can disrupt reasoning coherence.The authors distinguish external adjustment from nudging through the model’s generative process or shaping density before generation.Source: §6 · p. 7
  • Coarse mid-step injection disrupts the KV trajectory, whereas token-level EGDR reinforces the model’s natural density rhythm.The authors attribute the contrast in outcomes to intervention granularity.Source: §6 · p. 7
  • Because density–correctness direction reverses between SFT and RL, interventions should first establish the model’s training paradigm.Reducing variance may suit SFT models, while RL models benefit from non-uniform variance.Source: §6 · p. 7
  • EGDR’s token-level entropy decomposition aligns with acceleration methods that encode low-information steps implicitly, making density steering and acceleration complementary objectives.The discussion identifies SemCoT as an example of such an acceleration method.Source: §6 · p. 7

7 Limitations

The experiments are limited in evaluation scale and benchmark scope, and EGDR’s thresholds and steering direction leave methodological and specificity constraints.

7 Limitations

  • N=60 GSM8K evaluations have limited statistical power, and replication on larger sets and harder benchmarks remains future work.The entropy signal (p=0.019) is identified as the primary quantitative evidence.Source: §7 · p. 7
  • EGDR’s entropy thresholds are derived from the same N=60 evaluation set, rather than a held-out development set.The authors state that held-out threshold selection would be methodologically preferable.Source: §7 · p. 7
  • The steering vector encodes a broad reasoning-mode contrast; high- versus low-entropy contrasts within correct solutions could target density more precisely.The authors expect this more specific vector could improve accuracy and signal strength.Source: §7 · p. 7
  • The cross-generational comparison conflates scale with generation, and matched model sizes are needed to isolate the effects fully.The Pythia experiment provides a scale-controlled lower bound, but does not fully separate the effects.Source: §7 · p. 7

8 Conclusion

The conclusion presents information density as a structural feature of learned reasoning traces and a regime-dependent correctness signal. It reports accuracy losses from disruption and gains from principled interventions, while identifying replication and more targeted steering as next steps.

8 Conclusion

  • 2.0–2.6× KL asymmetry supports an intrinsic complexity bias; disrupting density lowers accuracy 51.7pp, while hint-plus-cache steering and EGDR improve it 13.3pp and 10.0pp.The conclusion characterizes density as structural and says effective use requires treating it as an expression of model state.Source: §8 · p. 7
  • EGDR is self-supervised and adds negligible overhead, offering a path to improve reasoning without retraining, additional data, or external verifiers.The conclusion says it composes naturally with existing decoding-time methods.Source: §8 · pp. 7–8
  • The authors call for larger evaluations, harder benchmarks, held-out threshold studies, and steering directions that target density rather than broad reasoning mode.They also propose future paradigm-adaptive systems that diagnose a model’s density regime before choosing an intervention.Source: §8 · p. 8

Ethical Statement

The work uses public models and benchmarks and reports no private data, human subjects, or newly identified misuse vectors.

Ethical Statement

  • Experiments use publicly available pretrained models and GSM8K, with no private data, proprietary APIs, or human subjects.The synthetic PCFG corpus contains no personally identifiable information.Source: Ethical Statement · p. 8
  • The authors report that the techniques improve accuracy without adding capabilities beyond the base models and identify no new misuse vectors.They acknowledge Claude3 (Opus 4.8) assistance in drafting and take responsibility for the final content.Source: Ethical Statement · p. 8

A Full Cross-Generational Results

Table 8 reports a two-stage Pythia complexity-preference pattern: rapid growth through 410M parameters, followed by near-stasis at 1B–2.8B, suggesting a ceiling around 1B in this architecture.

A Full Cross-Generational Results

  • Pythia’s complexity-preference gap grows rapidly through 410M parameters.Source: Table 8 · p. 9
  • The gap is near-stationary across Pythia models from 1B to 2.8B parameters.Source: Table 8 · p. 9
  • The two-stage pattern suggests a scaling-law ceiling around 1B parameters for this architecture.Source: Table 8 · p. 9
Loading 2610.21286v1…