mlsanityData to 7 Oct 2026

TapOut: A Bandit-Based Approach to Dynamic Speculative Decoding

arXiv 2511.02017 ↗First posted 3 Nov 2025cs.LG cs.CLcited by 1

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

Abstract (arXiv)

Speculative decoding accelerates LLMs by using a lightweight draft model to generate tokens autoregressively before verifying them in parallel with a larger target model. However, determining the optimal number of tokens to draft remains a key challenge limiting the approach's effectiveness. Dynamic speculative decoding aims to intelligently decide how many tokens to draft to achieve maximum speedups. Existing methods often rely on hand-tuned, sensitive thresholds (e.g., token entropy), which are costly to set and generalize poorly across models and domains. We propose TapOut, an online, training-free, plug-and-play algorithm for dynamic speculation policy selection using multi-armed bandits. Our approach employs a meta-algorithm that selects among multiple parameter-free dynamic speculation strategies based on past reward and exploration. We conduct extensive experiments across diverse model pairs and datasets, showing that TapOut achieves competitive or superior speedups compared to well-established dynamic speculation baselines without any hyperparameter tuning.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Placed in Speculative decoding, one of 12 directions in Efficient LLM inference and serving. Builds on 14 of its 20 references that are in the map. First posted on arXiv 3 Nov 2025.

Builds on

14 of 20 references.

Closest ancestors · 11

Same direction, newest first

  1. 2025BanditSpec: Adaptive Speculative Decoding via Bandit Algorithms21 May
  2. 2024Draft Model Knows When to Stop: Self-Verification Speculative Decoding for Long-Form Generation27 Nov
  3. 2024AdaEDL: Early Draft Stopping for Speculative Decoding of Large Language Models via an Entropy-based Lower Bound on Token Acceptance Probability24 Oct
  4. 2024PEARL: Parallel Speculative Decoding with Adaptive Draft Length13 Aug
  5. 2024SpecDec++: Boosting Speculative Decoding via Adaptive Candidate Lengths30 May
  6. 2024Break the Sequential Dependency of LLM Inference Using Lookahead Decoding3 Feb
  7. 2024EAGLE: Speculative Sampling Requires Rethinking Feature Uncertainty26 Jan
  8. 2024Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Heads19 Jan
  9. 2024Unlocking Efficiency in Large Language Model Inference: A Comprehensive Survey of Speculative Decoding15 Jan
  10. 2023Accelerating Large Language Model Decoding with Speculative Sampling2 Feb
  11. 2022Fast Inference from Transformers via Speculative Decoding30 Nov

Other references · 3

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,393
  3. 2021Evaluating Large Language Models Trained on Codecited by 8,053

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2025Fail Fast, Win Big: Rethinking the Drafting Strategy in Speculative Decoding via Diffusion LLMs
  2. 2025Not-a-Bandit: Provably No-Regret Drafter Selection in Speculative Decoding for LLMs
  3. 2026LibraSpec: Dynamic Diffusion-Based Speculative Decoding via Marginal-Gain-Driven Optimization
  4. 2025TETRIS: Optimal Draft Token Selection for Batch Speculative Decoding
  5. 2026Performance-Driven Policy Optimization for Speculative Decoding with Adaptive Windowing
  6. 2026KnapSpec: Self-Speculative Decoding via Adaptive Layer Selection as a Knapsack Problem
  7. 2026Margins, Not Windows: Training-Free Per-Step Lossy Speculative Decoding
  8. 2026Learning to Draft: Adaptive Speculative Decoding with Reinforcement Learning