mlsanityData to 7 Oct 2026

Breaking the Pre-Sampling Barrier: Activation-Informed Difficulty-Aware Self-Consistency

arXiv 2602.09438 ↗First posted 10 Feb 2026cs.CLcited by 1

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

Abstract (arXiv)

Self-Consistency (SC) is an effective decoding strategy that improves the reasoning performance of Large Language Models (LLMs) by generating multiple chain-of-thought reasoning paths and selecting the final answer via majority voting. However, it suffers from substantial inference costs because it requires a large number of samples. To mitigate this issue, Difficulty-Adaptive Self-Consistency (DSC) was proposed to reduce unnecessary token usage for easy problems by adjusting the number of samples according to problem difficulty. However, DSC requires additional model calls and pre-sampling to estimate difficulty, and this process is repeated when applying to each dataset, leading to significant computational overhead. In this work, we propose Activation-Informed Difficulty-Aware Self-Consistency (ACTSC) to address these limitations. ACTSC leverages internal difficulty signals reflected in the feed-forward network neuron activations to construct a lightweight difficulty estimation probe, without any additional token generation or model calls. The probe dynamically adjusts the number of samples for SC and can be applied to new datasets without requiring pre-sampling for difficulty estimation. To validate its effectiveness, we conduct experiments on five benchmarks. Experimental results show that ACTSC effectively reduces inference costs while maintaining accuracy relative to existing methods.

Key facts. Cited by 1 paper 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 5 of its 17 references that are in the map. First posted on arXiv 10 Feb 2026.

Builds on

5 of 17 references.

Closest ancestors · 1

Same direction, newest first

  1. 2025Semantic Exploration with Adaptive Gating for Efficient Problem Solving with Language Models10 Jan

Other references · 4

  1. 2022Self-Consistency Improves Chain of Thought Reasoning in Language Modelscited by 5,601
  2. 2024Qwen2.5 Technical Reportcited by 4,713
  3. 2025Gemma 3 Technical Reportcited by 1,686
  4. 2016Understanding intermediate layers using linear classifier probescited by 1,279

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2026Is Discrete Difficulty Sufficient? Leveraging Continuous Difficulty for Efficient Self-Consistency in LLMs
  2. 2024Make Every Penny Count: Difficulty-Adaptive Self-Consistency for Cost-Efficient Reasoning
  3. 2025Optimal Self-Consistency for Efficient Reasoning with Large Language Models
  4. 2024Integrative Decoding: Improve Factuality via Implicit Self-consistency
  5. 2025A Theoretical Study on Bridging Internal Probability and Self-Consistency for LLM Reasoning
  6. 2025Self-Consistency Is Losing Its Edge: Diminishing Returns and Rising Costs in Modern LLMs
  7. 2024Reasoning Aware Self-Consistency: Leveraging Reasoning Paths for Efficient LLM Sampling
  8. 2026Reliability-Aware Adaptive Self-Consistency for Efficient Sampling in LLM Reasoning