Choosing a pre-quantization contraction gauge by minimizing a derived product-error identity gives certified optimal diagonal folds and empirically validated gains for rotations and grouping, tested on quantized matrix products in an image classifier.
Foundations of Large Language Model Compression -- Part 1: Weight Quantization
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
In recent years, compression of large language models (LLMs) has emerged as an important problem to enable language model deployment on resource-constrained devices, reduce computational costs, and mitigate the environmental footprint of large-scale AI infrastructure. In this paper, we lay down the foundation for LLM quantization from a convex optimization perspective and propose a quantization technique that builds on this foundation for optimum quantization outcomes. Our quantization framework, CVXQ, scales to models containing hundreds of billions of weight parameters and provides users with the flexibility to compress models to any specified model size, post-training. A reference implementation of CVXQ can be obtained from github.com/seannz/cvxq.
fields
cs.LG 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Contraction-Gauge Preconditioning for Quantized Matrix Multiplication
Choosing a pre-quantization contraction gauge by minimizing a derived product-error identity gives certified optimal diagonal folds and empirically validated gains for rotations and grouping, tested on quantized matrix products in an image classifier.