2023/06/22 by Berivan Isik, Isik, Berivan, Francesco Pase +9 · 1 citation
Computer Science · #Distributed #FOS: Computer and information sciences #Internet Traffic Analysis and Secure E-voting #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Parallel #Privacy-Preserving Technologies in Data #Stochastic Gradient Optimization Techniques #and Cluster Computing (cs.DC)
paper · pdf · doi:10.48550/arxiv.2306.12625
openalex publication_date 2023/06/22 · openalex created_date 2023/06/24 · openalex updated_date 2026/07/28
The high communication cost of sending model updates from the clients to the server is a significant bottleneck for scalable federated learning (FL). Among existing approaches, state-of-the-art bitrate-accuracy tradeoffs have been achieved using stochastic compression methods -- in which the client n sends a sample from a client-only probability distribution qϕ(n), and the server estimates the mean of the clients' distributions using these samples. However, such methods do not take full advantage of the FL setup where the server, throughout the training process, has side information in the form of a global distribution pθ that is close to the clients' distribution qϕ(n) in Kullback-Leibler (KL) divergence. In this work, we exploit this closeness between the clients' distributions qϕ(n)'s and the side information pθ at the server, and propose a framework that requires approximately DKL(qϕ(n)|| pθ) bits of communication. We show that our method can be integrated into many existing stochastic compression frameworks to attain the same (and often higher) test accuracy with up to 82 times smaller bitrate than the prior work -- corresponding to 2,650 times overall compression.