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

Yuyang Dai, Yushun Dong
10/5/2026
cs.AI

No confident code implementation found for this paper.

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{dai2026trajectoryretrieval,
  title  = {Trajectory-Retrieval Speculative Decoding: When Does a Model's Own History Help?},
  author = {Yuyang Dai and Yushun Dong},
  year   = {2026},
  eprint = {2610.07350},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2610.07350v1}
}

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/2610.07350.svg)](https://codeofpaper.com/paper/2610.07350)

Discussion