mlsanityData to 14 Oct 2026

RATQ: A Universal Fixed-Length Quantizer for Stochastic Optimization

arXiv 1908.08200 ↗First posted 22 Aug 2019cs.LG cs.IT math.ITcited by 23

Not on the map. Why?

Abstract (arXiv)

We present Rotated Adaptive Tetra-iterated Quantizer (RATQ), a fixed-length quantizer for gradients in first order stochastic optimization. RATQ is easy to implement and involves only a Hadamard transform computation and adaptive uniform quantization with appropriately chosen dynamic ranges. For noisy gradients with almost surely bounded Euclidean norms, we establish an information theoretic lower bound for optimization accuracy using finite precision gradients and show that RATQ almost attains this lower bound. For mean square bounded noisy gradients, we use a gain-shape quantizer which separately quantizes the Euclidean norm and uses RATQ to quantize the normalized unit norm vector. We establish lower bounds for performance of any optimization procedure and shape quantizer, when used with a uniform gain quantizer. Finally, we propose an adaptive quantizer for gain which when used with RATQ for shape quantizer outperforms uniform gain quantization and is, in fact, close to optimal. As a by-product, we show that our fixed-length quantizer RATQ has almost the same performance as the optimal variable-length quantizers for distributed mean estimation. Also, we obtain an efficient quantizer for Gaussian vectors which attains a rate very close to the Gaussian rate-distortion function and is, in fact, universal for subgaussian input vectors.

Key facts. Cited by 23 papers in the map (data through 14 Oct 2026). First posted on arXiv 22 Aug 2019.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 8; 2022: 4; 2023: 5; 2024: 3; 2025: 1; 2026: 2.

23 papers.

Sort:

By area:

  1. 2023Matrix Compression via Randomized Low Rank and Low Precision Factorizationcited by 25
  2. 2021Preserved central model for faster bidirectional compression in distributed settingscited by 21
  3. 2022EF-BV: A Unified Theory of Error Feedback and Variance Reduction Mechanisms for Biased and Unbiased Compression in Distributed Optimizationcited by 17
  4. 2021Solving Multi-Arm Bandit Using a Few Bits of Communicationcited by 16
  5. 2022Correlated quantization for distributed mean estimation and optimizationcited by 14
  6. 2023Unbiased Compression Saves Communication in Distributed Optimization: When and How Much?cited by 14
  7. 2023Temporal Difference Learning with Compressed Updates: Error-Feedback meets Reinforcement Learningcited by 12
  8. 2022Linear Stochastic Bandits over a Bit-Constrained Channelcited by 9
  9. 2021Leveraging Spatial and Temporal Correlations in Sparsified Mean Estimationcited by 7
  10. 2024Compressed Federated Reinforcement Learning with a Generative Modelcited by 6
  11. 2021Distributed Online Learning for Joint Regret with Communication Constraintscited by 5
  12. 2021Efficient Randomized Subspace Embeddings for Distributed Optimization under a Communication Budgetcited by 5
11 more
  1. 2023Communication-Constrained Bandits under Additive Gaussian Noisecited by 4
  2. 2021Fundamental limits of over-the-air optimization: Are analog schemes optimal?cited by 3
  3. 2021Wyner-Ziv Gradient Compression for Federated Learningcited by 3
  4. 2024Correlated Quantization for Faster Nonconvex Distributed Optimizationcited by 3
  5. 2024Model-Free Learning for the Linear Quadratic Regulator over Rate-Limited Channelscited by 2
  6. 2025On the Gradient Complexity of Private Optimization with Private Oraclescited by 2
  7. 2023Optimal Compression of Unit Norm Vectors in the High Distortion Regimecited by 1
  8. 2026Information-Theoretic Lower Bounds for Bit-Constrained Stochastic Optimization via a Reduction to Compressed Gaussian Mean Estimationcited by 1
  9. 2021Unbiased Single-scale and Multi-scale Quantizers for Distributed Optimizationcited by 0
  10. 2022Learning in Distributed Contextual Linear Bandits Without Sharing the Contextcited by 0
  11. 2026Exact Minimax One-Bit Unbiased Compression: Heavy-Tail Necessity and Finite-Randomness Approximationcited by 0