LC-QAT: Data-Efficient 2-Bit QAT for LLMs via Linear-Constrained Vector Quantization

Haoyu Wang, Xingyu Yu, Haiyan Zhao, Fengxiang Wang, Xu Han
6/9/2026
cs.CLcs.AI

No official code found. Best implementation: backspacetg/unisvq (1 star, last commit 2026-05-29).

Abstract

Quantization-aware training (QAT) is essential for extremely low-bit large language models (LLMs). Current QAT methods are mainly based on scalar quantization (SQ), which enables efficient optimization but suffers from severe performance degradation at 2-bit precision. On the other hand, vector quantization (VQ) provides substantially higher representational capacity, but its discrete codebook lookup prevents end-to-end training. We propose LC-QAT, a 2-bit weight-only VQ-QAT framework that represents quantized weights via a learned affine mapping over discrete vectors, which yields a high-quality PTQ initialization and enables fully differentiable end-to-end optimization without explicit codebook lookup in the training forward pass. This strong post-training initialization makes LC-QAT highly data-efficient. Experiments across diverse LLMs demonstrate that LC-QAT consistently outperforms state-of-the-art QAT methods while using only 0.1%--10% of the training data. Our results establish LC-QAT as a practical and scalable solution for extreme low-bit model deployment.

View on arXivView PDF

Code Implementations(1)

backspacetg/unisvqCommunity64%

Codes of our ICML 2026 paper UniSVQ: 2-bit Unified Scalar-Vector Quantization and LC-QAT: Data-Efficient 2-Bit QAT for LLMs via Linear-Constrained Vector Quantization.

11May 25, 20264 months ago

Similar Papers

Cite this paper

@article{wang2026lcqat,
  title  = {LC-QAT: Data-Efficient 2-Bit QAT for LLMs via Linear-Constrained Vector Quantization},
  author = {Haoyu Wang and Xingyu Yu and Haiyan Zhao and Fengxiang Wang and Xu Han},
  year   = {2026},
  eprint = {2606.10531},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2606.10531v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2606.10531.svg)](https://codeofpaper.com/paper/2606.10531)

Discussion