about
Quip: 2-Bit Quantization of Large Language Models with Guarantees (arxiv.org)
1 point by jasondavies on Sep 7, 2023 | hide | past | pdf | discuss on HN

In plain words: It scrambles a model's weights with random rotations before rounding them to two bits, so no direction dominates and rounding hurts less. This is the first to keep large language models usable at two bits per weight, where usual rounding schemes fail.

Abstract · QuIP: 2-Bit Quantization of Large Language Models With Guarantees

This work studies post-training parameter quantization in large language models (LLMs). We introduce quantization with incoherence processing (QuIP), a new method based on the insight that quantization benefits from $\textit{incoherent}$ weight and Hessian matrices, i.e., from the weights being even in magnitude and the directions in which it is important to round them accurately being unaligned with the coordinate axes. QuIP consists of two steps: (1) an adaptive rounding procedure minimizing a quadratic proxy objective; (2) efficient pre- and post-processing that ensures weight and Hessian incoherence via multiplication by random orthogonal matrices. We complement QuIP with the first theoretical analysis for an LLM-scale quantization algorithm, and show that our theory also applies to an existing method, OPTQ. Empirically, we find that our incoherence preprocessing improves several existing quantization algorithms and yields the first LLM quantization methods that produce viable results using only two bits per weight. Our code can be found at https://github.com/Cornell-RelaxML/QuIP.

Jerry Chee, Yaohui Cai, Volodymyr Kuleshov, Christopher De Sa
arXiv:2307.13304 · cs.LG, cs.CL · submitted Jul 25, 2023 · updated Jan 15, 2024
abstract · pdf · html

add comment on HN