On Generic Identifiability of 3-Tensors of Small Rank
DOI10.1137/110829180zbMATH Open1263.14053arXiv1103.2696OpenAlexW1970195563WikidataQ60307022 ScholiaQ60307022MaRDI QIDQ4902932FDOQ4902932
Authors: Luca Chiantini, Giorgio Ottaviani
Publication date: 18 January 2013
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1103.2696
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
Multilinear algebra, tensor calculus (15A69) Canonical forms, reductions, classification (15A21) Projective techniques in algebraic geometry (14N05)
Cited In (59)
- Embedded varieties, \(X\)-ranks and uniqueness or finiteness of the solutions
- A generalization of Kruskal’s theorem on tensor decomposition
- On the description of identifiable quartics
- On unique tensor rank decomposition of 3-tensors
- A normal form algorithm for tensor rank decomposition
- Identifiability for mixtures of centered Gaussians and sums of powers of quadratics
- A Footnote to a Footnote to a Paper of B. Segre
- Bronowski's conjecture and the identifiability of projective varieties
- Catalecticant intersections and confinement of decompositions of forms
- 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
- Beyond the cactus rank of tensors
- A new class of non-identifiable skew-symmetric tensors
- Effective criteria for specific identifiability of tensors and forms
- Pencil-based algorithms for tensor rank decomposition are not stable
- Grassmann secants, identifiability, and linear systems of tensors
- Waring decompositions and identifiability via Bertini and Macaulay2 software
- 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)
- The condition number of join decompositions
- A note on nonclosed tensor formats
- Smoothed analysis for tensor methods in unsupervised learning
- The Hitchhiker guide to: secant varieties and tensor decomposition
- Segre functions in multiprojective spaces and tensor analysis
- 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
- Non-minimum tensor rank Gabidulin codes
- An algorithm for the non-identifiability of rank-3 tensors
- On the Terracini locus of projective varieties
- Bounds on the tensor rank
- An algorithm for generic and low-rank specific identifiability of complex tensors
- On complex and real identifiability of tensors
- Semialgebraic geometry of nonnegative tensor rank
- Computing the unique CANDECOMP/PARAFAC decomposition of unbalanced tensors by homotopy method
- On tangential weak defectiveness and identifiability of projective varieties
- Refined methods for the identifiability of tensors
- Identifiability of rank-3 tensors
- Coupled canonical polyadic decompositions and (coupled) decompositions in multilinear rank-\((L_r,n,L_r,n,1)\) terms. I: Uniqueness
- Condition numbers for the tensor rank decomposition
- Canonical polyadic decomposition of third-order tensors: relaxed uniqueness conditions and algebraic algorithm
- 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
- 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
- Identifiability for the k-secant variety of the Segre-Veronese varieties
- Generic Uniqueness Conditions for the Canonical Polyadic Decomposition and INDSCAL
- Almost all subgeneric third-order Chow decompositions are identifiable
- Decomposition Algorithms for Tensors and Polynomials
- Fiber sampling approach to canonical polyadic decomposition and application to tensor completion
- A uniqueness result on the decompositions of a bi-homogeneous polynomial
- Numerical tensor calculus
Uses Software
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)