mlsanityData to 14 Oct 2026

MARS: Unleashing the Power of Speculative Decoding via Margin-Aware Verification

arXiv 2601.15498 ↗First posted 21 Jan 2026cs.LGcited by 4

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

Abstract (arXiv)

Speculative Decoding (SD) accelerates autoregressive large language model (LLM) inference by decoupling generation and verification. While recent methods improve draft quality by tightly coupling the drafter with the target model, the verification mechanism itself remains largely unchanged, relying on strict token-level rejection sampling. In practice, modern LLMs frequently operate in low-margin regimes where the target model exhibits weak preference among top candidates. In such cases, rejecting plausible runner-up tokens yields negligible information gain while incurring substantial rollback cost, leading to a fundamental inefficiency in verification. We propose Margin-Aware Speculative Verification, a training-free and domain-agnostic verification strategy that adapts to the target model's local decisiveness. Our method conditions verification on decision stability measured directly from the target logits and relaxes rejection only when strict verification provides minimal benefit. Importantly, the approach modifies only the verification rule and is fully compatible with existing target-coupled speculative decoding frameworks. Extensive experiments across model scales ranging from 8B to 235B demonstrate that our method delivers consistent and significant inference speedups over state-of-the-art baselines while preserving generation quality across diverse benchmarks. The code is available at https://github.com/5SSjw/MARS.

Key facts. Cited by 4 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 21 of its 33 references that are in the map. First posted on arXiv 21 Jan 2026.

Builds on

21 of 33 references.

Closest ancestors · 15

Same direction, newest first

  1. 2025Training-Free Loosely Speculative Decoding: Accepting Semantically Correct Drafts Beyond Exact Match28 Nov
  2. 2025EAGLE-3: Scaling up Inference Acceleration of Large Language Models via Training-Time Test3 Mar
  3. 2025Judge Decoding: Faster Speculative Sampling Requires Going Beyond Model Alignment31 Jan
  4. 2024PLD+: Accelerating LLM inference by leveraging Language Model Artifacts2 Dec
  5. 2024Draft Model Knows When to Stop: Self-Verification Speculative Decoding for Long-Form Generation27 Nov
  6. 2024EAGLE-2: Faster Inference of Language Models with Dynamic Draft Trees24 Jun
  7. 2024Sequoia: Scalable, Robust, and Hardware-aware Speculative Decoding19 Feb
  8. 2024Break the Sequential Dependency of LLM Inference Using Lookahead Decoding3 Feb
  9. 2024EAGLE: Speculative Sampling Requires Rethinking Feature Uncertainty26 Jan
  10. 2024Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Heads19 Jan
  11. 2023Accelerating LLM Inference with Staged Speculative Decoding8 Aug
  12. 2023SpecInfer: Accelerating Generative Large Language Model Serving with Tree-based Speculative Inference and Verification16 May
3 more
  1. 2023Speculative Decoding with Big Little Decoder15 Feb
  2. 2023Accelerating Large Language Model Decoding with Speculative Sampling2 Feb
  3. 2022Fast Inference from Transformers via Speculative Decoding30 Nov

Other references · 6

  1. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  2. 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,626
  3. 2021Evaluating Large Language Models Trained on Codecited by 8,320
  4. 2021Program Synthesis with Large Language Modelscited by 3,637
  5. 2015Teaching Machines to Read and Comprehendcited by 1,049
  6. 2019Fast Transformer Decoding: One Write-Head is All You Needcited by 717

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 4.

4 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2024Closer Look at Efficient Inference Methods: A Survey of Speculative Decoding
  2. 2024Unlocking Efficiency in Large Language Model Inference: A Comprehensive Survey of Speculative Decoding
  3. 2026Calibrated Speculative Decoding: Frequency-Guided Candidate Selection for Efficient Inference
  4. 2026Faster LLM Inference via Sequential Monte Carlo
  5. 2025Speculative Verification: Exploiting Information Gain to Refine Speculative Decoding
  6. 2025Speculative Decoding: Performance or Illusion?
  7. 2025Draft, Verify, and Improve: Toward Training-Aware Speculative Decoding
  8. 2025Think Before You Accept: Semantic Reflective Verification for Faster Speculative Decoding