Pith. sign in

REVIEW 2 cited by

SEED: Accelerating Reasoning Tree Construction via Scheduled Speculative Decoding

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2406.18200 v2 pith:L5M25423 submitted 2024-06-26 cs.CL

classification cs.CL
keywords reasoningseedinferencespeculativedecodingdemonstrateevaluationexploration
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Accelerating Large Language Model Reasoning via Speculative Search

    cs.CL 2025-05 conditional novelty 6.0 of 10

    SpecSearch speeds up tree-search LLM reasoning by drafting thoughts with a small model, rejecting low-quality thoughts with a PRM-based threshold, and correcting them with a large model, achieving up to 2.12x speedup ...

  2. SCOPE: Optimizing Key-Value Cache Compression in Long-context Generation

    cs.CL 2024-12 conditional novelty 5.0 of 10

    SCOPE keeps a fixed compressed prefill cache and applies sliding, adaptive, and discontinuous eviction only to decoding-stage KV tokens, improving long-output reasoning accuracy at low memory budgets.

Pith tools