Foundations of Large Language Model Compression -- Part 1: Weight Quantization
Sean I. Young

TL;DR
This paper introduces CVXQ, a convex optimization-based framework for weight quantization of large language models, enabling flexible, post-training compression of models with hundreds of billions of parameters.
Contribution
It provides a novel convex optimization approach for LLM weight quantization and a scalable framework that allows post-training model size reduction.
Findings
CVXQ achieves optimal quantization outcomes.
The framework scales to models with hundreds of billions of parameters.
It enables flexible post-training compression to any specified size.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNatural Language Processing Techniques · Topic Modeling · Algorithms and Data Compression
