Dithered quantization after a single randomized Hadamard transform yields unbiased estimates whose MSE asymptotically equals that of dense random rotations, specifically (π√3/2 + o(1))·4^{-b} for b-bit TurboQuant.
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing , pages=
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
New query-time bound of tilde O(d + epsilon Delta squared + 1/epsilon cubed) for Gaussian kernel mean estimation, improving prior bounds for small epsilon and intermediate diameter via a fast spherical embedding theorem.
citing papers explorer
-
Provable Quantization with Randomized Hadamard Transform
Dithered quantization after a single randomized Hadamard transform yields unbiased estimates whose MSE asymptotically equals that of dense random rotations, specifically (π√3/2 + o(1))·4^{-b} for b-bit TurboQuant.
-
New Bounds for Kernel Sums via Fast Spherical Embeddings
New query-time bound of tilde O(d + epsilon Delta squared + 1/epsilon cubed) for Gaussian kernel mean estimation, improving prior bounds for small epsilon and intermediate diameter via a fast spherical embedding theorem.