Cross-Layer Error Compensation and Finite-Sample Feature-Statistics Matching for Extreme Low-Bit Quantization of Large Language Models
arXiv:2607.14630
2026
Memory
1 ideas extracted · analyzed Aug 30, 2026
What the math gives to ML
This paper contains a directly transferable mechanism for extreme post-training quantization: optimize each quantized layer against the network-level error accumulated before that layer, rather than against an isolated full-precision layer output. The key asset is the exact nonlinear error recursion, which allows the incoming quantization error to be measured with a forward difference instead of approximating every transformer block by a Jacobian. This gives a practical greedy calibration algorithm that can compensate for errors across depth and should be especially valuable for binary or 2-bit weights, where local reconstruction is badly misleading. The most promising first implementation is a drop-in replacement for layer-local PTQ calibration, with the same group-wise codebook and scales but a compensation target computed from the current quantized prefix.
Ideas from this paper
△ Mechanism confirmed, baseline not beaten
2026
Replace layer-local reconstruction in post-training quantization with a sequential objective that explicitly cancels the error already accumulated by the quantized prefix. For each layer, quantize its weights so that its local residual approximately negates the propagated incoming deviation, preserving the teacher trajectory even when the codebook is binary or 4-bit.
Useful8/10
Difficulty5/10
Novelty7/10