Simplicity and Typical Rank Results for Three-Way Arrays
- 447 Downloads
Matrices can be diagonalized by singular vectors or, when they are symmetric, by eigenvectors. Pairs of square matrices often admit simultaneous diagonalization, and always admit block wise simultaneous diagonalization. Generalizing these possibilities to more than two (non-square) matrices leads to methods of simplifying three-way arrays by nonsingular transformations. Such transformations have direct applications in Tucker PCA for three-way arrays, where transforming the core array to simplicity is allowed without loss of fit. Simplifying arrays also facilitates the study of array rank. The typical rank of a three-way array is the smallest number of rank-one arrays that have the array as their sum, when the array is generated by random sampling from a continuous distribution. In some applications, the core array of Tucker PCA is constrained to have a vast majority of zero elements. Both simplicity and typical rank results can be applied to distinguish constrained Tucker PCA models from tautologies. An update of typical rank results over the real number field is given in the form of two tables.
Keywordstensor decomposition tensor rank typical rank sparse arrays Candecomp Parafac Tucker component analysis
- Friedland, S. (2010). On the generic and typical rank of 3-tensors. arXiv:0805.3777v4.
- Harshman, R.A. (1970). Foundations of the PARAFAC procedure: Models and conditions for an “explanatory” multi-mode factor analysis. UCLA Working Papers in Phonetics, 16, 1–84. Google Scholar
- Harshman, R.A. (1972). Determination and proof of minimum uniqueness conditions for PARAFAC1. UCLA Working Papers in Phonetics, 16, 1–84. Google Scholar
- Hitchcock, F.L. (1927a). The expression of a tensor or a polyadic as a sum of products. Journal of Mathematical Physics, 6, 164–189. Google Scholar
- Hitchcock, F.L. (1927b). Multiple invariants and generalized rank of a p-way matrix or tensor. Journal of Mathematical Physics, 7, 39–79. Google Scholar
- Kruskal, J.B. (1983, unpublished). Statement of some current results about three-way arrays. Google Scholar
- Kruskal, J.B. (1989). Rank, decomposition, and uniqueness for 3-way and N-way arrays. In Coppi, R., & Bolasco, S. (Eds.) Multiway data analysis (pp. 7–18). Amsterdam: North-Holland. Google Scholar
- Sumi, T., Sakata, T., & Miyazaki, M. (2010). Typical ranks for m×n×(m−1)n tensors with m≤n. Preprint, retrieved from http://polygon.aid.design.kyushu-u.ac.jp/~sumi/myarticles.html, October 14, 2010.
- Thijsse, G.P.A. (1994). Simultaneous diagonal forms for pairs of matrices (Report 9450/B). Econometric Institute. Erasmus University, Rotterdam. Google Scholar