arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2303.06237cs.LGcs.AIcs.DC
收藏

Complement Sparsification:面向联邦学习的低开销模型剪枝

Complement Sparsification: Low-Overhead Model Pruning for Federated Learning

New Jersey Institute of Technology(新泽西理工学院)

Xiaopeng Jiang, Cristian Borcea

摘要:

联邦学习(FL)是一种隐私保护的分布式深度学习范例,涉及大量的通信和计算工作,这对于资源受限的移动和IoT设备是一个问题。模型修剪/稀疏化开发了可以解决这个问题的稀疏模型,但是现有的稀疏化解决方案不能同时满足服务器和客户端之间的低双向通信开销、客户端处的低计算开销以及良好的模型准确性的要求,在FL假设下,服务器不能访问原始数据来微调修剪的模型。我们提出了补充稀疏化(CS),修剪机制,满足所有这些要求,通过在服务器和客户端完成的互补和协作修剪。在每一轮,CS创建一个全局稀疏模型,其中包含捕获所有客户端的一般数据分布的权重,而客户端创建局部稀疏模型,其中权重从全局模型中删除,以捕获局部趋势。为了提高模型性能,这两种类型的互补稀疏模型在每一轮中被聚合为密集模型,然后在迭代过程中对其进行修剪。CS在服务器和客户端的vanilla FL之上只需要很少的计算开销。我们证明,CS是香草FL的近似,因此,其模型表现良好。我们评估CS实验与两个流行的FL基准数据集。CS实现大幅减少双向通信,同时实现性能与香草FL。此外,CS优于基线修剪机制FL。

英文摘要:

Federated Learning (FL) is a privacy-preserving distributed deep learning paradigm that involves substantial communication and computation effort, which is a problem for resource-constrained mobile and IoT devices. Model pruning/sparsification develops sparse models that could solve this problem, but existing sparsification solutions cannot satisfy at the same time the requirements for low bidirectional communication overhead between the server and the clients, low computation overhead at the clients, and good model accuracy, under the FL assumption that the server does not have access to raw data to fine-tune the pruned models. We propose Complement Sparsification (CS), a pruning mechanism that satisfies all these requirements through a complementary and collaborative pruning done at the server and the clients. At each round, CS creates a global sparse model that contains the weights that capture the general data distribution of all clients, while the clients create local sparse models with the weights pruned from the global model to capture the local trends. For improved model performance, these two types of complementary sparse models are aggregated into a dense model in each round, which is subsequently pruned in an iterative process. CS requires little computation overhead on the top of vanilla FL for both the server and the clients. We demonstrate that CS is an approximation of vanilla FL and, thus, its models perform well. We evaluate CS experimentally with two popular FL benchmark datasets. CS achieves substantial reduction in bidirectional communication, while achieving performance comparable with vanilla FL. In addition, CS outperforms baseline pruning mechanisms for FL.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑