Journal
IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS
Volume 24, Issue 12, Pages 2051-2062Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TNNLS.2013.2271507
Keywords
Alternating least squares (ALS); CP (PARAFAC) decompositions; Khatri-Rao product; mode reduction; tensor decompositions
Categories
Funding
- National Natural Science Foundation of China [61103122, 61273192, U1201253, 61202155]
- Guangdong Natural Science Foundation [S2011040005724]
Ask authors/readers for more resources
CANonical polyadic DECOMPosition (CANDE-COMP, CPD), also known as PARAllel FACtor analysis (PARAFAC) is widely applied to Nth-order (N >= 3) tensor analysis. Existing CPD methods mainly use alternating least squares iterations and hence need to unfold tensors to each of their N modes frequently, which is one major performance bottleneck for large-scale data, especially when the order N is large. To overcome this problem, in this paper, we propose a new CPD method in which the CPD of a high-order tensor (i.e., N > 3) is realized by applying CPD to a mode reduced one (typically, third-order tensor) followed by a Khatri-Rao product projection procedure. This way is not only quite efficient as frequently unfolding to N modes is avoided, but also promising to conquer the bottleneck problem caused by high collinearity of components. We show that, under mild conditions, any Nth-order CPD can be converted to an equivalent third-order one but without destroying essential uniqueness, and theoretically they simply give consistent results. Besides, once the CPD of any unfolded lower order tensor is essentially unique, it is also true for the CPD of the original higher order tensor. Error bounds of truncated CPD are also analyzed in the presence of noise. Simulations show that, compared with state-of-the-art CPD methods, the proposed method is more efficient and is able to escape from local solutions more easily.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available