Model Compression via Pattern Shared Sparsification in Analog Federated Learning Under Communication Constraints

Recently, it has been shown that analog transmission based federated learning enables more efficient usage of communication resources compared to the conventional digital transmission. In this paper, we propose an effective model compression strategy enabling analog FL under constrained communication bandwidth. To this end, the proposed approach is based on pattern shared sparsification by setting the same sparsification pattern of parameter vectors uploaded by edge devices, as opposed to each edge device independently applying sparsification. In particular, we propose specific schemes for determining the sparsification pattern and characterize the convergence of analog FL leveraging these proposed sparsification strategies, by deriving a closed-form upper boun d of convergence rate and residual error. The closed-form expression allows to capture the effect of communication bandwidth and power budget to the performance of analog FL. In terms of convergence analysis, the model parameter obtained with the proposed schemes is proven to converge to the optimum of model parameter. Numerical results show that leveraging the proposed pattern shared sparsification consistently improves the performance of analog FL in various settings of system parameters. The improvement in performance is more significant under scarce communication bandwidth and limited transmit power budget.

Automated summary

Recently, it has been shown that analog transmission based federated learning is more efficient in using communication resources compared to digital transmission. This paper proposes an effective model compression strategy for analog federated learning under constrained communication bandwidth. The strategy is based on pattern shared sparsification, where the same sparsification pattern is applied to parameter vectors uploaded by edge devices. Specific schemes for determining the sparsification pattern are proposed and the convergence of analog federated learning leveraging these schemes is characterized by deriving a closed-form upper bound of convergence rate and residual error. The numerical results demonstrate consistent performance improvement of analog federated learning with pattern shared sparsification, especially under scarce communication bandwidth and limited transmit power budget.