Effect of Weight Quantization on Learning Models by Typical Case Analysis
Shuhei Kashiwamura, Ayaka Sakata, Masaaki Imaizumi
TL;DR
This work tackles how weight quantization hyperparameters $b$ and $\omega$ affect generalization in high-dimensional learning. It employs the replica method with a replica-symmetric (RS) analysis, extended to replica-symmetry-breaking (RSB) regimes, and validates predictions with an approximate message-passing (AMP) algorithm. Key contributions include phase diagrams showing RS and RSB regions, the existence of an optimal quantization width $\omega$ that minimizes generalization error, and the finding that non-uniform quantization improves stability and delays overparameterization under quantization. The results provide principled guidance for selecting quantization hyperparameters to balance accuracy and computational efficiency on resource-constrained devices, and offer a rigorous framework linking statistical physics methods to quantized regression in the high-dimensional limit.
Abstract
This paper examines the quantization methods used in large-scale data analysis models and their hyperparameter choices. The recent surge in data analysis scale has significantly increased computational resource requirements. To address this, quantizing model weights has become a prevalent practice in data analysis applications such as deep learning. Quantization is particularly vital for deploying large models on devices with limited computational resources. However, the selection of quantization hyperparameters, like the number of bits and value range for weight quantization, remains an underexplored area. In this study, we employ the typical case analysis from statistical physics, specifically the replica method, to explore the impact of hyperparameters on the quantization of simple learning models. Our analysis yields three key findings: (i) an unstable hyperparameter phase, known as replica symmetry breaking, occurs with a small number of bits and a large quantization width; (ii) there is an optimal quantization width that minimizes error; and (iii) quantization delays the onset of overparameterization, helping to mitigate overfitting as indicated by the double descent phenomenon. We also discover that non-uniform quantization can enhance stability. Additionally, we develop an approximate message-passing algorithm to validate our theoretical results.
