Optimal Scalar Quantization for Matrix Multiplication: Closed-Form Density and Phase Transition
Calvin Ang, Sungyoon Kim, Mert Pilanci

TL;DR
This paper derives optimal scalar quantization strategies for matrix multiplication, revealing a phase transition in quantization density related to correlation, with practical applications demonstrated in neural network activation quantization.
Contribution
It provides a closed-form density for optimal scalar quantization in matrix multiplication and characterizes a correlation-driven phase transition in the quantization density.
Findings
Derived a sharp asymptotic expansion for quantization error.
Identified a closed-form optimal density for correlated Gaussian pairs.
Discovered a phase transition in the optimal density based on correlation.
Abstract
We study entrywise scalar quantization of two matrices prior to multiplication. Given and , we quantize entries of and independently using scalar quantizers with and levels per entry, and form . The objective is to minimize the matrix multiplication mean-squared error (MSE) under a pair-i.i.d.\ inner-product model. In the high-resolution regime , we derive a sharp asymptotic expansion for , identify the exact optimal leading constants, and characterize asymptotically optimal quantization center densities in terms of conditional second moments. We then specialize to correlated Gaussian multiplicative pairs, obtaining a closed-form optimal point density \[ \lambda^\star(u)\ \propto\…
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
TopicsStochastic Gradient Optimization Techniques · Sparse and Compressive Sensing Techniques · Tensor decomposition and applications
