MVQ:Towards Efficient DNN Compression and Acceleration with Masked Vector Quantization
Not on the map. Why?
Abstract (arXiv)
Vector quantization(VQ) is a hardware-friendly DNN compression method that can reduce the storage cost and weight-loading datawidth of hardware accelerators. However, conventional VQ techniques lead to significant accuracy loss because the important weights are not well preserved. To tackle this problem, a novel approach called MVQ is proposed, which aims at better approximating important weights with a limited number of codewords. At the algorithm level, our approach removes the less important weights through N:M pruning and then minimizes the vector clustering error between the remaining weights and codewords by the masked k-means algorithm. Only distances between the unpruned weights and the codewords are computed, which are then used to update the codewords. At the architecture level, our accelerator implements vector quantization on an EWS (Enhanced weight stationary) CNN accelerator and proposes a sparse systolic array design to maximize the benefits brought by masked vector quantization. Our algorithm is validated on various models for image classification, object detection, and segmentation tasks. Experimental results demonstrate that MVQ not only outperforms conventional vector quantization methods at comparable compression ratios but also reduces FLOPs. Under ASIC evaluation, our MVQ accelerator boosts energy efficiency by 2.3× and reduces the size of the systolic array by 55% when compared with the base EWS accelerator. Compared to the previous sparse accelerators, MVQ achieves 1.73× higher energy efficiency.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 16 of its 40 references that are in the map. First posted on arXiv 13 Dec 2024.
Builds on
16 of 40 references.
References · 16
- 2014Microsoft COCO: Common Objects in Contextcited by 17,498
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
- 2017Rethinking Atrous Convolution for Semantic Image Segmentationcited by 2,154
- 2016Pruning Filters for Efficient ConvNetscited by 1,129
- 2017In-Datacenter Performance Analysis of a Tensor Processing Unitcited by 610
- 2019Learned Step Size Quantizationcited by 604
- 2017Learning Sparse Neural Networks through L0 Regularizationcited by 571
- 2019Importance Estimation for Neural Network Pruningcited by 531
- 2020Comparing Rewinding and Fine-tuning in Neural Network Pruningcited by 238
- 2015Quantized Convolutional Neural Networks for Mobile Devicescited by 212
- 2021Learning N:M Fine-grained Structured Sparse Neural Networks From Scratchcited by 177
- 2019And the Bit Goes Down: Revisiting the Quantization of Neural Networkscited by 78
4 more
- 2019Gemmini: Enabling Systematic Deep-Learning Architecture Evaluation via Full-Stack Integrationcited by 59
- 2020Permute, Quantize, and Fine-tune: Efficient Compression of Neural Networkscited by 28
- 2021S2TA: Exploiting Structured Sparsity for Energy-Efficient Mobile CNN Accelerationcited by 19
- 2020Systolic Tensor Array: An Efficient Structured-Sparse GEMM Accelerator for Mobile CNN Inferencecited by 17
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.