paper-with-me

홈 › Papers

Nearly Lossless Adaptive Bit Switching

2025-02-03 · Haiduo Huang, Zhenhua Liu, Tian Xia, Wenzhe Zhao, Pengju Ren

Model quantization is widely applied for compressing and accelerating deep neural networks (DNNs). However, conventional Quantization-Aware Training (QAT) focuses on training DNNs with uniform bit-width. The bit-width settings vary across different hardware and transmission demands, which induces considerable training and storage costs. Hence, the scheme of one-shot joint training multiple precisions is proposed to address this issue. Previous works either store a larger FP32 model to switch between different precision models for higher accuracy or store a smaller INT8 model but compromise accuracy due to using shared quantization parameters. In this paper, we introduce the Double Rounding quantization method, which fully utilizes the quantized representation range to accomplish nearly lossless bit-switching while reducing storage by using the highest integer precision instead of full precision. Furthermore, we observe a competitive interference among different precisions during one-shot joint training, primarily due to inconsistent gradients of quantization scales during backward propagation. To tackle this problem, we propose an Adaptive Learning Rate Scaling (ALRS) technique that dynamically adapts learning rates for various precisions to optimize the training process. Additionally, we extend our Double Rounding to one-shot mixed precision training and develop a Hessian-Aware Stochastic Bit-switching (HASB) strategy. Experimental results on the ImageNet-1K classification demonstrate that our methods have enough advantages to state-of-the-art one-shot joint QAT in both multi-precision and mixed-precision. We also validate the feasibility of our method on detection and segmentation tasks, as well as on LLMs task. Our codes are available at https://github.com/haiduo/Double-Rounding.

📄 PDF Abstract BibTeX arXiv:2502.01199

Code (1)

haiduo/Double-Rounding 공식 구현 pytorch

Tasks

Quantization

Similar Papers 제목 키워드 기반

SampleAttention: Near-Lossless Acceleration of Long Context LLM Inference with Adaptive Structured Sparse Attention

2024-06-17 · Qianchao Zhu, Jiangfei Duan, Chang Chen, Siran Liu 외

Large language models (LLMs) now support extremely long context windows, but the quadratic complexity of vanilla attention results in significantly long Time-to-First-Token (TTFT) latency. Existing approaches to address …

Smoothed Online Convex Optimization Based on Discounted-Normal-Predictor

2022-05-02 · Lijun Zhang, Wei Jiang, JinFeng Yi, Tianbao Yang

In this paper, we investigate an online prediction strategy named as Discounted-Normal-Predictor (Kapralov and Panigrahy, 2010) for smoothed online convex optimization (SOCO), in which the learner needs to minimize not o…

Online Learning with Switching Costs and Other Adaptive Adversaries

2013-02-18 · NeurIPS 2013 12 · Nicolo Cesa-Bianchi, Ofer Dekel, Ohad Shamir

We study the power of different types of adaptive (nonoblivious) adversaries in the setting of prediction with expert advice, under both full-information and bandit feedback. We measure the player's performance using a n…

Online Learning with Costly Features and Labels

2013-12-01 · NeurIPS 2013 12 · Nicolò Cesa-Bianchi, Ofer Dekel, Ohad Shamir

We study the power of different types of adaptive (nonoblivious) adversaries in the setting of prediction with expert advice, under both full-information and bandit feedback. We measure the player's performance using a n…

Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform

2015-04-28 · Mahdi Cheraghchi, Piotr Indyk

For every fixed constant $\alpha > 0$, we design an algorithm for computing the $k$-sparse Walsh-Hadamard transform of an $N$-dimensional vector $x \in \mathbb{R}^N$ in time $k^{1+\alpha} (\log N)^{O(1)}$. Specifically, …

compressed sensing