通过初始化剪枝实现98%极稀疏联邦学习,显著提升效率与精度。
FedPaI: Achieving Extreme Sparsity in Federated Learning via Pruning at Initialization
- 在训练开始时固定稀疏结构,避免迭代剪枝的低效问题。
- 在非独立同分布数据下仍保持98%稀疏度且不损失精度。
- 支持个性化剪枝和稀疏感知聚合,适合资源受限设备部署。
联邦学习(FL)使边缘设备上的分布式训练成为可能,但受限于边缘环境的资源约束,通信和计算效率面临挑战。现有迭代剪枝方法虽提升通信效率,却因集中式设计难以适应联邦学习的去中心化与数据异构特性,导致稀疏度不足。为此,我们提出FedPaI,一种基于初始化剪枝(PaI)的新颖高效联邦学习框架,可在训练初期识别最优稀疏连接,通过固定稀疏模式大幅提升模型容量,并显著降低通信与计算开销。为适配多样软硬件环境,FedPaI支持结构化与非结构化剪枝。同时引入个性化客户端剪枝机制与稀疏感知的服务器端聚合策略,进一步提升学习能力与效率。实验表明,FedPaI持续优于采用传统迭代剪枝的现有高效联邦学习方法,在效率与模型精度上均有显著领先。首次实现高达98%的极端稀疏度,且在非独立同分布(non-IID)设置下仍保持与未剪枝基线相当的精度。联合优化模型学习能力与稀疏性后,训练速度最快提升7.9倍。
原文摘要 · Abstract (English)
Federated Learning (FL) enables distributed training on edge devices but faces significant challenges due to resource constraints in edge environments, impacting both communication and computational efficiency. Existing iterative pruning techniques improve communication efficiency but are limited by their centralized design, which struggles with FL's decentralized and data-imbalanced nature, resulting in suboptimal sparsity levels. To address these issues, we propose FedPaI, a novel efficient FL framework that leverages Pruning at Initialization (PaI) to achieve extreme sparsity. FedPaI identifies optimal sparse connections at an early stage, maximizing model capacity and significantly reducing communication and computation overhead by fixing sparsity patterns at the start of training. To adapt to diverse hardware and software environments, FedPaI supports both structured and unstructured pruning. Additionally, we introduce personalized client-side pruning mechanisms for improved learning capacity and sparsity-aware server-side aggregation for enhanced efficiency. Experimental results demonstrate that FedPaI consistently outperforms existing efficient FL that applies conventional iterative pruning with significant leading in efficiency and model accuracy. For the first time, our proposed FedPaI achieves an extreme sparsity level of up to 98% without compromising the model accuracy compared to unpruned baselines, even under challenging non-IID settings. By employing our FedPaI with joint optimization of model learning capacity and sparsity, FL applications can benefit from faster convergence and accelerate the training by 6.4 to 7.9 times.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。