FedMPQ: Secure and Communication-Efficient Federated Learning with Multi-codebook Product Quantization
Not on the map. Why?
Abstract (arXiv)
In federated learning, particularly in cross-device scenarios, secure aggregation has recently gained popularity as it effectively defends against inference attacks by malicious aggregators. However, secure aggregation often requires additional communication overhead and can impede the convergence rate of the global model, which is particularly challenging in wireless network environments with extremely limited bandwidth. Therefore, achieving efficient communication compression under the premise of secure aggregation presents a highly challenging and valuable problem. In this work, we propose a novel uplink communication compression method for federated learning, named FedMPQ, which is based on multi shared codebook product quantization.Specifically, we utilize updates from the previous round to generate sufficiently robust codebooks. Secure aggregation is then achieved through trusted execution environments (TEE) or a trusted third party (TTP).In contrast to previous works, our approach exhibits greater robustness in scenarios where data is not independently and identically distributed (non-IID) and there is a lack of sufficient public data. The experiments conducted on the LEAF dataset demonstrate that our proposed method achieves 99% of the baseline's final accuracy, while reducing uplink communications by 90-95%
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 14 of its 23 references that are in the map. First posted on arXiv 21 Apr 2024.
Builds on
14 of 23 references.
References · 14
- 2014Deep Learning Face Attributes in the Wildcited by 3,679
- 2019Advances and Open Problems in Federated Learningcited by 3,021
- 2021Membership Inference Attacks From First Principlescited by 839
- 2018LEAF: A Benchmark for Federated Settingscited by 780
- 2020Inverting Gradients -- How easy is it to break privacy in federated learning?cited by 707
- 2021Federated Learning with Buffered Asynchronous Aggregationcited by 188
- 2020FetchSGD: Communication-Efficient Federated Learning with Sketchingcited by 178
- 2021Rethinking gradient sparsification as total error minimizationcited by 41
- 2022FedDUAP: Federated Learning with Dynamic Update and Adaptive Pruning Using Shared Data on the Servercited by 29
- 2019Hyper-Sphere Quantization: Communication-Efficient SGD for Federated Learningcited by 18
- 2021Communication-Efficient Federated Learning via Quantized Compressed Sensingcited by 17
- 2022FedVQCS: Federated Learning via Vector Quantized Compressed Sensingcited by 9
Built on by
Citing papers per year: 2026: 1.
1 paper.