Fuzzy Speculative Decoding for a Tunable Accuracy-Runtime Tradeoff

Speculative Decoding (SD) enforces strict distributional equivalence to the target model when accepting candidate tokens.While it maintains the target model's generation quality, this strict equivalence limits the speedup achievable by SD and prevents users from trading deviations from the target distribution in exchange for further inference speed gains.To address these limitations, we introduce Fuzzy Speculative Decoding (FSD) -a decoding algorithm that generalizes SD by accepting candidate tokens based on the divergences between the target and draft model distributions.By allowing for controlled divergence from the target model, FSD enables users to flexibly trade generation quality for inference speed.Across several benchmarks, our method is able to achieve significant runtime improvements of over 5 tokens per second faster than SD at only an approximate 2% absolute reduction in benchmark accuracy.In many cases, FSD is even able to match SD benchmark accuracy at over 2 tokens per second faster, demonstrating that distributional equivalence is not necessary to maintain target model performance.Furthermore, FSD can be seamlessly integrated into existing SD extensions; we demonstrate this by applying FSD to EAGLE-2, greatly enhancing this existing extension's efficiency while allowing it to leverage FSD's tunable quality-speed tradeoff.

Authors

Institutions

Publication Details

Published
2025-01-01
DOI
https://doi.org/10.18653/v1/2025.findings-acl.1346
Primary Topic
Formal Methods in Verification
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Fuzzy Speculative Decoding for a Tunable Accuracy-Runtime Tradeoff

Yukun Huang, Bhuwan Dhingra, Maximilian Holsman
Formal Methods in Verification
article

Fuzzy Speculative Decoding for a Tunable Accuracy-Runtime Tradeoff

Yukun Huang, Bhuwan Dhingra, Maximilian Holsman
article en

Abstract

Speculative Decoding (SD) enforces strict distributional equivalence to the target model when accepting candidate tokens.While it maintains the target model's generation quality, this strict equivalence limits the speedup achievable by SD and prevents users from trading deviations from the target distribution in exchange for further inference speed gains.To address these limitations, we introduce Fuzzy Speculative Decoding (FSD) -a decoding algorithm that generalizes SD by accepting candidate tokens based on the divergences between the target and draft model distributions.By allowing for controlled divergence from the target model, FSD enables users to flexibly trade generation quality for inference speed.Across several benchmarks, our method is able to achieve significant runtime improvements of over 5 tokens per second faster than SD at only an approximate 2% absolute reduction in benchmark accuracy.In many cases, FSD is even able to match SD benchmark accuracy at over 2 tokens per second faster, demonstrating that distributional equivalence is not necessary to maintain target model performance.Furthermore, FSD can be seamlessly integrated into existing SD extensions; we demonstrate this by applying FSD to EAGLE-2, greatly enhancing this existing extension's efficiency while allowing it to leverage FSD's tunable quality-speed tradeoff.

Duke University (US), Duke Energy (United States) (US), Duke University Hospital (US)
National Science Foundation
Openalex Percentile: Top 79%
Formal Methods in Verification
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.