REVIEW 3 cited by
FrameQuant: Flexible Low-Bit Quantization for Transformers
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Transformers are the backbone of powerful foundation models for many Vision and Natural Language Processing tasks. But their compute and memory/storage footprint is large, and so, serving such models is expensive often requiring high-end hardware. To mitigate this difficulty, Post-Training Quantization seeks to modify a pre-trained model and quantize it to eight bits or lower, significantly boosting compute/memory/latency efficiency. Such models have been successfully quantized to four bits with some performance loss. In this work, we outline a simple scheme to quantize Transformer-based models to just two bits (plus some overhead) with only a small drop in accuracy. Key to our formulation is a concept borrowed from Harmonic analysis called Fusion Frames. Our main finding is that the quantization must take place not in the original weight space, but instead in the Fusion Frame representations. If quantization is interpreted as the addition of noise, our casting of the problem allows invoking an extensive body of known consistent recovery and noise robustness guarantees. Further, if desired, de-noising filters are known in closed form. We show empirically, via a variety of experiments, that (almost) two-bit quantization for Transformer models promises sizable efficiency gains. The code is available at https://github.com/vsingh-group/FrameQuant
Forward citations
Cited by 3 Pith papers
-
NeUQI: Near-Optimal Uniform Quantization Parameter Initialization for Low-Bit LLMs
NeUQI improves low-bit uniform quantization of LLMs by relaxing the integer zero-point constraint and efficiently searching a near-optimal scale, beating existing PTQ baselines at 2-4 bits.
-
Inference-time sparse attention with asymmetric indexing
Saap approximates attention by clustering keys with k-means and learning a query classifier, reducing KV-cache lookups about 20x at 4-5% selectivity with small accuracy loss on several long-context benchmarks.
-
Matryoshka Quantization
A single LLM can be trained to support multiple weight precisions at once, with the 2-bit version significantly more accurate than standard 2-bit quantization.
Discussion (0). Continue with ORCID to comment.