Aggressive Speculative Decoding for Efficient Chain-of-Thought Reasoning

Large language models (LLMs) have demon-strated excellent performance in complex tasks through Chain-of-Thought (CoT) reasoning. However, LLMs usually gener-ate long thinking content during reasoning, leading to high inference latency. Speculative decoding (SD) is a general acceleration method but has two limitations that weaken its acceleration effect in CoT reasoning scenarios. Therefore, in this study, we proposed the aggressive speculative decoding (ASD) method for efficient CoT reasoning, alleviating the two shortcomings. First, SD adopts a strict acceptance strategy to ensure the generated results are consistent with the target model. However, multiple feasible reasoning trajectories may lead to correct answers. Therefore, ASD adopts an aggressive acceptance strategy, which accepts more draft tokens based on the deviation between the probabilities. Second, SD only generates a small fixed number of draft tokens in each drafting stage. In contrast, ASD adopts an aggressive drafting strat-egy, which adaptively generates a suitable number of draft tokens by estimating the expected transformation value of the inference latency through confidence. Extensive experiments on different reasoning datasets and LLMs demonstrate the effectiveness of our method. In particular, ASD achieved a significantly better acceleration effect than SD on all datasets while ensuring accuracy.

Authors

Publication Details

Journal
Tsinghua Science & Technology
Published
2025-12-01
DOI
https://doi.org/10.26599/tst.2026.9010003
Primary Topic
Topic Modeling
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Aggressive Speculative Decoding for Efficient Chain-of-Thought Reasoning

Huanran Zheng, Jingwei Zhang, Ya Zhou, Xiaoling Wang
Tsinghua Science & Technology
Topic Modeling
article

Aggressive Speculative Decoding for Efficient Chain-of-Thought Reasoning

Huanran Zheng, Jingwei Zhang, Ya Zhou, Xiaoling Wang
article en

Abstract

Large language models (LLMs) have demon-strated excellent performance in complex tasks through Chain-of-Thought (CoT) reasoning. However, LLMs usually gener-ate long thinking content during reasoning, leading to high inference latency. Speculative decoding (SD) is a general acceleration method but has two limitations that weaken its acceleration effect in CoT reasoning scenarios. Therefore, in this study, we proposed the aggressive speculative decoding (ASD) method for efficient CoT reasoning, alleviating the two shortcomings. First, SD adopts a strict acceptance strategy to ensure the generated results are consistent with the target model. However, multiple feasible reasoning trajectories may lead to correct answers. Therefore, ASD adopts an aggressive acceptance strategy, which accepts more draft tokens based on the deviation between the probabilities. Second, SD only generates a small fixed number of draft tokens in each drafting stage. In contrast, ASD adopts an aggressive drafting strat-egy, which adaptively generates a suitable number of draft tokens by estimating the expected transformation value of the inference latency through confidence. Extensive experiments on different reasoning datasets and LLMs demonstrate the effectiveness of our method. In particular, ASD achieved a significantly better acceleration effect than SD on all datasets while ensuring accuracy.

Tsinghua Science & Technology
National Natural Science Foundation of China, Fundamental Research Funds for the Central Universities
Openalex Percentile: Top 18%
Topic Modeling
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.