Exploiting Correlations in Federated Learning: Opportunities and Practical Limitations
Adrian Edin, Michel Kieffer, Mikael Johansson, Zheng Chen

TL;DR
This paper classifies and analyzes correlation-based compression techniques in federated learning, proposing adaptive methods that improve data efficiency based on correlation measurements.
Contribution
It introduces a unified correlation-based framework for gradient and model compression in federated learning and proposes adaptive compression schemes.
Findings
Correlation degrees vary with task complexity and model architecture.
Adaptive compression methods outperform non-adaptive approaches.
Correlation metrics guide effective compression mode selection.
Abstract
The communication bottleneck in federated learning (FL) has spurred extensive research into techniques to reduce the volume of data exchanged between client devices and the central parameter server. In this paper, we systematically classify gradient and model compression schemes into three categories based on the type of correlations they exploit: structural, temporal, and spatial. We examine the sources of such correlations, propose quantitative metrics for measuring their magnitude, and reinterpret existing compression methods through this unified correlation-based framework. Our experimental studies demonstrate that the degrees of structural, temporal, and spatial correlations vary significantly depending on task complexity, model architecture, and algorithmic configurations. These findings suggest that algorithm designers should carefully evaluate correlation assumptions under…
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.
