TALON: Confidence-Aware Speculative Decoding with Adaptive Token Trees
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
- 2025LogitSpec: Accelerating Retrieval-based Speculative Decoding via Next Next Token Speculation2 Jul
- 2025EAGLE-3: Scaling up Inference Acceleration of Large Language Models via Training-Time Test3 Mar
- 2025CORAL: Learning Consistent Representations across Multi-step Training with Lighter Speculative Drafter24 Feb
- 2025C2T: A Classifier-Based Tree Construction Method in Speculative Decoding19 Feb
- 2025Judge Decoding: Faster Speculative Sampling Requires Going Beyond Model Alignment31 Jan
- 2024AdaEAGLE: Optimizing Speculative Decoding via Explicit Modeling of Adaptive Draft Structures25 Dec
- 2024Falcon: Faster and Parallel Inference of Large Language Models through Enhanced Semi-Autoregressive Drafting and Custom-Designed Decoding Tree17 Dec
- 2024SAM Decoding: Speculative Decoding via Suffix Automaton16 Nov
- 2024DySpec: Faster Speculative Decoding with Dynamic Token Tree Structure15 Oct
- 2024Learning Harmonized Representations for Speculative Sampling28 Aug
- 2024PEARL: Parallel Speculative Decoding with Adaptive Draft Length13 Aug
- 2024OPT-Tree: Speculative Decoding with Adaptive Draft Tree Structure25 Jun
15 more
- 2024EAGLE-2: Faster Inference of Language Models with Dynamic Draft Trees24 Jun
- 2024Speculative Decoding via Early-exiting for Faster LLM Inference with Thompson Sampling Control Mechanism6 Jun
- 2024SpecDec++: Boosting Speculative Decoding via Adaptive Candidate Lengths30 May
- 2024Clover: Regressive Lightweight Speculative Decoding with Sequential Knowledge1 May
- 2024Block Verification Accelerates Speculative Decoding15 Mar
- 2024Chimera: A Lossless Decoding Method for Accelerating Large Language Models Inference by Fusing all Tokens24 Feb
- 2024Sequoia: Scalable, Robust, and Hardware-aware Speculative Decoding19 Feb
- 2024GliDe with a CaPE: A Low-Hassle Method to Accelerate Speculative Decoding3 Feb
- 2024Break the Sequential Dependency of LLM Inference Using Lookahead Decoding3 Feb
- 2024EAGLE: Speculative Sampling Requires Rethinking Feature Uncertainty26 Jan
- 2024Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Heads19 Jan
- 2023REST: Retrieval-Based Speculative Decoding14 Nov
- 2023SpecInfer: Accelerating Generative Large Language Model Serving with Tree-based Speculative Inference and Verification16 May
- 2023Accelerating Large Language Model Decoding with Speculative Sampling2 Feb
- 2022Fast Inference from Transformers via Speculative Decoding30 Nov
Other references · 12
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2021Training Verifiers to Solve Math Word Problemscited by 10,109
- 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,626
- 2021Evaluating Large Language Models Trained on Codecited by 8,320
- 2019The Curious Case of Neural Text Degenerationcited by 2,916
- 2023Enhancing Chat Language Models by Scaling High-quality Instructional Conversationscited by 839
- 2016Abstractive Text Summarization Using Sequence-to-Sequence RNNs and Beyondcited by 812
- 2025GLM-4.5: Agentic, Reasoning, and Coding (ARC) Foundation Modelscited by 467
- 2024Better & Faster Large Language Models via Multi-token Predictioncited by 360
- 2024Turning Up the Heat: Min-p Sampling for Creative and Coherent LLM Outputscited by 150
- 2024Turning Trash into Treasure: Accelerating Inference of Large Language Models with Token Recyclingcited by 47
- 2024DeFT: Decoding with Flash Tree-attention for Efficient Tree-structured LLM Inferencecited by 19
Built on by
Citing papers per year: 2026: 13.
13 papers.
Sort:
By area:
- 2026ECHO: Elastic Speculative Decoding with Sparse Gating for High-Concurrency Scenarioscited by 12
- 2026Draft Less, Retrieve More: Hybrid Tree Construction for Speculative Decodingcited by 6
- 2026Cost-Aware Diffusion Draft Trees for Speculative Decodingcited by 6
- 2026When Hidden States Drift: Can KV Caches Rescue Long-Range Speculative Decoding?cited by 5
- 2026D-cut: Adaptive Verification Depth Pruning for Batched Speculative Decodingcited by 5
- 2026Making Every Verified Token Count: Adaptive Verification for MoE Speculative Decodingcited by 4
- 2026AngelSpec: Towards Real-World High Performance Inference with Speculative Decodingcited by 4
- 2026SpecBlock: Block-Iterative Speculative Decoding with Dynamic Tree Draftingcited by 3
- 2026WhiFlash: Accelerating Speculative Decoding with Token-Level Cross-Paradigm Routingcited by 1
- 2026Margins, Not Windows: Training-Free Per-Step Lossy Speculative Decodingcited by 1
- 2026Hybrid Verified Decoding: Learning to Allocate Verification in Speculative Decodingcited by 0
- 2026Fully Rotation-Equivariant Spectral-Spatial Learning for Multispectral Object Detectioncited by 0
- 2026AdaSpark: Adaptive DSpark with Online Learning for Tree Verification and N-gram Fill5 Oct 2026
- 2026AngelSpec: Towards Real-World High Performance Inference with Speculative Decoding28 Jul 2026
- 2026D-cut: Adaptive Verification Depth Pruning for Batched Speculative Decoding16 Jul 2026
- 2026Fully Rotation-Equivariant Spectral-Spatial Learning for Multispectral Object Detection6 Jul 2026
- 2026Margins, Not Windows: Training-Free Per-Step Lossy Speculative Decoding3 Jul 2026
- 2026WhiFlash: Accelerating Speculative Decoding with Token-Level Cross-Paradigm Routing5 Jun 2026
- 2026Cost-Aware Diffusion Draft Trees for Speculative Decoding1 Jun 2026
- 2026Hybrid Verified Decoding: Learning to Allocate Verification in Speculative Decoding31 May 2026
- 2026Draft Less, Retrieve More: Hybrid Tree Construction for Speculative Decoding19 May 2026
- 2026SpecBlock: Block-Iterative Speculative Decoding with Dynamic Tree Drafting8 May 2026
- 2026Making Every Verified Token Count: Adaptive Verification for MoE Speculative Decoding1 May 2026
- 2026When Hidden States Drift: Can KV Caches Rescue Long-Range Speculative Decoding?29 Apr 2026
1 more
- 2026ECHO: Elastic Speculative Decoding with Sparse Gating for High-Concurrency Scenarioscited by 12
- 2026Draft Less, Retrieve More: Hybrid Tree Construction for Speculative Decodingcited by 6
- 2026Cost-Aware Diffusion Draft Trees for Speculative Decodingcited by 6
- 2026When Hidden States Drift: Can KV Caches Rescue Long-Range Speculative Decoding?cited by 5
- 2026AngelSpec: Towards Real-World High Performance Inference with Speculative Decodingcited by 4
- 2026SpecBlock: Block-Iterative Speculative Decoding with Dynamic Tree Draftingcited by 3
- 2026Margins, Not Windows: Training-Free Per-Step Lossy Speculative Decodingcited by 1
- 2026Hybrid Verified Decoding: Learning to Allocate Verification in Speculative Decodingcited by 0
- 2026AngelSpec: Towards Real-World High Performance Inference with Speculative Decoding28 Jul 2026
- 2026Margins, Not Windows: Training-Free Per-Step Lossy Speculative Decoding3 Jul 2026
- 2026Cost-Aware Diffusion Draft Trees for Speculative Decoding1 Jun 2026
- 2026Hybrid Verified Decoding: Learning to Allocate Verification in Speculative Decoding31 May 2026
- 2026Draft Less, Retrieve More: Hybrid Tree Construction for Speculative Decoding19 May 2026
- 2026SpecBlock: Block-Iterative Speculative Decoding with Dynamic Tree Drafting8 May 2026
- 2026When Hidden States Drift: Can KV Caches Rescue Long-Range Speculative Decoding?29 Apr 2026
- 2026ECHO: Elastic Speculative Decoding with Sparse Gating for High-Concurrency Scenarios10 Mar 2026
Similar, not cited
Close in wording, no citation either way
- 2024Recursive Speculative Decoding: Accelerating LLM Inference via Sampling Without Replacement
- 2024SDSAT: Accelerating LLM Inference through Speculative Decoding with Semantic Adaptive Tokens
- 2026TreeGraft: Adaptive Multi-Drafter Grafting for Tree-Based Speculative Decoding
- 2026DominoTree: Conditional Tree-Structured Drafting with Domino for Speculative Decoding
- 2026Goose: Anisotropic Speculation Trees for Training-Free Speculative Decoding
- 2026RheoSampling: Resolving the One-Hot Dilemma in Stochastic Dynamic-Tree Speculative Decoding
- 2025Tutorial Proposal: Speculative Decoding for Efficient LLM Inference
- 2025CARD: A Cache-Assisted Parallel Speculative Decoding Framework via Query-and-Correct Paradigm for Accelerating LLM Inference