arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2006.12583cs.LGstat.ML
收藏

一次通信联邦回归的精确支持度恢复

Exact Support Recovery in Federated Regression with One-shot Communication

Purdue University(普渡大学)

Adarsh Barik, Jean Honorio

摘要:

联邦学习提供了一个框架,以解决分布式计算的挑战,数据所有权和隐私的大量分布式客户端与低计算和通信能力。在本文中,我们研究了在联邦学习设置中学习稀疏线性回归的精确支持度的问题。我们提供了一个简单的通信有效的算法,它只需要一次与集中式服务器的通信来计算精确的支持。我们的方法不需要客户端解决任何优化问题,因此可以在计算能力较低的设备上运行。我们的方法对于客户端失败,模型中毒和离散客户端的问题自然是鲁棒的。我们正式证明,我们的方法需要每个客户端的样本数量是多项式的支持大小,但独立的问题的维度。我们要求分布式客户端的数量在问题的维度上是对数的。如果预测变量是相互独立的,则总体样本复杂度与非联邦集中式设置的最佳样本复杂度相匹配。此外,我们的方法很容易实现,并具有整体多项式时间的复杂度。

英文摘要:

Federated learning provides a framework to address the challenges of distributed computing, data ownership and privacy over a large number of distributed clients with low computational and communication capabilities. In this paper, we study the problem of learning the exact support of sparse linear regression in the federated learning setup. We provide a simple communication efficient algorithm which only needs one-shot communication with the centralized server to compute the exact support. Our method does not require the clients to solve any optimization problem and thus, can be run on devices with low computational capabilities. Our method is naturally robust to the problems of client failure, model poisoning and straggling clients. We formally prove that our method requires a number of samples per client that is polynomial with respect to the support size, but independent of the dimension of the problem. We require the number of distributed clients to be logarithmic in the dimension of the problem. If the predictor variables are mutually independent then the overall sample complexity matches the optimal sample complexity of the non-federated centralized setting. Furthermore, our method is easy to implement and has an overall polynomial time complexity.

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

↑