ConfSpec: Efficient Step-Level Speculative Reasoning via Confidence-Gated Verification (2026.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to chain-of-thought reasoning incur high inference latency due to long generation traces. |
| Approach: | They propose a confidence-gated cascaded verification framework that reduces the trade-off between generation and verification. |
| Outcome: | The proposed framework achieves 2.24 speedups while matching target-model accuracy. |
Similar Papers
From Tokens to Steps: Verification-Aware Speculative Decoding for Efficient Multi-Step Reasoning (2026.findings-acl)
Copied to clipboard
| Challenge: | Speculative decoding (SD) allows a lightweight draft model to propose outputs that a stronger target model verifies. |
| Approach: | They propose a verification-aware speculative decoding framework that performs step-level verification using only model-internal signals. |
| Outcome: | Experiments show that SpecGuard outperforms both SD and reward-guided SD in accuracy and reliability tests. |
SpecCoT: Accelerating Chain-of-Thought Reasoning through Speculative Exploration (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Large Reasoning Models suffer from high inference latency due to lengthy reasoning chains. |
| Approach: | They propose a collaborative framework that combines large and small models for effective reasoning. |
| Outcome: | The proposed framework reduces inference latency by 1.7-4.1 while maintaining comparable accuracy to standard large model inference. |
ConCISE: Confidence-guided Compression in Step-by-step Efficient Reasoning (2025.emnlp-main)
Copied to clipboard
Ziqing Qiao, Yongheng Deng, Jiali Zeng, Dong Wang, Lai Wei, Guanbo Wang, Fandong Meng, Jie Zhou, Ju Ren, Yaoxue Zhang
| Challenge: | Existing methods for fine-tuning-based compression suffer from verbose outputs, increasing computational overhead. |
| Approach: | They propose a framework to generate concise reasoning chains using Confidence Injection and Early Stopping. |
| Outcome: | The proposed framework reduces the length of the model by up to 50% while maintaining high task accuracy. |
Confidence-Aware Reasoning: Optimizing Self-Guided Thinking Trajectories in Large Reasoning Models (2025.emnlp-industry)
Copied to clipboard
| Challenge: | Chain-of-thought enables large reasoning models to reason through multi-step problems but often leads to unnecessarily long or redundant reasoning traces, a phenomenon known as overthinking. |
| Approach: | They propose an inference-time framework that selectively prunes low-utility reasoning blocks and halts early when sufficient confidence has been achieved. |
| Outcome: | The proposed framework improves answer accuracy by up to +13.3% while reducing average reasoning length by 40%–50%. |
Efficient Paths and Dense Rewards: Probabilistic Flow Reasoning for Large Language Models (2026.acl-long)
Copied to clipboard
Yan Liu, Feng Zhang, Zhanyu Ma, Jun Xu, Jiuchong Gao, Jinghua Hao, Renqing He, Han Liu, Yangdong Deng
| Challenge: | Existing approaches to mitigate inference inefficiency and optimization difficulty are fragmented and constrained by inherent trade-offs. |
| Approach: | They propose a framework that reconceptualizes discrete reasoning steps as a continuous probabilistic flow, quantifying the contribution of each step toward the ground-truth answer. |
| Outcome: | The proposed framework achieves a superior balance between inference efficiency and reasoning performance on challenging benchmarks. |
HeteroSpec: Leveraging Contextual Heterogeneity for Efficient Speculative Decoding (2026.acl-long)
Copied to clipboard
| Challenge: | Autoregressive decoding limits the inference throughput of Large Language Models due to its sequential dependency. |
| Approach: | They propose a framework that allocates verification effort in proportion to candidate uncertainty. |
| Outcome: | Speculative decoding achieves an average speedup over state-of-the-art methods . a small subset of high-confidence predictions accounts for most successful verifications . |
GlimpRouter: Efficient Collaborative Inference by Glimpsing One Token of Thoughts (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing routing strategies rely on local token probabilities or post-hoc verification, introducing significant inference overhead. |
| Approach: | They propose a step-wise collaboration framework that generates only the first token of each reasoning step and routes it to a larger model only when initial token entropy exceeds a threshold. |
| Outcome: | The proposed approach reduces inference latency while preserving accuracy. |
SEED: Accelerating Reasoning Tree Construction via Scheduled Speculative Decoding (2025.coling-main)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have remarkable emergent abilities across various tasks, yet their performance on complex reasoning and planning tasks remains suboptimal. |
| Approach: | They propose a tree-search-based reasoning framework that encourages the exploration of intermediate steps and a round-scheduled strategy to manage draft model dispatching. |
| Outcome: | The proposed framework improves runtime speed and GPU memory management concurrently and handles multiple iterations for thought generation and state evaluation. |
GCoT-Decoding: Unlocking Deep Reasoning Paths for Universal Question Answering (2026.findings-acl)
Copied to clipboard
| Challenge: | Recent work on Chain-of-Thought reasoning requires manual prompts to guide the model. |
| Approach: | They propose a general decoding strategy that generates CoT-style reasoning paths without prompts. |
| Outcome: | The proposed method maintains strong performance on fixed and free QA tasks and achieves significant improvements on free qa. |
Speculative Verification: Exploiting Information Gain for Speculative Decoding (2026.findings-acl)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) are used for many applications but their size and computational cost make inference serving a significant challenge. |
| Approach: | They propose an efficient augmentation to Speculative Decoding (SD) that predicts speculation accuracy and dynamically adapts the verification length to maximize throughput. |
| Outcome: | The proposed model reduces wasted verification on rejected tokens and improves decoding efficiency. |