Foundations of Large Language Model Compression -- Part 1: Weight Quantization
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 34 of its 47 references that are in the map. First posted on arXiv 3 Sep 2024.
Builds on
34 of 47 references.
References · 34
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
- 2021Training Verifiers to Solve Math Word Problemscited by 9,743
- 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,464
- 2016Pointer Sentinel Mixture Modelscited by 2,992
- 2017Quantization and Training of Neural Networks for Efficient Integer-Arithmetic-Only Inferencecited by 1,548
- 2022SmoothQuant: Accurate and Efficient Post-Training Quantization for Large Language Modelscited by 1,338
- 2023AWQ: Activation-aware Weight Quantization for LLM Compression and Accelerationcited by 1,234
- 2019Learned Step Size Quantizationcited by 604
- 2020Up or Down? Adaptive Rounding for Post-Training Quantizationcited by 600
- 2022ZeroQuant: Efficient and Affordable Post-Training Quantization for Large-Scale Transformerscited by 517
- 2018HAQ: Hardware-Aware Automated Quantization with Mixed Precisioncited by 426
- 2023OmniQuant: Omnidirectionally Calibrated Quantization for Large Language Modelscited by 403
22 more
- 2019HAWQ: Hessian AWare Quantization of Neural Networks with Mixed-Precisioncited by 387
- 2023SpQR: A Sparse-Quantized Representation for Near-Lossless LLM Weight Compressioncited by 359
- 2019Data-Free Quantization Through Weight Equalization and Bias Correctioncited by 328
- 2022Optimal Brain Compression: A Framework for Accurate Post-Training Quantization and Pruningcited by 317
- 2023SqueezeLLM: Dense-and-Sparse Quantizationcited by 285
- 2018LQ-Nets: Learned Quantization for Highly Accurate and Compact Deep Neural Networkscited by 272
- 2024Extreme Compression of Large Language Models via Additive Quantizationcited by 223
- 2017Incremental Network Quantization: Towards Lossless CNNs with Low-Precision Weightscited by 211
- 2014Compressing Deep Convolutional Networks using Vector Quantizationcited by 189
- 2019Improving Neural Network Quantization without Retraining using Outlier Channel Splittingcited by 150
- 2024LLM Inference Unveiled: Survey and Roofline Model Insightscited by 147
- 2023OWQ: Outlier-Aware Weight Quantization for Efficient Fine-Tuning and Inference of Large Language Modelscited by 113
- 2019Loss Aware Post-training Quantizationcited by 94
- 2020Generative Low-bitwidth Data Free Quantizationcited by 87
- 2024SliM-LLM: Salience-Driven Mixed-Precision Quantization for Large Language Modelscited by 61
- 2021Towards Mixed-Precision Quantization of Neural Networks via Constrained Optimizationcited by 57
- 2021Qimera: Data-free Quantization with Synthetic Boundary Supporting Samplescited by 39
- 2024APTQ: Attention-aware Post-Training Mixed-Precision Quantization for Large Language Modelscited by 33
- 2018Loss-aware Weight Quantization of Deep Networkscited by 31
- 2019Adaptive Loss-aware Quantization for Multi-bit Networkscited by 29
- 2023Adaptive Data-Free Quantizationcited by 26
- 2020Transform Quantization for CNN (Convolutional Neural Network) Compressioncited by 19
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.