Rotation-based Post-Training Quantization (PTQ) has emerged as a promising solution for mitigating activation outliers in the quantization of Large Language Models (LLMs). Global rotation methods achieve inference efficiency by fusing activation rotations into attention and FFN blocks, but suffer from limited expressivity as they are constrained to use a single learnable rotation matrix across all layers. To tackle this, layer-wise transformation methods emerged, achieving superior accuracy through localized adaptation. However, layer-wise methods cannot fuse activation rotation matrices into weights, requiring online computations and causing significant overhead. In this paper, we propose ReSpinQuant, a quantization framework that resolves such overhead by leveraging offline activation rotation fusion and matching basis using efficient residual subspace rotation. This design reconciles the high expressivity of layer-wise adaptation with only negligible inference overhead. Extensive experiments on W4A4 and W3A3 quantization demonstrate that ReSpinQuant achieves state-of-the-art performance, outperforming global rotation methods and matching the accuracy of computationally expensive layer-wise methods with minimal overhead.
Figures & tables
Figure 1: Comparison of rotation paradigms. (a) Global Rotation ensures efficiency via offline weight merging but limits expressivity. (b) Layer-wise Transformation enhances expressivity but incurs high online overhead. (c) ReSpinQuant (Ours) reconciles this trade-off by merging layer-wise rotation into weights, and resolves the basis mismatch problem via subspace residual rotation approximation, achieving both high accuracy and efficiency.
Figure 2: Overview of the ReSpinQuant architecture. Unlike global rotation methods that enforce a shared basis, ReSpinQuant assigns distinct learnable orthogonal matrices ( R1i,R2i , etc.) to each layer i to maximize outlier suppression. (1) Offline Weight Fusion: To ensure offline weight integration, rotation matrices are mathematically absorbed into the weight matrices at inference phase ( dashed red boxes , “Merged and Quantized Weights”), leaving the main computation unchanged. (2) Subspace Residual Approximation: The resulting basis mismatch in residual connections is resolved using our proposed Subspace Residual Rotation Approximation ( dash-dot blue boxes , “Merge and Approximate”). This replaces the expensive dense basis transition with a low-rank correction, reducing alignment complexity from O(D2) to O(D) while maintaining high model expressivity.
Figure 3: Visualization of the trained rotation matrices optimized by Cayley optimizer. We display the sub-blocks [ :4,:4 ] of two rotation matrices ( R1,R2∈R4096×4096 ) of Llama-3 8B layer 16, and their relative transformation ( R1⊤R2 ) after training. Despite optimization, the matrices deviate minimally from the Hadamard initialization. Crucially, the relative transformation R1⊤R2 remains sparse and diagonally dominant, motivating the use of our residual subspace approximation.
Figure 4: Optimization dynamics of rotation matrices on LLaMA-3 8B (Layers 2, 16). (a) The Frobenius norm of the deviation from the initialization, calculated as ∥R−Rinit∥F . The curve indicates stable convergence during training. (b) The cosine similarity between the optimized rotation R and the initialization Rinit remains consistently high. Together, these plots confirm that while the learned rotations successfully converge to an optimal state, they do not deviate significantly from their initial values.
Figure 5: Illustration of the subspace residual rotation approximation. We approximate the dense rotation matrix ( T∈RD×D ) that aligns the residual bases into a low-dimensional subspace to minimize the computational overhead. During inference, the input features are projected into a subspace of rank r via Q , rotated by the approximated matrix ( R^sub∈Rr×r ), and re-projected via Q⊤ . The orthogonal complement passes through the identity path ( I−QQ⊤ ). The alignment complexity is reduced from quadratic O(D2) to linear O(D) .
Bits
Method
LLaMA-2 7B
LLaMA-2 13B
LLaMA-3 8B
LLaMA-3.2 1B
LLaMA-3.2 3B
PPL ↓
0-shot 9 ↑
PPL ↓
0-shot 9 ↑
PPL ↓
0-shot 9 ↑
PPL ↓
0-shot 9 ↑
PPL ↓
0-shot 9 ↑
16-16
FP16
5.47
65.08
4.88
67.77
6.13
68.05
9.76
55.75
7.81
63.44
W4A4
RTN
1753.70
33.69
3575.44
31.24
219.82
36.74
330.79
33.52
266.80
35.15
GPTQ
9787.38
34.89
2841.03
31.46
187.49
35.74
223.08
33.81
168.41
36.51
QuaRot
6.12
62.03
5.37
65.25
7.82
62.90
14.59
46.81
9.99
57.22
SpinQuant
5.98
61.60
5.30
65.58
7.50
64.53
13.52
48.35
9.46
56.78
Table 1: Main results on LLaMA-2, LLaMA-3, and LLaMA-3.2 families. We report Perplexity (PPL) on WikiText-2 and Zero-shot Accuracy (Avg.). ReSpinQuant consistently outperforms the global rotation baseline (SpinQuant) and matches or exceeds the layer-wise baseline across diverse model scales.
Method
Transform Scope
Learnable Parameters
Additional Computation
Parameter Space
Trainable Params
Online Params
Complexity
MACs
SpinQuant ( Liu et al., 2025 )
Global
O(D2)
17.3M
−
O(DlogD)
15.4M
OSTQuant ( Hu et al., 2025 )
Layer-wise
O(D2+L⋅D)
21.7M
−
O(DlogD)
15.4M
FlatQuant ( Sun et al., 2025 )
Layer-wise
O(L⋅D)
5.8M
5.8M
O(D1.5)
198.1M
ReSpinQuant (Ours)
Layer-wise
O(L⋅D2)
1091.0M
8.4M
O(DlogD+rD)
32.3M
Table 2: Comparison of learnable parameters (training vs. online) and multiply-accumulate operations (MACs) for rotation-based quantization methods on Llama3-8B model. ReSpinQuant maximizes learnable parameters during training ( O(L⋅D2) ) for high expressivity, but most are fused into weights, leaving only low-rank subspace residual rotation parameters for online inference.
Batch Size
SpinQuant
ReSpinQuant
TTFT (ms)
TTIT (ms)
TTFT (ms)
TTIT (ms)
1
389.20
120.38
394.75
123.45
2
757.18
122.29
766.03
126.90
4
1,453.42
126.42
1,473.54
129.53
8
2,774.59
141.23
2,886.14
144.80
16
5,589.04
160.95
5,661.14
163.81
Table 3: End-to-end latency comparison on LLaMA-3 8B (W4A4). Measured on an NVIDIA H100 GPU with a sequence length of T=2048 . We report Time to First Token (TTFT) which measures the prefill latency, and Time to Iterative Token (TTIT) representing the decoding latency. ReSpinQuant (rank r=32 ) demonstrates comparable inference speed to the globally-rotated SpinQuant baseline across all batch sizes.
Method
Training Time (Minute)
LLaMA-2 7B
LLaMA-2 13B
LLaMA-3 8B
SpinQuant
17m
23m
17m
OSTQuant
15m
26m
12m
FlatQuant
45m
74m
45m
ReSpinQuant
43m
61m
42m
Table 4: Comparison of calibration overhead measured on a single NVIDIA H100 GPU. Although a larger parameter space leads to increased training time, ReSpinQuant still has a practical calibration time, finishing within an hour for most models.
Rank r
PPL ↓
Zero-shot Avg. ↑
0 (Identity)
20.03
46.94
8
14.20
49.77
16
13.59
50.14
32
13.09
50.74
64
12.84
51.29
128
12.80
50.80
Table 5: Ablation study on approximation rank r using LLaMA-3-8B (W3A3). Performance consistently improves as the rank increases. We select r=32 as the default setting, as it achieves a favorable trade-off between accuracy and parameter efficiency.
Appendix figures & tables5 assets
Supplementary material from the paper’s appendix.
Appendix
Rank r
0
8
16
32
64
128
4096
Cumulative energy of ΔT (%)
0.00
51.07
53.45
55.77
58.55
62.33
100.00
Retained Frobenius magnitude (%)
0.00
70.25
72.09
73.80
75.76
78.34
100.00
Appendix
Table 6: Spectral concentration of the residual transition deviation ΔT=T−I on LLaMA-2 7B under W3A3 quantization.
Setting
Method
LLaMA-2 7B
LLaMA-2 13B
LLaMA-3 8B
LLaMA-3.2 1B
LLaMA-3.2 3B
PPL ↓
0-shot 9 ↑
PPL ↓
0-shot 9 ↑
PPL ↓
0-shot 9 ↑
PPL ↓
0-shot 9 ↑
PPL ↓
0-shot 9 ↑
FP16
Full precision
5.47
65.08
4.88
67.77
6.13
68.05
9.76
55.75
7.81
63.44
W4A4KV16
SpinQuant
5.93
61.98
5.26
65.43
7.38
64.43
13.03
48.98
9.15
57.55
ReSpinQuant
5.69
62.49
5.08
65.63
7.16
65.41
12.36
49.44
8.89
59.49
W4A8KV8
SpinQuant
5.62
64.07
5.00
66.85
6.53
67.28
10.50
53.39
8.24
62.24
ReSpinQuant
5.60
64.24
4.98
67.10
6.53
67.32
10.51
53.28
8.22
62.46
Appendix
Table 7: Additional bit-width results on LLaMA-family models. We report PPL and zero-shot accuracy averaged over nine tasks.
Method
LLaMA-2 7B
LLaMA-2 13B
LLaMA-3 8B
LLaMA-3.2 1B
LLaMA-3.2 3B
PPL ↓
0-shot 9 ↑
PPL ↓
0-shot 9 ↑
PPL ↓
0-shot 9 ↑
PPL ↓
0-shot 9 ↑
PPL ↓
0-shot 9 ↑
SpinQuant
8.07
61.67
7.39
65.46
11.88
63.79
20.33
49.11
14.39
58.01
ReSpinQuant
7.70
62.40
7.29
66.06
11.50
64.67
19.82
49.48
13.99
58.64
Appendix
Table 8: Calibration dataset sensitivity under W4A4KV4. We use C4 as the calibration corpus and report PPL and nine-task zero-shot average accuracy.
Model
Method
BoolQ
PIQA
SIQA
HellaS.
WinoG.
ARC-e
ARC-c
OBQA
LAMB
Avg. ( ↑ )
PPL ( ↓ )
llama2-7b
Full precision
77.77
79.05
45.96
76.00
68.51
74.54
46.16
44.00
73.70
65.08
5.47
RTN
55.63
51.80
34.54
30.01
48.70
27.40
26.11
25.00
3.98
33.69
1753.70
GPTQ
54.95
54.13
35.88
31.60
49.88
32.66
25.26
25.60
4.08
34.89
9787.38
QuaRot
74.13
77.09
43.50
73.27
66.85
70.24
43.52
39.60
70.10
62.03
6.12
Spinquant
73.03
76.44
42.99
72.87
64.40
70.29
42.58
41.40
70.39
61.60
5.98
OSTQuant
74.31
76.88
44.27
73.78
66.85
69.23
41.72
42.80
71.05
62.32
5.95
Appendix
Table 9: Detailed W4A4 quantization results across benchmarks.
Model
Method
BoolQ
PIQA
SIQA
HellaS.
WinoG.
ARC-e
ARC-c
OBQA
LAMB
Avg. ( ↑ )
PPL ( ↓ )
llama2-7b
Full precision
77.77
79.05
45.96
76.00
68.51
74.54
46.16
44.00
73.70
65.08
5.47
RTN
54.74
49.78
34.75
26.39
47.12
25.59
29.10
25.60
0.00
32.56
19519.63
GPTQ
61.87
48.26
34.08
26.10
50.51
25.55
30.29
27.40
0.00
33.78
99691.84
QuaRot
56.36
61.37
35.36
41.73
48.38
43.22
27.13
26.80
28.08
40.94
19.26
Spinquant
62.60
67.79
38.43
56.99
54.78
50.84
32.51
32.00
46.42
49.15
9.69
OSTQuant
60.12
68.88
38.54
56.14
55.56
52.23
29.95
30.80
43.78
48.44
9.53
Appendix
Table 10: Detailed W3A3 quantization results across benchmarks.