English

SSFL: Discovering Sparse Unified Subnetworks at Initialization for Efficient Federated Learning

Machine Learning 2026-01-16 v2 Artificial Intelligence Distributed, Parallel, and Cluster Computing

Abstract

In this work, we propose Salient Sparse Federated Learning (SSFL), a streamlined approach for sparse federated learning with efficient communication. SSFL identifies a sparse subnetwork prior to training, leveraging parameter saliency scores computed separately on local client data in non-IID scenarios, and then aggregated, to determine a global mask. Only the sparse model weights are trained and communicated each round between the clients and the server. On standard benchmarks including CIFAR-10, CIFAR-100, and Tiny-ImageNet, SSFL consistently improves the accuracy sparsity trade off, achieving more than 20\% relative error reduction on CIFAR-10 compared to the strongest sparse baseline, while reducing communication costs by 2×2 \times relative to dense FL. Finally, in a real-world federated learning deployment, SSFL delivers over 2.3×2.3 \times faster communication time, underscoring its practical efficiency.

Keywords

Cite

@article{arxiv.2405.09037,
  title  = {SSFL: Discovering Sparse Unified Subnetworks at Initialization for Efficient Federated Learning},
  author = {Riyasat Ohib and Bishal Thapaliya and Gintare Karolina Dziugaite and Jingyu Liu and Vince Calhoun and Sergey Plis},
  journal= {arXiv preprint arXiv:2405.09037},
  year   = {2026}
}

Comments

Published in Transactions on Machine Learning Research (TMLR), 2026

R2 v1 2026-06-28T16:27:41.550Z