A Note on TurboQuant and the Earlier DRIVE/EDEN Line of Work
Not on the map. Why?
Abstract (arXiv)
This note clarifies the relationship between the recent TurboQuant work and the earlier DRIVE (NeurIPS 2021) and EDEN (ICML 2022) schemes. DRIVE is a 1-bit quantizer that EDEN extended to any b>0 bits per coordinate; we refer to them collectively as EDEN. First, TurboQuantmse is a special case of EDEN obtained by fixing EDEN's scalar scale parameter to S=1. EDEN supports both biased and unbiased quantization, each optimized by a different S (chosen via methods described in the EDEN works). The fixed choice S=1 used by TurboQuant is generally suboptimal, although the optimal S for biased EDEN converges to 1 as the dimension grows; accordingly TurboQuantmse approaches EDEN's behavior for large d. Second, TurboQuantprod combines a biased (b-1)-bit EDEN step with an unbiased 1-bit QJL quantization of the residual. It is suboptimal in three ways: (1) its (b-1)-bit step uses the suboptimal S=1; (2) its 1-bit unbiased residual quantization has worse MSE than (unbiased) 1-bit EDEN; (3) chaining a biased (b-1)-bit step with a 1-bit unbiased residual step is inferior to unbiasedly quantizing the input directly with b-bit EDEN. Third, some of the analysis in the TurboQuant work mirrors that of the EDEN works: both exploit the connection between random rotations and the shifted Beta distribution, use the Lloyd-Max algorithm, and note that Randomized Hadamard Transforms can replace uniform random rotations. Experiments support these claims: biased EDEN (with optimized S) is more accurate than TurboQuantmse, and unbiased EDEN is markedly more accurate than TurboQuantprod, often by more than a bit (e.g., 2-bit EDEN beats 3-bit TurboQuantprod). We also repeat all accuracy experiments from the TurboQuant paper, showing that EDEN outperforms it in every setup we have tried.
Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 5 of its 12 references that are in the map. First posted on arXiv 20 Apr 2026.
Builds on
5 of 12 references.
References · 5
- 2025TurboQuant: Online Vector Quantization with Near-optimal Distortion Ratecited by 125
- 2021EDEN: Communication-Efficient and Robust Distributed Mean Estimation for Federated Learningcited by 55
- 2021DRIVE: One-bit Distributed Mean Estimationcited by 52
- 2024QJL: 1-Bit Quantized JL Transform for KV Cache Quantization with Zero Overheadcited by 52
- 2024RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Searchcited by 48
Built on by
Citing papers per year: 2026: 8.
8 papers.
- 2026Provable Quantization with Randomized Hadamard Transformcited by 8
- 2026Quantizing With Randomized Hadamard Transforms: Efficient Heuristic Now Provencited by 6
- 2026Entropy-Constrained Adaptive Stochastic Quantizationcited by 1
- 2026Block-Sphere Vector Quantizationcited by 0
- 2026A Note on Scaling in Randomly Rotated Quantization and Its Connection to the CDEF +1 Pythagorean Relationcited by 0
- 2026TORQUE: Optimizing What (not) to Quantize Before and After Rotationcited by 0
- 2026WUSH-KV: KV Cache Quantization with Data-Adaptive Transformscited by 0
- 2026Fast Quantized Johnson-Lindenstrauss Transformscited by 0
- 2026Fast Quantized Johnson-Lindenstrauss Transforms12 Oct 2026
- 2026WUSH-KV: KV Cache Quantization with Data-Adaptive Transforms29 Sep 2026
- 2026TORQUE: Optimizing What (not) to Quantize Before and After Rotation28 Sep 2026
- 2026A Note on Scaling in Randomly Rotated Quantization and Its Connection to the CDEF +1 Pythagorean Relation8 Sep 2026
- 2026Entropy-Constrained Adaptive Stochastic Quantization10 Aug 2026
- 2026Block-Sphere Vector Quantization19 May 2026
- 2026Provable Quantization with Randomized Hadamard Transform13 May 2026
- 2026Quantizing With Randomized Hadamard Transforms: Efficient Heuristic Now Proven7 May 2026
Similar, not cited
Close in wording, no citation either way
- 2026Revisiting RaBitQ and TurboQuant: A Symmetric Comparison of Methods, Theory, and Experiments
- 2026Rounding in Preconditioner Space: Redesigning 4-bit AdamW Optimizer-State Quantization
- 2026LittleBit-2: Maximizing the Spectral Energy Gain in Sub-1-Bit LLMs via Latent Geometry Alignment
- 2026BCJR-QAT: A Differentiable Relaxation of Trellis-Coded Weight Quantization
- 2022On One-Bit Quantization
- 2025PacQ: A SIMT Microarchitecture for Efficient Dataflow in Hyper-asymmetric GEMMs
- 2025Pushing the Limits of Low-Bit Optimizers: A Focus on EMA Dynamics
- 2026Fast-TurboQuant: A Multiplier-Free Online Vector Quantization Approach