Challenge: Autoregressive decoding requires a full forward pass for each generated token, increasing inference latency.
Approach: They propose a lossless self-speculative decoding method that embeds a compressed model within selected decoder layers of the original model.
Outcome: The proposed method achieves substantial speed-ups (up to 2.47) over standard autoregressive decoding.

Similar Papers

Draft & Verify: Lossless Large Language Model Acceleration via Self-Speculative Decoding (2024.acl-long)

Copied to clipboard

Challenge: Existing methods for accelerating Large Language Models have been criticized for their inference costs and inefficient decoding.
Approach: They propose a self-speculative decoding approach for accelerating Large Language Models without an auxiliary model.
Outcome: The proposed method achieves a speedup of up to 1.99 with no additional neural network training and no extra memory footprint.
SpecBound: Adaptive Bounded Self-Speculation with Layer-wise Confidence Calibration (2026.findings-acl)

Copied to clipboard

Challenge: Speculative decoding has emerged as a promising approach to accelerate autoregressive inference in large language models.
Approach: They propose a self-draft framework that suppresses spurious confidence via layer-wise temperature annealing in early-exit decision and adaptively bounds speculation length based on token-wise decoding difficulty.
Outcome: The proposed framework suppresses spurious confidence and bounds speculation length based on token-wise decoding difficulty.
Speculative Decoding via Early-exiting for Faster LLM Inference with Thompson Sampling Control Mechanism (2024.findings-acl)

Copied to clipboard

Challenge: Existing approaches to generate draft tokens in large language models are expensive and resource-intensive.
Approach: They propose an approach to generate draft tokens using a segment of the LLM and a self-distillation method to enhance the quality of draft token.
Outcome: The proposed approach generates draft tokens using a segment of the LLM and a self-distillation method to improve quality and speed up generation.
UniSpec: Training-Free Speculative Decoding for Robust LLM Acceleration Across Languages and Hardware (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for speculative decoding ignore device-specific verification costs and lack of mechanisms to assess draft token quality.
Approach: They propose a training-free, lossless speculative decoding framework that enables robust, plug-and-play LLM acceleration across diverse hardware configurations and languages.
Outcome: The proposed framework outperforms existing training-free methods while maintaining identical output quality across different hardware environments.
Unlocking Efficiency in Large Language Model Inference: A Comprehensive Survey of Speculative Decoding (2024.findings-acl)

Copied to clipboard

Challenge: Large Language Models (LLMs) have a high inference latency stemming from autoregressive decoding.
Approach: They propose a novel decoding paradigm that drafts multiple tokens and verifies them in parallel . they aim to provide a catalyst for further research on Speculative Decoding .
Outcome: The proposed method drafts multiple tokens and verifies them in parallel . it can be used to accelerate inference in large language models.
DiffuSpec: Unlocking Diffusion Language Models for Speculative Decoding (2026.findings-acl)

Copied to clipboard

Challenge: Autoregressive (AR) decoding in large language models is latency-bounded by strictly sequential token generation.
Approach: They propose a diffusion-based drafter that proposes multi-token candidates and then verifies them in parallel by the target model.
Outcome: The proposed drafter generates multi-token proposals in a single forward pass while remaining compatible with standard AR verifiers.
LayerSkip: Enabling Early Exit Inference and Self-Speculative Decoding (2024.acl-long)

Copied to clipboard

Challenge: Large Language Models (LLMs) have been deployed to many applications, yet their high compute and memory requirements lead to high financial and energy costs when deployed to GPU servers.
Approach: They propose an end-to-end solution to speed-up inference of large language models . they apply layer dropout, and show that it increases the accuracy of early exit at earlier layers without adding any auxiliary layers or modules to the model.
Outcome: The proposed method shows speedups of up to 2.16x on summarization for CNN/DM documents, 1.82x on coding, and 2.0x on TOPv2 semantic parsing task.
Exploring the Hidden Capacity of LLMs for One-Step Text Generation (2025.emnlp-main)

Copied to clipboard

Challenge: Large language models (LLMs) can reconstruct surprisingly long texts via autoregressive generation from just one trained input embedding.
Approach: They show that large language models can reconstruct surprisingly long texts via autoregressive generation from just one trained input embedding.
Outcome: The proposed model can generate hundreds of accurate tokens in one token-parallel forward pass, when provided with only two learned embeddings.
Hierarchical Speculative Decoding with Dynamic Window (2025.findings-naacl)

Copied to clipboard

Challenge: Speculative decoding (SD) uses an efficient draft model to generate multiple tokens . previous methods depend on simple heuristics to select K or dynamically adjust the window size .
Approach: They propose a framework that allows a draft model to generate multiple tokens . they propose HSDDW, which allows the draft model autonomously decide when to stop generating tokens.
Outcome: The proposed framework outperforms existing state-of-the-art methods on four datasets.
Speculative Streaming: Efficient and Scalable Speculative Decoding with Multi-Stream Attention (2025.emnlp-main)

Copied to clipboard

Challenge: Speculative decoding is a prominent technique for accelerating LLM inference by leveraging an auxiliary draft model, but its effectiveness is limited by the autoregressive nature of draft generation.
Approach: They propose a method that integrates speculative draft generation directly within the target model using multi-stream attention.
Outcome: The proposed method improves acceptance but also latency and speculation latency, limiting overall speedup.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations