.png){kind=icon}
.png){kind=icon}
Return
Randomized CP tensor decomposition
.png){kind=icon}
OA
AI
DOI：10.1088/2632-2153/ab8240.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
randomized algorithms
randomized least squares
dimension reduction
multilinear algebra
CP decomposition
canonical polyadic tensor decomposition
Journal
M
IF:
4.6
Papers:
1.1K
Citations:
3.4K
View more organizations