mlsanityData to 14 Oct 2026

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

arXiv 2610.07350 ↗First posted 5 Oct 2026cs.AIcited by 0

On the map: LLM reasoning → Test-time compute and efficient thinking

also in 1 more
Abstract (arXiv)

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.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in Test-time compute and efficient thinking, one of 17 directions in LLM reasoning. Builds on 17 of its 49 references that are in the map. First posted on arXiv 5 Oct 2026.

Builds on

17 of 49 references.

Closest ancestors · 3

Same direction, newest first

  1. 2026The Shape of Overthinking: Backtracking Bursts in Long Reasoning Traces27 May
  2. 2025Accelerating Large Language Model Reasoning via Speculative Search3 May
  3. 2024EAGLE: Speculative Sampling Requires Rethinking Feature Uncertainty26 Jan

Other references · 14

  1. 2022Self-Consistency Improves Chain of Thought Reasoning in Language Modelscited by 5,708
  2. 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,371
  3. 2023GPQA: A Graduate-Level Google-Proof Q&A Benchmarkcited by 2,879
  4. 2023Accelerating Large Language Model Decoding with Speculative Samplingcited by 1,006
  5. 2024Large Language Monkeys: Scaling Inference Compute with Repeated Samplingcited by 991
  6. 2024Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Headscited by 843
  7. 2023SpecInfer: Accelerating Generative Large Language Model Serving with Tree-based Speculative Inference and Verificationcited by 365
  8. 2024Sequoia: Scalable, Robust, and Hardware-aware Speculative Decodingcited by 103
  9. 2024SpecDec++: Boosting Speculative Decoding via Adaptive Candidate Lengthscited by 75
  10. 2023Inference with Reference: Lossless Acceleration of Large Language Modelscited by 65
  11. 2024Dynamic Speculation Lookahead Accelerates Speculative Decoding of Large Language Modelscited by 31
  12. 2025RAPID: Long-Context Inference with Retrieval-Augmented Speculative Decodingcited by 14
2 more
  1. 2025Token-Driven GammaTune: Adaptive Calibration for Enhanced Speculative Decodingcited by 6
  2. 2026ReasonOps: Operator Segmentation for LLM Reasoning Tracescited by 5

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2026Selective Regenerative Decoding: Trajectory-Level Intervention for Inference-Time Reasoning
  2. 2025When, What, and How: Rethinking Retrieval-Enhanced Speculative Decoding
  3. 2026Evaluating Losslessness in Speculative Decoding Under Finite-Precision Inference
  4. 2026AdaPLD: Adaptive Retrieval and Reuse for Efficient Model-Free Speculative Decoding
  5. 2025Scaling Up, Speeding Up: A Benchmark of Speculative Decoding for Efficient LLM Test-Time Scaling
  6. 2025SpecRouter: Adaptive Routing for Multi-Level Speculative Decoding in Large Language Models
  7. 2025R-Stitch: Dynamic Trajectory Stitching for Efficient Reasoning
  8. 2026Margins, Not Windows: Training-Free Per-Step Lossy Speculative Decoding