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

一次性通信的联邦近视社区发现

Federated Myopic Community Detection with One-shot Communication

Purdue University(普渡大学)

Chuyang Ke, Jean Honorio

摘要:

在本文中,我们研究了联邦近视学习下的网络社区结构恢复问题。在这种模式下,我们有几个客户,他们每个人都有一个短视的观点,即,观察网络的一个小的子图。每个客户端向中央服务器发送经审查的证据图。我们提供了一个有效的算法,它计算一个共识签署的加权图从客户端的证据,并恢复底层的网络结构在中央服务器。我们分析了网络的拓扑结构条件,以及允许恢复网络结构的客户端的信号和噪声水平。我们的分析表明,准确的恢复是可能的,可以在多项式时间内实现。我们还为中央服务器从任何单个客户端证据恢复网络结构提供了信息理论限制。最后,作为我们分析的副产品,我们提供了一个新的Cheeger型不等式一般符号加权图。

英文摘要:

In this paper, we study the problem of recovering the community structure of a network under federated myopic learning. Under this paradigm, we have several clients, each of them having a myopic view, i.e., observing a small subgraph of the network. Each client sends a censored evidence graph to a central server. We provide an efficient algorithm, which computes a consensus signed weighted graph from clients evidence, and recovers the underlying network structure in the central server. We analyze the topological structure conditions of the network, as well as the signal and noise levels of the clients that allow for recovery of the network structure. Our analysis shows that exact recovery is possible and can be achieved in polynomial time. We also provide information-theoretic limits for the central server to recover the network structure from any single client evidence. Finally, as a byproduct of our analysis, we provide a novel Cheeger-type inequality for general signed weighted graphs.

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

↑