A concise proof of Kruskal's theorem on tensor decomposition
From MaRDI portal
Publication:2267410
DOI10.1016/j.laa.2009.11.033zbMath1187.15028arXiv0901.1796OpenAlexW1992223193MaRDI QIDQ2267410
Publication date: 1 March 2010
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0901.1796
Vector and tensor algebra, theory of invariants (15A72) Eigenvalues, singular values, and eigenvectors (15A18) Multilinear algebra, tensor calculus (15A69) Vector spaces, linear dependence, rank, lineability (15A03)
Related Items (10)
Estimating latent trends in multivariate longitudinal data via Parafac2 with functional and structural constraints ⋮ Kruskal's uniqueness inequality is sharp ⋮ A generalization of Kruskal’s theorem on tensor decomposition ⋮ Identifiability of large phylogenetic mixture models ⋮ Parameter identifiability in a class of random graph mixture models ⋮ Estimation under group actions: recovering orbits from invariants ⋮ Unnamed Item ⋮ The special sign indeterminacy of the direct-fitting Parafac2 model: some implications, cautions, and recommendations for simultaneous component analysis ⋮ Efficient semiparametric estimation and model selection for multidimensional mixtures ⋮ Remarks on the Symmetric Rank of Symmetric Tensors
Cites Work
- On Kruskal's uniqueness condition for the Candecomp/Parafac decomposition
- Generic and typical ranks of multi-way arrays
- Identifiability of parameters in latent structure models with many observed variables
- Full reconstruction of Markov models on evolutionary trees: identifiability and consistency.
- More factors than subjects, tests and treatments: An indeterminacy theorem for canonical decomposition and individual differences scaling
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- Sufficient conditions for uniqueness in Candecomp/Parafac and Indscal with random component matrices
- On estimation of parameters in latent structure analysis
- Computation of the Canonical Decomposition by Means of a Simultaneous Generalized Schur Decomposition
- A Link between the Canonical Decomposition in Multilinear Algebra and Simultaneous Matrix Diagonalization
- Kruskal's Permutation Lemma and the Identification of CANDECOMP/PARAFAC and Bilinear Models with Constant Modulus Constraints
This page was built for publication: A concise proof of Kruskal's theorem on tensor decomposition