arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2009.02845cs.LGcs.CRcs.DCstat.ML
收藏

快速安全的分布式非负矩阵分解

Fast and Secure Distributed Nonnegative Matrix Factorization

Tencent(腾讯);WeBank(微众银行);University of Hong Kong(香港大学);Xiamen University(厦门大学);University of Ioannina(约阿尼纳大学)

Yuqiu Qian, Conghui Tan, Danhao Ding, Hui Li, Nikos Mamoulis

摘要:

非负矩阵分解(NMF)已成功地应用于多个数据采掘任务。近年来,由于NMF在大矩阵上的高成本,对NMF的加速越来越感兴趣。另一方面,NMF在联邦数据上的隐私问题值得关注,因为NMF通常应用于图像和文本分析中,这可能涉及跨若干方(例如,医院)。本文研究了分布式NMF的加速和安全问题。首先,我们提出了一个分布式的草图交替非负最小二乘(DSANLS)框架的NMF,它利用矩阵草图技术,以减少非负最小二乘法子问题的收敛保证的大小。对于第二个问题,我们表明,DSANLS修改可以适应的安全设置,但只有一个或有限的迭代。因此,我们提出了四个有效的分布式NMF方法在同步和异步设置的安全保证。我们在几个真实数据集上进行了广泛的实验,以显示我们提出的方法的优越性。我们的方法的实现可以在https://github.com/qianyuqiu79/DSANLS上获得。

英文摘要:

Nonnegative matrix factorization (NMF) has been successfully applied in several data mining tasks. Recently, there is an increasing interest in the acceleration of NMF, due to its high cost on large matrices. On the other hand, the privacy issue of NMF over federated data is worthy of attention, since NMF is prevalently applied in image and text analysis which may involve leveraging privacy data (e.g, medical image and record) across several parties (e.g., hospitals). In this paper, we study the acceleration and security problems of distributed NMF. Firstly, we propose a distributed sketched alternating nonnegative least squares (DSANLS) framework for NMF, which utilizes a matrix sketching technique to reduce the size of nonnegative least squares subproblems with a convergence guarantee. For the second problem, we show that DSANLS with modification can be adapted to the security setting, but only for one or limited iterations. Consequently, we propose four efficient distributed NMF methods in both synchronous and asynchronous settings with a security guarantee. We conduct extensive experiments on several real datasets to show the superiority of our proposed methods. The implementation of our methods is available at https://github.com/qianyuqiu79/DSANLS.

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

↑