Saved in:
Bibliographic Details
Main Authors: Liu, Siran, Ye, Yang, Zhu, Qianchao, Cao, Zane, He, Yongchao
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2505.13254
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866914110442045440
author Liu, Siran
Ye, Yang
Zhu, Qianchao
Cao, Zane
He, Yongchao
author_facet Liu, Siran
Ye, Yang
Zhu, Qianchao
Cao, Zane
He, Yongchao
contents Autoregressive decoding inherently limits the inference throughput of Large Language Model (LLM) due to its sequential dependency. Speculative decoding mitigates this by verifying multiple predicted tokens in parallel, but its efficiency remains constrained by what we identify as verification heterogeneity -- the uneven difficulty of verifying different speculative candidates. In practice, a small subset of high-confidence predictions accounts for most successful verifications, yet existing methods treat all candidates uniformly, leading to redundant computation. We present HeteroSpec, a heterogeneity-adaptive speculative decoding framework that allocates verification effort in proportion to candidate uncertainty. HeteroSpec estimates verification complexity using a lightweight entropy-based quantifier, partitions candidates via a data-driven stratification policy, and dynamically tunes speculative depth and pruning thresholds through coordinated optimization. Across five benchmarks and four LLMs, HeteroSpec delivers an average 4.24$\times$ decoding speedup over state-of-the-art methods such as EAGLE-3, while preserving exact output distributions. Crucially, HeteroSpec requires no model retraining and remains compatible with other inference optimizations, making it a practical direction for improving speculative decoding efficiency.
format Preprint
id arxiv_https___arxiv_org_abs_2505_13254
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle HeteroSpec: Leveraging Contextual Heterogeneity for Efficient Speculative Decoding
Liu, Siran
Ye, Yang
Zhu, Qianchao
Cao, Zane
He, Yongchao
Computation and Language
Autoregressive decoding inherently limits the inference throughput of Large Language Model (LLM) due to its sequential dependency. Speculative decoding mitigates this by verifying multiple predicted tokens in parallel, but its efficiency remains constrained by what we identify as verification heterogeneity -- the uneven difficulty of verifying different speculative candidates. In practice, a small subset of high-confidence predictions accounts for most successful verifications, yet existing methods treat all candidates uniformly, leading to redundant computation. We present HeteroSpec, a heterogeneity-adaptive speculative decoding framework that allocates verification effort in proportion to candidate uncertainty. HeteroSpec estimates verification complexity using a lightweight entropy-based quantifier, partitions candidates via a data-driven stratification policy, and dynamically tunes speculative depth and pruning thresholds through coordinated optimization. Across five benchmarks and four LLMs, HeteroSpec delivers an average 4.24$\times$ decoding speedup over state-of-the-art methods such as EAGLE-3, while preserving exact output distributions. Crucially, HeteroSpec requires no model retraining and remains compatible with other inference optimizations, making it a practical direction for improving speculative decoding efficiency.
title HeteroSpec: Leveraging Contextual Heterogeneity for Efficient Speculative Decoding
topic Computation and Language
url https://arxiv.org/abs/2505.13254