mlsanityData to 7 Oct 2026

Hidden States as Early Signals: Step-level Trace Evaluation and Pruning for Efficient Test-Time Scaling

arXiv 2601.09093 ↗First posted 14 Jan 2026cs.LGcited by 10

On the map: LLM reasoning → Test-time compute and efficient thinking

Abstract (arXiv)

Large Language Models (LLMs) can enhance reasoning capabilities through test-time scaling by generating multiple traces. However, the combination of lengthy reasoning traces with multiple sampling introduces substantial computation and high end-to-end latency. Prior work on accelerating this process has relied on similarity-based or confidence-based pruning, but these signals do not reliably indicate trace quality. To address these limitations, we propose STEP: Step-level Trace Evaluation and Pruning, a novel pruning framework that evaluates reasoning steps using hidden states and dynamically prunes unpromising traces during generation. We train a lightweight step scorer to estimate trace quality, and design a GPU memory-aware pruning strategy that triggers pruning as the GPU memory is saturated by KV cache to reduce end-to-end latency. Experiments across challenging reasoning benchmarks demonstrate that STEP reduces end-to-end inference latency by 45%-70% on average compared to self-consistency while also improving reasoning accuracy. Our code is released at: https://github.com/Supercomputing-System-AI-Lab/STEP

Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Placed in Test-time compute and efficient thinking, one of 17 directions in LLM reasoning. Builds on 17 of its 34 references that are in the map. First posted on arXiv 14 Jan 2026.

Builds on

17 of 34 references.

Closest ancestors · 7

Same direction, newest first

  1. 2025Seer Self-Consistency: Advance Budget Estimation for Adaptive Test-Time Scaling12 Nov
  2. 2025DeepPrune: Parallel Scaling without Inter-trace Redundancy9 Oct
  3. 2025SpecExit: Accelerating Large Reasoning Model via Speculative Exit29 Sep
  4. 2025Deep Think with Confidence21 Aug
  5. 2025Speculative Thinking: Enhancing Small-Model Reasoning with Large Model Guidance at Inference Time12 Apr
  6. 2025Scalable Best-of-N Selection for Large Language Models via Self-Certainty25 Feb
  7. 2025Bridging Internal Probability and Self-Consistency for Effective and Efficient LLM Reasoning1 Feb

Other references · 10

  1. 2023GPT-4 Technical Reportcited by 18,132
  2. 2025Qwen3 Technical Reportcited by 8,195
  3. 2020Scaling Laws for Neural Language Modelscited by 6,411
  4. 2025DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learningcited by 6,146
  5. 2022Self-Consistency Improves Chain of Thought Reasoning in Language Modelscited by 5,601
  6. 2022Large Language Models are Zero-Shot Reasonerscited by 4,323
  7. 2024Qwen2 Technical Reportcited by 2,076
  8. 2025Phi-4-reasoning Technical Reportcited by 146
  9. 2025Mind the Confidence Gap: Overconfidence, Calibration, and Distractor Effects in Large Language Modelscited by 39
  10. 2025CLUE: Non-parametric Verification from Experience via Hidden-State Clusteringcited by 12

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 10.

10 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2026Revisiting the Effectiveness of LLM Pruning for Test-Time Scaling
  2. 2026Efficient Test-Time Scaling via Temporal Reasoning Aggregation
  3. 2025Can Pruning Improve Reasoning? Revisiting Long-CoT Compression with Capability in Mind for Better Reasoning
  4. 2025When Fewer Layers Break More Chains: Layer Pruning Harms Test-Time Scaling in LLMs
  5. 2025Are We Scaling the Right Thing? A System Perspective on Test-Time Scaling
  6. 2026Cut Your Losses! Learning to Prune Paths Early for Efficient Parallel Reasoning
  7. 2025ReProbe: Efficient Test-Time Scaling of Multi-Step Reasoning by Probing Internal States of Large Language Models
  8. 2026TRACES: Tagging Reasoning Steps for Adaptive Cost-Efficient Early-Stopping