mlsanityData to 14 Oct 2026

TALON: Confidence-Aware Speculative Decoding with Adaptive Token Trees

arXiv 2601.07353 ↗First posted 12 Jan 2026cs.CLcited by 13

On the map: Efficient LLM inference and serving → Speculative decoding

Abstract (arXiv)

Speculative decoding (SD) has become a standard technique for accelerating LLM inference without sacrificing output quality. Recent advances in speculative decoding have shifted from sequential chain-based drafting to tree-structured generation, where the draft model constructs a tree of candidate tokens to explore multiple possible drafts in parallel. However, existing tree-based SD methods typically build a fixed-width, fixed-depth draft tree, which fails to adapt to the varying difficulty of tokens and contexts. As a result, the draft model cannot dynamically adjust the tree structure to early stop on difficult tokens and extend generation for simple ones. To address these challenges, we introduce TALON, a training-free, budget-driven adaptive tree expansion framework that can be plugged into existing tree-based methods. Unlike static methods, TALON constructs the draft tree iteratively until a fixed token budget is met, using a hybrid expansion strategy that adaptively allocates the node budget to each layer of the draft tree. This framework naturally shapes the draft tree into a "deep-and-narrow" form for deterministic contexts and a "shallow-and-wide" form for uncertain branches, effectively optimizing the trade-off between exploration width and generation depth under a given budget. Extensive experiments across 5 models and 6 datasets demonstrate that TALON consistently outperforms state-of-the-art EAGLE-3, achieving up to 5.16x end-to-end speedup over auto-regressive decoding.

Key facts. Cited by 13 papers in the map (data through 14 Oct 2026). Placed in Speculative decoding, one of 12 directions in Efficient LLM inference and serving. Builds on 39 of its 46 references that are in the map. First posted on arXiv 12 Jan 2026.

Builds on

39 of 46 references.

Closest ancestors · 27

Same direction, newest first

  1. 2025LogitSpec: Accelerating Retrieval-based Speculative Decoding via Next Next Token Speculation2 Jul
  2. 2025EAGLE-3: Scaling up Inference Acceleration of Large Language Models via Training-Time Test3 Mar
  3. 2025CORAL: Learning Consistent Representations across Multi-step Training with Lighter Speculative Drafter24 Feb
  4. 2025C2T: A Classifier-Based Tree Construction Method in Speculative Decoding19 Feb
  5. 2025Judge Decoding: Faster Speculative Sampling Requires Going Beyond Model Alignment31 Jan
  6. 2024AdaEAGLE: Optimizing Speculative Decoding via Explicit Modeling of Adaptive Draft Structures25 Dec
  7. 2024Falcon: Faster and Parallel Inference of Large Language Models through Enhanced Semi-Autoregressive Drafting and Custom-Designed Decoding Tree17 Dec
  8. 2024SAM Decoding: Speculative Decoding via Suffix Automaton16 Nov
  9. 2024DySpec: Faster Speculative Decoding with Dynamic Token Tree Structure15 Oct
  10. 2024Learning Harmonized Representations for Speculative Sampling28 Aug
  11. 2024PEARL: Parallel Speculative Decoding with Adaptive Draft Length13 Aug
  12. 2024OPT-Tree: Speculative Decoding with Adaptive Draft Tree Structure25 Jun
15 more
  1. 2024EAGLE-2: Faster Inference of Language Models with Dynamic Draft Trees24 Jun
  2. 2024Speculative Decoding via Early-exiting for Faster LLM Inference with Thompson Sampling Control Mechanism6 Jun
  3. 2024SpecDec++: Boosting Speculative Decoding via Adaptive Candidate Lengths30 May
  4. 2024Clover: Regressive Lightweight Speculative Decoding with Sequential Knowledge1 May
  5. 2024Block Verification Accelerates Speculative Decoding15 Mar
  6. 2024Chimera: A Lossless Decoding Method for Accelerating Large Language Models Inference by Fusing all Tokens24 Feb
  7. 2024Sequoia: Scalable, Robust, and Hardware-aware Speculative Decoding19 Feb
  8. 2024GliDe with a CaPE: A Low-Hassle Method to Accelerate Speculative Decoding3 Feb
  9. 2024Break the Sequential Dependency of LLM Inference Using Lookahead Decoding3 Feb
  10. 2024EAGLE: Speculative Sampling Requires Rethinking Feature Uncertainty26 Jan
  11. 2024Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Heads19 Jan
  12. 2023REST: Retrieval-Based Speculative Decoding14 Nov
  13. 2023SpecInfer: Accelerating Generative Large Language Model Serving with Tree-based Speculative Inference and Verification16 May
  14. 2023Accelerating Large Language Model Decoding with Speculative Sampling2 Feb
  15. 2022Fast Inference from Transformers via Speculative Decoding30 Nov

Other references · 12

  1. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  2. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  3. 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,626
  4. 2021Evaluating Large Language Models Trained on Codecited by 8,320
  5. 2019The Curious Case of Neural Text Degenerationcited by 2,916
  6. 2023Enhancing Chat Language Models by Scaling High-quality Instructional Conversationscited by 839
  7. 2016Abstractive Text Summarization Using Sequence-to-Sequence RNNs and Beyondcited by 812
  8. 2025GLM-4.5: Agentic, Reasoning, and Coding (ARC) Foundation Modelscited by 467
  9. 2024Better & Faster Large Language Models via Multi-token Predictioncited by 360
  10. 2024Turning Up the Heat: Min-p Sampling for Creative and Coherent LLM Outputscited by 150
  11. 2024Turning Trash into Treasure: Accelerating Inference of Large Language Models with Token Recyclingcited by 47
  12. 2024DeFT: Decoding with Flash Tree-attention for Efficient Tree-structured LLM Inferencecited by 19

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 13.

13 papers.

Sort:

By area:

Similar, not cited

Close in wording, no citation either way

  1. 2024Recursive Speculative Decoding: Accelerating LLM Inference via Sampling Without Replacement
  2. 2024SDSAT: Accelerating LLM Inference through Speculative Decoding with Semantic Adaptive Tokens
  3. 2026TreeGraft: Adaptive Multi-Drafter Grafting for Tree-Based Speculative Decoding
  4. 2026DominoTree: Conditional Tree-Structured Drafting with Domino for Speculative Decoding
  5. 2026Goose: Anisotropic Speculation Trees for Training-Free Speculative Decoding
  6. 2026RheoSampling: Resolving the One-Hot Dilemma in Stochastic Dynamic-Tree Speculative Decoding
  7. 2025Tutorial Proposal: Speculative Decoding for Efficient LLM Inference
  8. 2025CARD: A Cache-Assisted Parallel Speculative Decoding Framework via Query-and-Correct Paradigm for Accelerating LLM Inference