pith. sign in

arxiv: 1911.04655 · v2 · pith:KKWDGAQJnew · submitted 2019-11-12 · 💻 cs.LG · cs.IR· stat.ML

Hyper-Sphere Quantization: Communication-Efficient SGD for Federated Learning

classification 💻 cs.LG cs.IRstat.ML
keywords communicationcostfederatedlearningaccuracyachievecompressionconvergence
0
0 comments X
read the original abstract

The high cost of communicating gradients is a major bottleneck for federated learning, as the bandwidth of the participating user devices is limited. Existing gradient compression algorithms are mainly designed for data centers with high-speed network and achieve $O(\sqrt{d} \log d)$ per-iteration communication cost at best, where $d$ is the size of the model. We propose hyper-sphere quantization (HSQ), a general framework that can be configured to achieve a continuum of trade-offs between communication efficiency and gradient accuracy. In particular, at the high compression ratio end, HSQ provides a low per-iteration communication cost of $O(\log d)$, which is favorable for federated learning. We prove the convergence of HSQ theoretically and show by experiments that HSQ significantly reduces the communication cost of model training without hurting convergence accuracy.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Quantization in Federated Learning: Methods, Challenges and Future Directions

    cs.LG 2026-06 unverdicted novelty 5.0

    This survey introduces a taxonomy for quantization in federated learning organized around client heterogeneity, aggregation consistency, non-IID robustness, privacy integration, and hardware co-optimization, while ana...