On Generic Identifiability of 3-Tensors of Small Rank
From MaRDI portal
Publication:4902932
Abstract: We introduce an inductive method for the study of the uniqueness of decompositions of tensors, by means of tensors of rank 1. The method is based on the geometric notion of weak defectivity. For three-dimensional tensors of type (a, b, c), ale ble c, our method proves that the decomposition is unique (i.e. k-identifiability holds) for general tensors of rank k, as soon as kle (a+1)(b+1)/16. This improves considerably the known range for identifiability. The method applies also to tensor of higher dimension. For tensors of small size, we give a complete list of situations where identifiability does not hold. Among them, there are 4 imes4 imes4 tensors of rank 6, an interesting case because of its connection with the study of DNA strings.
Recommendations
- An algorithm for generic and low-rank specific identifiability of complex tensors
- An algorithm for the non-identifiability of rank-3 tensors
- On the dimension of contact loci and the identifiability of tensors
- Hilbert functions and tensor analysis
- Sets computing the symmetric tensor rank
- A uniqueness result on the decompositions of a bi-homogeneous polynomial
- Grassmann secants, identifiability, and linear systems of tensors
- Refined methods for the identifiability of tensors
- Segre functions in multiprojective spaces and tensor analysis
- Bounds on the tensor rank
Cited in
(60)- Catalecticant intersections and confinement of decompositions of forms
- Embedded varieties, \(X\)-ranks and uniqueness or finiteness of the solutions
- Tangential weak defectiveness and generic identifiability
- Topology of tensor ranks
- Tensor decompositions in rank \(+1\)
- One example of general unidentifiable tensors
- Typical and admissible ranks over fields
- A new class of non-identifiable skew-symmetric tensors
- Beyond the cactus rank of tensors
- Grassmann secants, identifiability, and linear systems of tensors
- Effective criteria for specific identifiability of tensors and forms
- Waring decompositions and identifiability via Bertini and Macaulay2 software
- Pencil-based algorithms for tensor rank decomposition are not stable
- A generalization of Kruskal’s theorem on tensor decomposition
- On the description of identifiable quartics
- On unique tensor rank decomposition of 3-tensors
- Linearly dependent subsets of Segre varieties
- A very brief introduction to nonnegative tensors from the geometric viewpoint
- Set evincing the ranks with respect to an embedded variety (symmetric tensor rank and tensor rank)
- A note on nonclosed tensor formats
- Smoothed analysis for tensor methods in unsupervised learning
- The condition number of join decompositions
- Homotopy techniques for tensor decomposition and perfect identifiability
- The Hitchhiker guide to: secant varieties and tensor decomposition
- Segre functions in multiprojective spaces and tensor analysis
- A normal form algorithm for tensor rank decomposition
- On identifiability of higher order block term tensor decompositions of rank \(L_r \otimes\) rank-1
- On partial and generic uniqueness of block term tensor decompositions
- All secant varieties of the Chow variety are nondefective for cubics and quaternary forms
- Identifiability for mixtures of centered Gaussians and sums of powers of quadratics
- Non-minimum tensor rank Gabidulin codes
- On the Terracini locus of projective varieties
- Bounds on the tensor rank
- An algorithm for the non-identifiability of rank-3 tensors
- A Footnote to a Footnote to a Paper of B. Segre
- On complex and real identifiability of tensors
- An algorithm for generic and low-rank specific identifiability of complex tensors
- Semialgebraic geometry of nonnegative tensor rank
- Computing the unique CANDECOMP/PARAFAC decomposition of unbalanced tensors by homotopy method
- Refined methods for the identifiability of tensors
- Identifiability of rank-3 tensors
- On tangential weak defectiveness and identifiability of projective varieties
- Condition numbers for the tensor rank decomposition
- Canonical polyadic decomposition of third-order tensors: relaxed uniqueness conditions and algebraic algorithm
- Coupled canonical polyadic decompositions and (coupled) decompositions in multilinear rank-\((L_r,n,L_r,n,1)\) terms. I: Uniqueness
- Algebraic geometry and representation theory in the study of matrix multiplication complexity and other problems in theoretical computer science
- From non-defectivity to identifiability
- \((L_r,L_r,1)\)-decompositions, sparse component analysis, and the blind separation of sums of exponentials
- Real identifiability vs. complex identifiability
- On generic identifiability of symmetric tensors of subgeneric rank
- Bronowski's conjecture and the identifiability of projective varieties
- The average condition number of most tensor rank decomposition problems is infinite
- Partially symmetric tensor rank: the description of the non-uniqueness case for low rank
- Generic Uniqueness Conditions for the Canonical Polyadic Decomposition and INDSCAL
- Identifiability for the k-secant variety of the Segre-Veronese varieties
- Almost all subgeneric third-order Chow decompositions are identifiable
- A uniqueness result on the decompositions of a bi-homogeneous polynomial
- Fiber sampling approach to canonical polyadic decomposition and application to tensor completion
- Decomposition Algorithms for Tensors and Polynomials
- Numerical tensor calculus
This page was built for publication: On Generic Identifiability of 3-Tensors of Small Rank
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4902932)
