.png){kind=icon}
返回
Large Scale Tensor Factorization via Parallel Sketches
.png){kind=icon}
OA
AI
DOI：10.1109/TKDE.2020.2982144.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Tensor factorization methods have recently gained increased popularity. A key feature that renders tensors attractive is the ability to directly model multi-relational data. In this work, we propose ParaSketch, a parallel tensor factorization algorithm that enables massive parallelism, to deal with large tensors. The idea is to compress the large tensor into multiple small tensors, decompose each small tensor in parallel, and combine the results to reconstruct the desired latent factors. Prior art in this direction entails potentially very high complexity in the (Gaussian) compression and final combining stages. Adopting sketching matrices for compression, the proposed method enjoys a dramatic reduction in compression complexity, and features a much lighter combining step. Moreover, theoretical analysis shows that the compressed tensors inherit latent identifiability under mild conditions, hence establishing correctness of the overall approach. Numerical experiments corroborate the theory and demonstrate the effectiveness of the proposed algorithm.
Keyword:
Tensor factorization
PARAFAC
sketching
block term decomposition
identifiability
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.4
论文数:
6.9K
被引数:
3.2W
机构
引用论文
Prevalent and persistent viral infection in cultures of the coral algal endosymbiont Symbiodinium.png)
Coral Reefs
Coral ReefsIF0
PREAI
分享收藏Contributions of Valine-292 in the Nicotinamide Binding Site of Liver Alcohol Dehydrogenase and Dynamics to Catalysis,Biochemistry
BiochemistryIF0
PREAI
分享收藏Structural, optical and magnetic properties of Co-doped ZnO nanorods with hidden secondary phases
PREAI
分享收藏
分享收藏
查看更多内容