Decentralized Personalized Federated Learning based on a Conditional Sparse-to-Sparser Scheme
<|reference_start|>Decentralized Personalized Federated Learning based on a Conditional Sparse-to-Sparser Scheme: Decentralized Federated Learning (DFL) has become popular due to its robustness and avoidance of centralized coordination. In this paradigm, clients actively engage in training by exchanging models with their networked neighbors. However, DFL introduces increased costs in terms of training and communication. Existing methods focus on minimizing communication often overlooking training efficiency and data heterogeneity. To address this gap, we propose a novel \textit{sparse-to-sparser} training scheme: DA-DPFL. DA-DPFL initializes with a subset of model parameters, which progressively reduces during training via \textit{dynamic aggregation} and leads to substantial energy savings while retaining adequate information during critical learning periods.   Our experiments showcase that DA-DPFL substantially outperforms DFL baselines in test accuracy, while achieving up to $5$ times reduction in energy costs. We provide a theoretical analysis of DA-DPFL's convergence by solidifying its applicability in decentralized and personalized learning. The code is available at:https://github.com/EricLoong/da-dpfl<|reference_end|>
@article{long2024decentralized,
    title={Decentralized Personalized Federated Learning based on a Conditional
  Sparse-to-Sparser Scheme},
    author={Qianyu Long, Qiyuan Wang, Christos Anagnostopoulos and Daning Bi},
    journal={arXiv preprint arXiv:2404.15943},
    year={2024},
    archivePrefix={arXiv},
    eprint={2404.15943},
    primaryClass={cs.LG cs.AI}
}