From Quarter to All: Accelerating Speculative LLM Decoding via Floating-Point Exponent Remapping and Parameter Sharing
Yushu Zhao, Yubin Qin, Yang Wang, Xiaolong Yang, Huiming Han, Shaojun Wei, Yang Hu, Shouyi Yin
TL;DR
SPEQ addresses the latency bottleneck in large language model decoding by combining a lossless speculative decoding pipeline with a novel bit-sharing BSFP quantization that derives a 4-bit draft from the full FP16 model. A reconfigurable PE array co-optimizes the forward passes for both the draft and verification steps, enabling high hardware utilization and zero KV-cache overhead. The approach achieves substantial speedups (average around 2×) over FP16 and lossy baselines like Olive and Tender across 15 LLMs and multiple tasks, with an average draft-accept rate near 0.98 and no training or extra memory requirements. This algorithm-hardware co-design offers a practical pathway to real-time LLM inference by delivering lossless acceleration without compromising accuracy or safety.
Abstract
Large language models achieve impressive performance across diverse tasks but exhibit high inference latency due to their large parameter sizes. While quantization reduces model size, it often leads to performance degradation compared to the full model. Speculative decoding remains lossless but typically incurs extra overheads. We propose SPEQ, an algorithm-hardware co-designed speculative decoding method that uses part of the full-model weight bits to form a quantized draft model, thereby eliminating additional training or storage overhead. A reconfigurable processing element array enables efficient execution of both the draft and verification passes. Experimental results across 15 LLMs and tasks demonstrate that SPEQ achieves speedups of 2.07x, 1.53x, and 1.45x compared over FP16, Olive, and Tender, respectively.
