Effective criteria for specific identifiability of tensors and forms

Abstract

In applications where the tensor rank decomposition arises, one often relies on its identifiability properties for interpreting the individual rank-$1$ terms appearing in the decomposition. Several criteria for identifiability have been proposed in the literature, however few results exist on how frequently they are satisfied. We propose to call a criterion effective if it is satisfied on a dense, open subset of the smallest semi-algebraic set enclosing the set of rank-$r$ tensors. We analyze the effectiveness of Kruskal's criterion when it is combined with reshaping. It is proved that this criterion is effective for both real and complex tensors in its entire range of applicability, which is usually much smaller than the smallest typical rank. Our proof explains when reshaping-based algorithms for computing tensor rank decompositions may be expected to recover the decomposition. Specializing the analysis to symmetric tensors or forms reveals that the reshaped Kruskal criterion may even be effective up to the smallest typical rank for some third, fourth and sixth order symmetric tensors of small dimension as well as for binary forms of degree at least three. We extended this result to $4\times 4\times 4\times 4$ symmetric tensors by analyzing the Hilbert function, resulting in a criterion for symmetric identifiability that is effective up to symmetric rank $8$, which is optimal.

31 pages, 2 Macaulay2 codes

References in corpus (4)

• Canonical polyadic decomposition of third-order tensors: reduction to generalized eigenvalue decomposition
• An algorithm for generic and low-rank specific identifiability of complex tensors
• Generic uniqueness conditions for the canonical polyadic decomposition and INDSCAL
• On generic identifiability of symmetric tensors of subgeneric rank

Cited by in corpus (27)

• The condition number of join decompositions
• A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem
• A condition number for the tensor rank decomposition
• Pencil-based algorithms for tensor rank decomposition are not stable
• Identifiability beyond Kruskal's bound for symmetric tensors of degree 4
• On the identifiability of ternary forms
• Tensor rank and entanglement of pure quantum states
• Identifiability for a class of symmetric tensors
• A generalization of Kruskal's theorem on tensor decomposition
• Algebraic stories from one and from the other pockets
• Waring decompositions and identifiability via Bertini and Macaulay2 software
• Goodness-of-fit tests on manifolds
• The average condition number of most tensor rank decomposition problems is infinite
• Tensor completion using geodesics on Segre manifolds
• On the average condition number of tensor rank decompositions
• A Normal Form Algorithm for Tensor Rank Decomposition
• Minimality and uniqueness for decompositions of specific ternary forms
• Hermitian Tensor Decompositions
• Rank one tensor completion problem
• Bounds on the tensor rank
• Linear dependent subsets of Segre varieties
• On a geometric method for the identifiability of forms
• Three decompositions of symmetric tensors have similar condition numbers
• Toward a generalization of Kruskal's theorem on tensor decomposition
• Varieties of sums of powers and moduli spaces of (1,7)-polarized abelian surfaces
• Efficient evaluation of noncommutative polynomials using tensor and noncommutative Waring decompositions
• Almost all subgeneric third-order Chow decompositions are identifiable