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

完全分布数据下基于线性模型的流言学习

Gossip Learning with Linear Models on Fully Distributed Data

University of Szeged(塞格德大学);Hungarian Academy of Sciences(匈牙利科学院)

Róbert Ormándi, István Hegedüs, Márk Jelasity

摘要:

完全分布式数据上的机器学习是对等网络(P2P)应用中的一个重要问题。在这个模型中,我们在每个网络节点上都有一个数据记录,但由于隐私考虑,不可能移动原始数据。例如,用户简档、评级、历史或传感器读数可以表示这种情况。这个问题是困难的,因为不可能学习本地模型,系统模型几乎不能保证可靠性,但通信成本需要保持较低。在这里,我们提出了gossip学习,一种通用的方法,它基于多个模型在网络上并行随机游走,同时应用在线学习算法来改进自己,并通过集成学习方法进行组合。我们提出了一个实例,这种方法的情况下,分类与线性模型。我们的主要贡献是集成学习方法-通过网络中的模型的连续组合-实现了一个虚拟的加权投票机制在指数数量的模型,几乎没有额外的成本相比,独立的随机游走。我们从理论上证明了该方法的收敛性,并在基准数据集上进行了大量的实验。我们的实验分析表明,所提出的方法的性能和鲁棒性。

英文摘要:

Machine learning over fully distributed data poses an important problem in peer-to-peer (P2P) applications. In this model we have one data record at each network node, but without the possibility to move raw data due to privacy considerations. For example, user profiles, ratings, history, or sensor readings can represent this case. This problem is difficult, because there is no possibility to learn local models, the system model offers almost no guarantees for reliability, yet the communication cost needs to be kept low. Here we propose gossip learning, a generic approach that is based on multiple models taking random walks over the network in parallel, while applying an online learning algorithm to improve themselves, and getting combined via ensemble learning methods. We present an instantiation of this approach for the case of classification with linear models. Our main contribution is an ensemble learning method which---through the continuous combination of the models in the network---implements a virtual weighted voting mechanism over an exponential number of models at practically no extra cost as compared to independent random walks. We prove the convergence of the method theoretically, and perform extensive experiments on benchmark datasets. Our experimental analysis demonstrates the performance and robustness of the proposed approach.

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

↑