Trajectory-Retrieval Speculative Decoding: When Does a Model's Own History Help?
cs.AI
Submitted: 2026-10-05
Updated: 2026-10-05
Comments: 33 pages
License: http://creativecommons.org/publicdomain/zero/1.0/
The gist: Long chain-of-thought reasoning increases sequential decoding cost while creating a growing history of potentially reusable continuations.
Terminology
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.
Sources
- Large Language Monkeys: Scaling Inference Compute with Repeated Sampling
- Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Heads
- Accelerating Large Language Model Decoding with Speculative Sampling
- RAPID: Long-Context Inference with Retrieval-Augmented Speculative Decoding
- Sequoia: Scalable, Robust, and Hardware-aware Speculative Decoding
- Token-Driven GammaTune: Adaptive Calibration for Enhanced Speculative Decoding
- Measuring Mathematical Problem Solving With the MATH Dataset
- SpecDec++: Boosting Speculative Decoding via Adaptive Candidate Lengths
- ReasonOps: Operator Segmentation for LLM Reasoning Traces
- EAGLE: Speculative Sampling Requires Rethinking Feature Uncertainty
- Dynamic Speculation Lookahead Accelerates Speculative Decoding of Large Language Models
- SpecInfer: Accelerating Generative Large Language Model Serving with Tree-based Speculative Inference and Verification
- GPQA: A Graduate-Level Google-Proof Q&A Benchmark
- The Shape of Overthinking: Backtracking Bursts in Long Reasoning Traces
- Self-Consistency Improves Chain of Thought Reasoning in Language Models
- Accelerating Large Language Model Reasoning via Speculative Search
- Inference with Reference: Lossless Acceleration of Large Language Models
Related papers
- MAVEN-T: Reinforced Heterogeneous Distillation for Real-Time Multi-Agent Trajectory Prediction
- Model Discovery Agent: LLM-assisted Bayesian experiment design for data-efficient discovery of mechanistic world models
- Agents' Last Exam
- The Clinician's Veto: Navigating Trust, Liability, and Uncertainty in Autonomous AI Prescribing
- MindHelper: Closed-Loop Embodied Mental-State Reasoning for Precision Intervention
- Incumbent Advantage: Brand Bias and Cognitive Manipulation Dynamics in LLM Recommendation Systems