Memoryless scalar quantization for random frames
Kateryna Melnykova, Ozgur Yilmaz

TL;DR
This paper provides rigorous, non-asymptotic error bounds for memoryless scalar quantization of signals using random frames with sub-Gaussian rows, validating empirical decay rates without relying on the white noise hypothesis.
Contribution
It establishes the first rigorous error bounds for MSQ with random frames, confirming observed decay rates and extending analysis to compressed sensing without the white noise hypothesis.
Findings
Error bounds match empirical decay rates
Reconstruction error does not always decrease with redundancy
Extension of analysis to compressed sensing setting
Abstract
Memoryless scalar quantization (MSQ) is a common technique to quantize frame coefficients of signals (which are used as a model for generalized linear samples), making them compatible with our digital technology. The process of quantization is generally not invertible, and thus one can only recover an approximation to the original signal from its quantized coefficients. The non-linear nature of quantization makes the analysis of the corresponding approximation error challenging, often resulting in the use of a simplifying assumption, called the "white noise hypothesis" (WNH) that simplifies this analysis. However, the WNH is known to be not rigorous and, at least in certain cases, not valid. Given a fixed, deterministic signal, we assume that we use a random frame, whose analysis matrix has independent isotropic sub-Gaussian rows, to collect the measurements, which are consecutively…
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.
