基于方差缩减的快速分布主成分分析

Shi-Mai Shang-Guan, Jianping Yin
{"title":"基于方差缩减的快速分布主成分分析","authors":"Shi-Mai Shang-Guan, Jianping Yin","doi":"10.1109/DCABES.2017.10","DOIUrl":null,"url":null,"abstract":"Principal Component Analysis (PCA) and Singular Value Decomposition (SVD) are widely used in dimension reduction, feature extraction, low-rank matrix approximation and so on. In large-scale applications, a common alternative is to use cluster which have multiple nodes and multiple cores to accelerate the time of solving problem. Most of the existing distributed PCA algorithm focus on reducing the communication, and there is little attention to the frequent waiting phenomenon caused by the synchronization mechanism. Meanwhile, most of these works are based on either the distributed memory of the processes-level parallelism or the shared memory of threads-level parallelism. In this paper, we propose a fast distributed PCA algorithm with variance reduced, which based on stochastic sampling and Stale Synchronous Parallel. Our algorithm contains the processes-level and threads-level parallelism. Experiments on the \"Tianhe-2\" super computer demonstrate that our algorithm has a good performance, speedup, and scalability.","PeriodicalId":446641,"journal":{"name":"2017 16th International Symposium on Distributed Computing and Applications to Business, Engineering and Science (DCABES)","volume":"209 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Fast Distributed Principal Component Analysis with Variance Reduction\",\"authors\":\"Shi-Mai Shang-Guan, Jianping Yin\",\"doi\":\"10.1109/DCABES.2017.10\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Principal Component Analysis (PCA) and Singular Value Decomposition (SVD) are widely used in dimension reduction, feature extraction, low-rank matrix approximation and so on. In large-scale applications, a common alternative is to use cluster which have multiple nodes and multiple cores to accelerate the time of solving problem. Most of the existing distributed PCA algorithm focus on reducing the communication, and there is little attention to the frequent waiting phenomenon caused by the synchronization mechanism. Meanwhile, most of these works are based on either the distributed memory of the processes-level parallelism or the shared memory of threads-level parallelism. In this paper, we propose a fast distributed PCA algorithm with variance reduced, which based on stochastic sampling and Stale Synchronous Parallel. Our algorithm contains the processes-level and threads-level parallelism. Experiments on the \\\"Tianhe-2\\\" super computer demonstrate that our algorithm has a good performance, speedup, and scalability.\",\"PeriodicalId\":446641,\"journal\":{\"name\":\"2017 16th International Symposium on Distributed Computing and Applications to Business, Engineering and Science (DCABES)\",\"volume\":\"209 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 16th International Symposium on Distributed Computing and Applications to Business, Engineering and Science (DCABES)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DCABES.2017.10\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 16th International Symposium on Distributed Computing and Applications to Business, Engineering and Science (DCABES)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCABES.2017.10","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

主成分分析(PCA)和奇异值分解(SVD)在降维、特征提取、低秩矩阵逼近等方面有着广泛的应用。在大规模应用中,一种常见的替代方案是使用多节点多核集群来加快问题的求解速度。现有的分布式PCA算法大多侧重于减少通信,很少关注同步机制导致的频繁等待现象。同时,这些工作大多是基于进程级并行的分布式内存或线程级并行的共享内存。本文提出了一种基于随机抽样和陈旧同步并行的快速、方差减小的分布式主成分分析算法。我们的算法包含进程级和线程级并行性。在“天河二号”超级计算机上的实验表明,该算法具有良好的性能、加速和可扩展性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Fast Distributed Principal Component Analysis with Variance Reduction
Principal Component Analysis (PCA) and Singular Value Decomposition (SVD) are widely used in dimension reduction, feature extraction, low-rank matrix approximation and so on. In large-scale applications, a common alternative is to use cluster which have multiple nodes and multiple cores to accelerate the time of solving problem. Most of the existing distributed PCA algorithm focus on reducing the communication, and there is little attention to the frequent waiting phenomenon caused by the synchronization mechanism. Meanwhile, most of these works are based on either the distributed memory of the processes-level parallelism or the shared memory of threads-level parallelism. In this paper, we propose a fast distributed PCA algorithm with variance reduced, which based on stochastic sampling and Stale Synchronous Parallel. Our algorithm contains the processes-level and threads-level parallelism. Experiments on the "Tianhe-2" super computer demonstrate that our algorithm has a good performance, speedup, and scalability.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信