BSQ: Exploring Bit-Level Sparsity for Mixed-Precision Neural Network Quantization
원문 초록
Mixed-precision quantization can potentially achieve the optimal tradeoff between performance and compression rate of deep neural networks, and thus, have been widely investigated. However, it lacks a systematic method to determine the exact quantization scheme. Previous methods either examine only a small manually-designed search space or utilize a cumbersome neural architecture search to explore the vast search space. These approaches cannot lead to an optimal quantization scheme efficiently. This work proposes bit-level sparsity quantization (BSQ) to tackle the mixed-precision quantization from a new angle of inducing bit-level sparsity. We consider each bit of quantized weights as an independent trainable variable and introduce a differentiable bit-sparsity regularizer. BSQ can induce all-zero bits across a group of weight elements and realize the dynamic precision reduction, leading to a mixed-precision quantization scheme of the original model. Our method enables the exploration of the full mixed-precision space with a single gradient-based optimization process, with only one hyperparameter to tradeoff the performance and compression. BSQ achieves both higher accuracy and higher bit reduction on various model architectures on the CIFAR-10 and ImageNet datasets comparing to previous methods.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
AnalogNAS-Bench: A NAS Benchmark for Analog In-Memory Computing
From Tiny Machine Learning to Tiny Deep Learning: A Survey
Structured Pruning and Quantization for Learned Image Compression
Optimizing edge AI models on HPC systems with the edge in the loop
BASQ: Branch-wise Activation-clipping Search Quantization for Sub-4-bit Neural Networks
TAS: Ternarized Neural Architecture Search for Resource-Constrained Edge Devices
토론
이 논문과 연결된 포럼 글이 아직 없습니다.