arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2011.04050cs.LGcs.DC

Adaptive Federated Dropout: Improving Communication Efficiency and Generalization for Federated Learning

University of California, Davis(加利福尼亚大学戴维斯分校);Google(谷歌公司)

Nader Bouacida, Jiahui Hou, Hui Zang, Xin Liu

英文摘要:

With more regulations tackling users' privacy-sensitive data protection in recent years, access to such data has become increasingly restricted and controversial. To exploit the wealth of data generated and located at distributed entities such as mobile phones, a revolutionary decentralized machine learning setting, known as Federated Learning, enables multiple clients located at different geographical locations to collaboratively learn a machine learning model while keeping all their data on-device. However, the scale and decentralization of federated learning present new challenges. Communication between the clients and the server is considered a main bottleneck in the convergence time of federated learning. In this paper, we propose and study Adaptive Federated Dropout (AFD), a novel technique to reduce the communication costs associated with federated learning. It optimizes both server-client communications and computation costs by allowing clients to train locally on a selected subset of the global model. We empirically show that this strategy, combined with existing compression methods, collectively provides up to 57x reduction in convergence time. It also outperforms the state-of-the-art solutions for communication efficiency. Furthermore, it improves model generalization by up to 1.7%.

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

↑