mlsanityData to 7 Oct 2026

SEED: Accelerating Reasoning Tree Construction via Scheduled Speculative Decoding

arXiv 2406.18200 ↗First posted 26 Jun 2024cs.CLcited by 9

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

also in 1 more
Abstract (arXiv)

Large Language Models (LLMs) demonstrate remarkable emergent abilities across various tasks, yet fall short of complex reasoning and planning tasks. The tree-search-based reasoning methods address this by surpassing the capabilities of chain-of-thought prompting, encouraging exploration of intermediate steps. However, such methods introduce significant inference latency due to the systematic exploration and evaluation of multiple thought paths. This paper introduces SeeD, a novel and efficient inference framework to optimize runtime speed and GPU memory management concurrently. By employing a scheduled speculative execution, SeeD efficiently handles multiple iterations for the thought generation and the state evaluation, leveraging a rounds-scheduled strategy to manage draft model dispatching. Extensive experimental evaluations on three reasoning datasets demonstrate superior speedup performance of SeeD, providing a viable path for batched inference in training-free speculative decoding.

Key facts. Cited by 9 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 8 of its 50 references that are in the map. First posted on arXiv 26 Jun 2024.

Builds on

8 of 50 references.

Closest ancestors · 1

Same direction, newest first

  1. 2024Mirror: A Multiple-perspective Self-Reflection Method for Knowledge-rich Reasoning22 Feb

Other references · 7

  1. 2023GPT-4 Technical Reportcited by 18,132
  2. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
  3. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
  4. 2021Training Verifiers to Solve Math Word Problemscited by 9,743
  5. 2024Monte Carlo Tree Search Boosts Reasoning via Iterative Preference Learningcited by 238
  6. 2023Cascade Speculative Drafting for Even Faster LLM Inferencecited by 83
  7. 2024RoT: Enhancing Large Language Models with Reflection on Search Treescited by 11

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 6; 2026: 2.

9 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025Inference-Cost-Aware Dynamic Tree Construction for Efficient Inference in Large Language Models
  2. 2026ConfSpec: Efficient Step-Level Speculative Reasoning via Confidence-Gated Verification
  3. 2025SpecExit: Accelerating Large Reasoning Model via Speculative Exit
  4. 2026CATS: Cascaded Adaptive Tree Speculation for Memory-Limited LLM Inference Acceleration
  5. 2025Speculative Thinking: Enhancing Small-Model Reasoning with Large Model Guidance at Inference Time
  6. 2023The Synergy of Speculative Decoding and Batching in Serving Large Language Models
  7. 2025Scaling Up, Speeding Up: A Benchmark of Speculative Decoding for Efficient LLM Test-Time Scaling
  8. 2025SpecReason: Fast and Accurate Inference-Time Compute via Speculative Reasoning