atlas

Research map / Large language models / Reasoning and chain of thought

Accelerating Large Language Model Reasoning via Speculative Search

ICML 2025 · Large language models › Reasoning and chain of thought · approach: Efficient LLM serving · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes SpecSearch, a bi-level speculative thought generator in which a small model drafts reasoning thoughts, a PRM rejects low-quality ones using an EMA threshold estimated from large-model samples, and rejected thoughts are regenerated by the large model via token-level speculative sampling, yielding up to 2.12x speedup over SpS with comparable accuracy.

Problem

Tree-search-based LLM reasoning (ToT with beam search or MCTS) incurs very high inference latency because thought generation requires producing many candidate reasoning steps with a large model.

Approach

Extends speculative execution from the token level to the thought level: a small model drafts multiple thoughts, a process reward model filters those below a dynamically estimated large-model quality threshold (EMA over historical large-model thought scores), and rejected thoughts are regenerated by the large model with lossless token-level speculative decoding.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
bi-level speculative thought generation with quality-preserving rejection (vs AR)Qwen2.5-72B with 7B draft, beam search · MATH-100Speedup (vs AR): 3.35x speedup at 87.00 vs 87.00 accuracyHelped
bi-level speculative thought generation with quality-preserving rejection (vs SpS)Qwen2.5-72B with 7B draft, beam search · GSM8K-100Reasoning Accuracy (%): 96.00 vs 97.00 for AR and SpSHurt
bi-level speculative thought generation (Llama)Llama3-70B with 8B draft · GSM8K-100Reasoning Accuracy (%): 88.00 vs 87.00 AR and 86.00 SpSHelped
bi-level speculative thought generation (Llama)Llama3-70B with 8B draft · MATH-100Reasoning Accuracy (%): 64.00 vs 62.00 AR and 61.00 SpSHelped
replace PRM evaluation with large-model log-probability evaluation (ablation)SpecSearch · MATH-50Reasoning Accuracy (%): 78.00 vs 88.00 for full SpecSearchHurt
step-wise EMA threshold estimation instead of fixed threshold (ablation)SpecSearch rejection module · MATH-50Reasoning Accuracy (%): 88.00 vs 80.00 with fixed thresholdHelped
random rejection of 50% of small-model thoughts instead of quality-based rejection (ablation)SpecSearch · MATH-50Reasoning Accuracy (%): 80.00 vs 88.00 for fullHurt
adaptive thought-level large model engagement (vs fixed large-model engagement) (ablation)SpecSearch rejection module · MATH-50Reasoning Accuracy (%): 88.00 vs 84.00 with FLMEHelped
fixed threshold instead of step-wise threshold (speed tradeoff) (ablation)SpecSearch rejection module · MATH-50Speedup (vs AR): 3.72x vs 3.63x full, but accuracy 80.00 vs 88.00Mixed
SpecSearch with Math-Shepherd PRM vs Math-psa PRMSpecSearch · GSM8K-100 (PRM generalization)Reasoning Accuracy (%): 94.00 (Math-Shepherd) vs 96.00 (Math-psa), AR 96.00No clear effect
SpecSearch with MCTS search instead of beam searchSpecSearch · GSM8K-100 (MCTS)Speedup (vs AR): 2.61x vs AR, 98.00 accuracy equal to ARHelped

Surprising findings

Limitations

Experimental setup

Datasets: MATH GSM8K

Benchmarks: MATH-100 GSM8K-100 MATH-50

Metrics: reasoning accuracy average inference latency speedup vs AR speedup vs SpS

Baselines: AR (autoregressive ToT) SpS (speculative sampling) SD SEED TreeBon

Builds on: speculative sampling Tree of Thoughts OpenR Math-Shepherd Chain-of-Thought

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy