Quantization is pivotal for mitigating the significant memory and computational overhead of Large Language Models (LLMs). While emerging transformation-based methods have successfully enhanced quantization by projecting feature spaces onto smoother manifolds using orthogonal matrices, they typically enforce a rigid one-to-one transformation constraint. This static approach fails to account for the dynamic patterns inherent in input activations, particularly within diffusion LLMs (dLLMs) and Multimodal LLMs (MLLMs), where varying token types exhibit distinct distributions. To advance this, we propose FreeAct, a novel quantization framework that relaxes the static one-to-one constraint to accommodate dynamic activation disparities. Theoretically, we leverage the rank-deficient nature of activations to derive a solution space that extends beyond simple inverse matrices, enabling the decoupling of activation transformations from weights. Methodologically, FreeAct identifies token-specific dynamics (i.e., vision v.s. text, or masked tokens) and allocates distinct transformation matrices to the activation side, while maintaining a unified, static transformation for the weights. Extensive experiments across dLLMs and MLLMs demonstrate that FreeAct significantly outperforms baselines, up to 5.3% performance improvement, with in-depth analyses. Our code will be publicly released.
Figures & tables
Figure 1: The steep activation is smoothed by the designed transformation matrix for quantization ( top ). One weight corresponds to one transformation to ensure equivalence, i.e. , P×P−1=I . In practice, activations are diverse, reflecting dynamic patterns, necessitating flexible transformation matrices on the activation side, while keeping static on the weight side for quantization ( bottom ).
Figure 2: Illustrative example of activations between masked and unmasked tokens along the diffusion time-steps (dLLMs).
Figure 3: Illustrative example of activation distributions between vision and text tokens at different layers in MLLMs.
Figure 4: The overall framework of FreeAct. Different tokens are indexed to different transformation matrices according to their unique types (vision-text for MLLMs, and unmasked and masked for dLLMs). Different transformation matrices maintain a shared part together while possessing their own uniqueness, where zeros are filled in on another portion. The weight transformation matrix unites both portions to handle all the different activations. And the quantization error is minimized to optimize the quantization parameter.
dLLMs
MLLMs
HumanEval
GSM8K
Math500
Avg.
MMMU
MMBench
RealworldQA
Avg.
LLaDA
Qwen2.5-VL
16-bit Baseline
43.90
76.80
38.40
53.03
50.44
83.25
68.50
67.40
RTN (W8A8)
39.02
77.56
37.00
51.19
49.33
82.38
68.50
66.74
RTN (W4A4)
00.00
00.00
00.14
00.05
26.33
00.09
00.65
09.02
SmoothQuant
00.00
00.00
00.00
00.00
24.41
00.43
01.17
08.67
Table 1: Overall performance comparison of FreeAct against quantization methods across four models. The best result in each case is marked in bold, and the averaged value is under the column “Avg.”.
Figure 5: Performance comparison under different rank-deficient settings, tested on LLaDA ( left ) and Qwen2.5VL ( right ).
LLaDA
Dream
Math
HumanEval
Math
HumanEval
FreeAct w/o L.C.
73.09
34.15
55.65
34.14
FreeAct
75.74
34.60
68.84
50.00
Qwen2.5VL
InternVL2.5
MMMU
MMBench
MMMU
MMBench
FreeAct w/o L.C.
46.44
79.30
40.22
65.12
Table 2: Performance comparison with FreeAct without a learnable clip threshold (L.C.).
Figure 6: Quantization errors optimized along with the training steps across different layers. X and X′ denote different activation types, i.e. , masked and unmasked token. The values in the left figure are normalized per layer.
Figure 7: Activation distributions after the transformation.
Figure 8: Performance comparison across FlatQuant and fully applied FreeAct.
Appendix figures & tables10 assets
Supplementary material from the paper’s appendix.
Appendix
Figure 9: The full losses trained on the calibration dataset for four models. The quantization errors are measured per layer and grouped in terms of different activation types. To better show the differences, the numerical values are normalized.
Figure 10: The full losses trained on the calibration dataset for four models. The quantization errors are measured per layer and grouped in terms of different activation types.
Figure 11: Illustrative examples of activation distributions across different layers on LLaDA-8B-Instruct . There is a clear dividing line between unmasked and masked tokens.
Figure 12: Illustrative examples of activation distributions across different layers on Dream-v0-Instruct-7B . There is a clear dividing line and spikes to distinguish unmasked and masked tokens.
Figure 13: Illustrative examples of activation distributions across different layers on Qwen2.5-VL-7B-Instruct . Only the language tower is plotted. There is a clear dividing line to distinguish vision and text tokens.
Figure 14: Illustrative examples of activation distributions across different layers on InternVL2.5-8B . Only the language tower is plotted. There is a clear dividing line to distinguish vision and text tokens.
Figure 15: Case study of how FreeAct integrates into LLaDA and performs under the W4A4 quantization setting on the GSM8K dataset, compared with the RTN method, which fails to respond.
Figure 16: Case study of how FreeAct integrates into Dream and performs under the W4A4 quantization setting on the GSM8K dataset, compared with the RTN method, which fails to respond.
Figure 17: Case study of how FreeAct integrates into QWen2.5 VL and performs under the W4A4 quantization setting on the MMMU dataset, compared with the RTN method, which fails to respond.
Figure 18: Case study of how FreeAct integrates into InternVL2.5 and performs under the W4A4 quantization setting on the MMMU dataset, compared with the RTN method, which fails to respond.
Low-bit activation quantization remains a major bottleneck in efficient large language model (LLM) deployment. The difficulty is not only that activations contain outliers, but that their distributions are often poorly matched to a low-bit uniform quantizer. Existing post-training quantization (PTQ) methods suppress peaks, balance channels, or minimize reconstruction error, yet they rarely specify what activation distribution is actually easy to discretize. As a result, activations may appear numerically smoother while still incurring large quantization error because the quantization range remains wide or most values collapse into a few levels near the mean. We recast activation transformation as quantizer-facing distribution design and analyze quantization error from an information-theoretic perspective. Our analysis shows that quantization-friendly activations should jointly have a smaller numerical range and sufficient dispersion within that range. Guided by this analysis, we propose InfoQuant, a train-free method that employs Peak Suppression Orthogonal Transformation (PSOT) to shape activations into more quantization-friendly distributions. We further introduce adaptive outlier-token selection to improve the robustness of PSOT during optimization. Across multiple LLM families, InfoQuant consistently outperforms prior PTQ and end-to-end training baselines. Under W4A4KV4, it preserves 97% of floating-point accuracy on average and reduces the LLaMA-2 13B performance gap by 42% over the previous state of the art. Code is available at https://github.com/LLIKKE/InfoQuant
Ke Li, Dong An, Xiaoling Zang +6
School of Software Technology, Zhejiang University · Ant Group · College of Computer Science and Technology, Zhejiang University of Technology +3
The increasing size and complexity of large language models (LLMs) have raised significant challenges in deployment efficiency, particularly under resource constraints. Post-training quantization (PTQ) has emerged as a practical solution by compressing models without requiring retraining. While existing methods focus on uniform quantization schemes for both weights and activations, they often suffer from substantial accuracy degradation due to the non-uniform nature of activation distributions. In this work, we revisit the activation quantization problem from a theoretical perspective grounded in the Lloyd-Max optimality conditions. We identify the core issue as the non-uniform distribution of activations within the quantization interval, which causes the optimal quantization point under the Lloyd-Max criterion to shift away from the midpoint of the interval. To address this issue, we propose a two-stage orthogonal transformation method, RUQuant. In the first stage, activations are divided into blocks. Each block is mapped to uniformly sampled target vectors using composite orthogonal matrices, which are constructed from Householder reflections and Givens rotations. In the second stage, a global Householder reflection is fine-tuned to further minimize quantization error using Transformer output discrepancies. Empirical results show that our method achieves near-optimal quantization performance without requiring model fine-tuning: RUQuant achieves 99.8% of full-precision accuracy with W6A6 and 97% with W4A4 quantization for a 13B LLM, within approximately one minute. A fine-tuned variant yields even higher accuracy, demonstrating the effectiveness and scalability of our approach.
Han Liu, Haotian Gao, Changya Li +4
Dalian University of Technology Dalian, China · Peking University Beijing, China · Macao Polytechnic University Macao, China
Post-training quantization (PTQ) is essential for efficient large language model (LLM) inference, but reliably quantizing activations remains challenging when weights, activations, and KV caches are all quantized to 4-bit precision. A key difficulty lies in massive activations, whose extreme values dominate the activation range and amplify quantization error. State-of-the-art methods mitigate massive activations through transformation-based smoothing, such as orthogonal rotations and affine scaling, but overlook the cross-layer dynamics of the residual stream. In this paper, we show that massive activations emerge and disappear in a phase-wise pattern across network depth, injecting abrupt updates into the residual stream. These updates cause the newly injected layer-wise signal to dominate the 4-bit quantization scale and weaken the accumulated residual information. To characterize this behavior, we introduce two metrics, the Update Dominance Ratio (UDR) and the Historical Retention Score (HRS), and show that static transformation-based smoothing cannot fully resolve the resulting dynamic quantization instability. Based on this analysis, we propose PhaseQuant, a phase-aware mixed-precision post-training quantization policy for activation quantization. PhaseQuant identifies quantization-sensitive layers from residual-stream dynamics and assigns 8-bit activation precision only to these layers, while keeping weights, KV caches, and all remaining activations at 4-bit precision. It can be directly integrated with strong PTQ baselines such as QuaRot, SpinQuant, and FlatQuant. Experiments on LLaMA-2 and LLaMA-3 show that PhaseQuant consistently improves perplexity and zero-shot QA performance under W4A4KV4 quantization, while achieving 1.05×--1.07× throughput improvement with modest memory overhead. These results demonstrate a practical path toward robust low-bit LLM inference.
Zimo Zhao, Maolin Wang, Bowen Yu +3
City University of Hong Kong Hong Kong, China · Zhejiang University of Technology Hangzhou, China