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.
SEED: Accelerating Reasoning Tree Construction via Scheduled Speculative Decoding
1 Pith paper cite this work. Polarity classification is still indexing.
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.
fields
cs.CL 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
SCOPE: Optimizing Key-Value Cache Compression in Long-context Generation
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.