An algorithm for generic and low-rank specific identifiability of complex tensors

Abstract

We propose a new sufficient condition for verifying whether generic rank-r complex tensors of arbitrary order admit a unique decomposition as a linear combination of rank-1 tensors. A practical algorithm is proposed for verifying this condition, with which it was established that in all spaces of dimension less than 15000, with a few known exceptions, listed in the paper, generic identifiability holds for ranks up to one less than the generic rank of the space. This is the largest possible rank value for which generic identifiability can hold, except for spaces with a perfect shape. The algorithm can also verify the identifiability of a given specific rank-r decomposition, provided that it can be shown to correspond to a nonsingular point of the r-th order secant variety. For sufficiently small rank, which nevertheless improves upon the known bounds for specific identifiability, some local equations of this variety are known, allowing us to verify this property. As a particular example of our approach, we prove the identifiability of a specific 5x5x5 tensor of rank 7, which cannot be handled by the conditions recently provided in [I. Domanov and L. De Lathauwer, On the Uniqueness of the Canonical Polyadic Decomposition of third-order tensors--Part II: Uniqueness of the overall decomposition, SIAM J. Matrix Anal. Appl. 34(3), 2013]. Finally, we also present a surprising new class of weakly-defective Segre varieties that nevertheless turns out to admit a generically unique decomposition.

22 pages, one C++ code and two Macaulay2 codes as ancillary files

References in corpus (1)

• Identifiability of parameters in latent structure models with many observed variables

Cited by in corpus (30)

• Tensor Decomposition for Signal Processing and Machine Learning
• Linked Component Analysis from Matrices to High Order Tensors: Applications to Biomedical Data
• Generic uniqueness conditions for the canonical polyadic decomposition and INDSCAL
• Estimation under group actions: recovering orbits from invariants
• The Hitchhiker guide to: Secant Varieties and Tensor Decomposition
• On generic identifiability of symmetric tensors of subgeneric rank
• Effective criteria for specific identifiability of tensors and forms
• The condition number of join decompositions
• Estimating multivariate latent-structure models
• A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem
• A condition number for the tensor rank decomposition
• Identifiability of homogeneous polynomials and Cremona Transformations
• Pencil-based algorithms for tensor rank decomposition are not stable
• Equations for the fifth secant variety of Segre products of projective spaces
• Convergence analysis of Riemannian Gauss-Newton methods and its connection with the geometric condition number
• Tensor rank and entanglement of pure quantum states
• Most secant varieties of tangential varieties to Veronese varieties are nondefective
• Real identifiability vs complex identifiability
• Learning Algebraic Models of Quantum Entanglement
• Homotopy techniques for tensor decomposition and perfect identifiability
• Identifiability for mixtures of centered Gaussians and sums of powers of quadratics
• Waring decompositions and identifiability via Bertini and Macaulay2 software
• 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
• On a geometric method for the identifiability of forms
• Identifiability and singular locus of secant varieties to spinor varieties
• Generalized identifiability of sums of squares
• Almost all subgeneric third-order Chow decompositions are identifiable