SEED: Accelerating Reasoning Tree Construction via Scheduled Speculative Decoding

Zhenglin Wang, Jialong Wu, Yilong Lai, Congzhi Zhang, Deyu Zhou
6/26/2024
cs.CL

No official code found. Best implementation: Linking-ai/SEED (10 stars, last commit 2024-12-18).

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.

View on arXivView PDF

Code Implementations(1)

Linking-ai/SEEDCommunity100%

(COLING2025) SEED: Accelerating Reasoning Tree Construction via Scheduled Speculative Decoding

100PythonJun 13, 20241 years ago

Similar Papers

Cite this paper

@article{wang2024seed,
  title  = {SEED: Accelerating Reasoning Tree Construction via Scheduled Speculative Decoding},
  author = {Zhenglin Wang and Jialong Wu and Yilong Lai and Congzhi Zhang and Deyu Zhou},
  year   = {2024},
  eprint = {2406.18200},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2406.18200v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2406.18200.svg)](https://codeofpaper.com/paper/2406.18200)

Discussion