cs.AIOct 5, 2026

Trajectory-Retrieval Speculative Decoding: When Does a Model's Own History Help?

Authors: Yuyang Dai, Yushun Dong

Abstract

Long chain-of-thought reasoning increases sequential decoding cost while creating a growing history of potentially reusable continuations. We investigate when this history supplies useful drafts and complements an existing drafter. Controlled source comparisons reveal trajectory-specific reuse, motivating our method Trajectory-Local Adaptive Retrieval (TLAR). TLAR retrieves approximately matched continuations from the current trajectory and uses recent verification outcomes to adapt retrieval activation and candidate width. TLAR combines retrieved continuations with model-generated drafts in a shared candidate tree, preserving the target model's output distribution through exact verification. Across code debugging, mathematics, and open-ended writing, our evaluation connects source reuse, incremental acceptance, and execution cost. Combining TLAR with strong retrieval baselines improves token acceptance under matched verification budgets and increases end-to-end throughput over the draft-model baseline. These findings support generated trajectories as runtime memory for adaptive inference.

Explore similar work

CardsList
  1. ReTrace: Rejected-Trajectory Conditioning for Speculative Decoding

    Aug 30, 2026Luxi Lin, Zhanpeng Zeng, Shuang Peng +2Speculative DecodingLLM Inference Acceleration

  2. AdaPLD: Adaptive Retrieval and Reuse for Efficient Model-Free Speculative Decoding

    Jun 4, 2026Runheng Liu, Jincheng Xie, Wen Hu +2Speculative DecodingLLM Inference Acceleration

  3. Training Parallel Speculative Draft Models by Directly Minimizing Expected Decoding Rounds

    Oct 7, 2026Yunxiao Zhao, Changxiao CaiSpeculative DecodingLLM Inference Acceleration