arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2501.03477cs.LG

联邦学习中的性能局限性研究

A study on performance limitations in Federated Learning

University of Toronto(多伦多大学)

Karthik Mohan

AI总结:

本文研究联邦学习中的通信瓶颈与Non-IID数据问题,通过基线模型刻画其对性能的影响并评估,进而讨论改进途径。

摘要:

日益增长的隐私担忧以及对数据的不受限制访问,促使一种名为联邦学习(Federated Learning,FL)的新型机器学习范式得到发展。FL借鉴了分布式机器学习的许多思想;然而,由于模型在边缘设备上进行训练,与联邦学习相关的挑战使其成为一个有趣的工程问题。它由Google于2016年提出,自那时起,FL内不同领域一直在开展活跃研究,例如联邦优化算法、模型与更新压缩、差分隐私、鲁棒性与攻击、联邦GAN以及隐私保护个性化。在开发此类联邦机器学习系统时仍存在许多开放挑战,本项目将聚焦通信瓶颈和数据Non-IID性,及其对模型性能的影响。文中在一个基线模型上刻画这些问题,评估模型性能,并讨论克服这些问题的方法。

英文摘要:

Increasing privacy concerns and unrestricted access to data lead to the development of a novel machine learning paradigm called Federated Learning (FL). FL borrows many of the ideas from distributed machine learning, however, the challenges associated with federated learning makes it an interesting engineering problem since the models are trained on edge devices. It was introduced in 2016 by Google, and since then active research is being carried out in different areas within FL such as federated optimization algorithms, model and update compression, differential privacy, robustness, and attacks, federated GANs and privacy preserved personalization. There are many open challenges in the development of such federated machine learning systems and this project will be focusing on the communication bottleneck and data Non IID-ness, and its effect on the performance of the models. These issues are characterized on a baseline model, model performance is evaluated, and discussions are made to overcome these issues.

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

↑