FedFQ: Federated Learning with Fine-Grained Quantization
Haowei Li, Weiying Xie, Hangyu Ye, Jitao Ma, Shuran Ma, Yunsong Li

TL;DR
FedFQ introduces a fine-grained adaptive quantization method for federated learning, significantly reducing communication costs while maintaining high convergence performance, especially in non-IID data scenarios.
Contribution
The paper proposes FedFQ, a novel federated learning algorithm with parameter-level quantization and a constraint-guided annealing scheme, improving compression and convergence.
Findings
Achieves 27 to 63 times compression ratio.
Maintains lossless performance compared to baseline.
Demonstrates superior convergence in experiments.
Abstract
Federated learning (FL) is a decentralized approach, enabling multiple participants to collaboratively train a model while ensuring the protection of data privacy. The transmission of updates from numerous edge clusters to the server creates a significant communication bottleneck in FL. Quantization is an effective compression technology, showcasing immense potential in addressing this bottleneck problem. The Non-IID nature of FL renders it sensitive to quantization. Existing quantized FL frameworks inadequately balance high compression ratios and superior convergence performance by roughly employing a uniform quantization bit-width on the client-side. In this work, we propose a communication-efficient FL algorithm with a fine-grained adaptive quantization strategy (FedFQ). FedFQ addresses the trade-off between achieving high communication compression ratios and maintaining superior…
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.
Taxonomy
TopicsPrivacy-Preserving Technologies in Data · Stochastic Gradient Optimization Techniques · Cryptography and Data Security
