Taming Sensitive Weights : Noise Perturbation Fine-tuning for Robust LLM Quantization
Dongwei Wang, Huanrui Yang
TL;DR
Quantizing large language models is hindered by a small set of highly sensitive outlier weights. NPFT identifies these outliers via a Fisher-information proxy, estimates the Hessian trace through random perturbations, and performs LoRA-based PEFT fine-tuning with noise to minimize the expected loss under perturbation, thereby reducing $\mathrm{Tr}(H)$ and enabling uniform-precision quantization. The method achieves consistent improvements across uniform and non-uniform quantizers, matches or surpasses strong PTQ baselines on OPT and LLaMA, and delivers notable inference efficiency gains with lower training cost than QAT approaches. This approach enhances hardware-friendly deployment by removing the need to preserve outliers in higher precision while maintaining or improving quantized-model performance.
Abstract
Quantization is a critical step to enable efficient LLM serving under limited resource. However, previous research observes that certain weights in the LLM, known as outliers, are significantly sensitive to quantization noises. Existing quantization methods leave these outliers as floating points or higher precisions to retain performance, posting challenges on the efficient hardware deployment of the mixed-precision model. This work investigates an alternative way to tame the sensitive weights' impact on the quantization error, by reducing the loss Hessian trace with respect to outliers through an efficient fine-tuning process. We propose Noise Perturbation Fine-tuning (NPFT), which identifies outlier weights and add random weight perturbations on the outliers as the model going through a PEFT optimization. NPFT tames the sensitivity of outlier weights so that the quantized model performance can be improved without special treatment to the outliers. When applied to OPT and LLaMA models, our NPFT method achieves stable performance improvements for both uniform and non-uniform quantizers, while also offering better inference efficiency. Notably, the simplest RTN can achieve performance on par with GPTQ using our NPFT on LLaMA2-7B-4bits benchmark.
