QUIC-FL: Quick Unbiased Compression for Federated Learning
This work addresses communication efficiency in federated learning, which is incremental as it builds on existing DME methods.
The paper tackles the problem of Distributed Mean Estimation (DME) in federated learning by improving on previous techniques that achieve optimal error guarantees, focusing on reducing encoding or decoding complexity.
Distributed Mean Estimation (DME), in which $n$ clients communicate vectors to a parameter server that estimates their average, is a fundamental building block in communication-efficient federated learning. In this paper, we improve on previous DME techniques that achieve the optimal $O(1/n)$ Normalized Mean Squared Error (NMSE) guarantee by asymptotically improving the complexity for either encoding or decoding (or both). To achieve this, we formalize the problem in a novel way that allows us to use off-the-shelf mathematical solvers to design the quantization.