arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1703.09074math.NAcs.NAstat.CO
收藏

随机CP张量分解

Randomized CP Tensor Decomposition

University of California, Berkeley(加州大学伯克利分校);California Institute of Technology(加州理工学院);University of Washington(华盛顿大学)

N. Benjamin Erichson, Krithika Manohar, Steven L. Brunton, J. Nathan Kutz

AI总结:

本文提出了一种基于随机算法的CP张量分解方法,通过高效处理大规模张量数据,实现低秩近似并控制误差。

摘要:

CANDECOMP/PARAFAC(CP)张量分解是一种用于多维数据的流行降维方法。降维通常受到重视,因为许多高维张量的内在秩相对于环境测量空间的维度较低。然而,大数据的出现对计算这种基本张量分解带来了显著的计算挑战。通过利用现代随机算法,我们证明了可以从张量的较小表示中学习到相干结构,这在时间上是微不足道的。因此,这种简单但强大的算法使计算近似CP分解成为可能,即使对于大规模张量。近似误差可通过 oversampling 和幂迭代的计算来控制。除了理论结果外,几个经验结果还展示了所提出算法的性能。

英文摘要:

The CANDECOMP/PARAFAC (CP) tensor decomposition is a popular dimensionality-reduction method for multiway data. Dimensionality reduction is often sought after since many high-dimensional tensors have low intrinsic rank relative to the dimension of the ambient measurement space. However, the emergence of `big data' poses significant computational challenges for computing this fundamental tensor decomposition. By leveraging modern randomized algorithms, we demonstrate that coherent structures can be learned from a smaller representation of the tensor in a fraction of the time. Thus, this simple but powerful algorithm enables one to compute the approximate CP decomposition even for massive tensors. The approximation error can thereby be controlled via oversampling and the computation of power iterations. In addition to theoretical results, several empirical results demonstrate the performance of the proposed algorithm.

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

↑