AIarXiv

Ranked by formulaVerdict: Routine

Surfing the Activation Wave: Analyzing the Information and Geometry of LLM Hidden States for Speculative Decoding

Decoder hidden states from different layers of large language models (LLMs) often encode complementary information.

By Goel, Agrawal, Gagrani +2

Score████░░░░░░4.0

VerdictCompetent work. Briefs at most.

Read the originalPDF

Abstract

Decoder hidden states from different layers of large language models (LLMs) often encode complementary information. However, existing speculative decoding methods typically rely on a small set of target-model layers chosen using fixed, position-based heuristics. Selecting an optimal subset of layers is inherently a combinatorial problem, making exhaustive evaluation infeasible even for moderately deep models. In this work, we present a principled framework for multi-layer hidden-state selection for speculative decoding based on two complementary criteria: informativeness, measured through matrix-entropy analysis, and diversity, quantified using centered kernel alignment (CKA). We investigate layer-wise Shannon entropy, aggregate entropy under hidden-state concatenation, and pairwise CKA dynamics across depth, revealing distinct geometric and informational compartments within decoder representations. Motivated by these findings, we propose entropy and CKA-based layer selection algorithms that favor hidden-state sets that are both highly informative and minimally redundant. As part of this framework, we introduce token-entropy filtering, which removes hidden states associated with low predictive-entropy tokens, thereby improving the quality of layer-selection statistics. In EAGLE3-style speculative decoding, our selected sets outperform fixed baseline choices, including the default $[2, N//2, N-3]$ rule, while providing a clearer explanation of why some defaults can remain competitive. Our results provide a practical recipe for multi-layer hidden-state selection for speculative decoding, insights into the geometry and information in LLM decoder states, and a foundation for extending similar analysis to related applications.

Raghavv Goel, Sudhanshu Agrawal, Mukul Gagrani, Risheek Garrepalli, Mingu Lee

The editor's rubric

Heuristic review

DimensionLevelWeightWhat that level means
Leverage███░░ 324%A method or resource many groups across the field will adopt within a year.
Magnitude███░░ 318%Large gain: roughly 2x, or a clear new state of the art on a hard, unsaturated problem.
Evidence███░░ 314%Solid: multiple benchmarks or cohorts, ablations, fair baselines, released code or data.
Novelty██░░░ 216%A new combination of known ideas.
Trajectory██░░░ 218%Some room to improve with obvious engineering.
Stakes██░░░ 210%Benefits a professional community (practitioners, clinicians, engineers).

Editor’s rationale

Heuristic triage from title and abstract text only, not a reading of the paper. Cues found: method (we propose, new method); gains (outperforms); stakes (general AI).

How the score was computed

rank-2026-10-07

Score████░░░░░░4.0

Score = 10 × (65% × adjusted merit / 10 + 25% × attention + 10% × freshness)

Merit
5.1 / 10
Weighted rubric, evidence-gated.
Adjusted merit
4.4 / 10
Shrunk toward the desk prior by editor confidence (38%).
Attention
36%
Citations, upvotes, points, mentions.
Freshness
26%
Half-life decay since publication.
  • Citations0 (reference 15, via semantic-scholar, Oct 13, 2026, 13:49 UTC)
  • Influential citations0 (reference 3, via semantic-scholar, Oct 13, 2026, 13:49 UTC)
  • Hugging Face upvotes13 (reference 25, via hf-daily, Oct 13, 2026, 13:49 UTC)

The record

  • Reviewed by heuristic-v6 on Oct 12, 2026, 01:23 UTC. Paper type: method.
  • Categories: cs.CL, cs.AI
  • BRIEF, No.5 in the Artificial Intelligence edition of October 14, 2026.