Generic Uniqueness Conditions for the Canonical Polyadic Decomposition and INDSCAL

DOI10.1137/140970276zbMath1330.15028arXiv1405.6238OpenAlexW2195165862MaRDI QIDQ3456872

Lieven De Lathauwer, I. Yu. Domanov

Publication date: 9 December 2015

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.6238

zbMATH Keywords

uniquenessalgebraic geometryCANDECOMP/PARAFAC decompositioncanonical polyadic decompositionindscalthird-order tensor

Mathematics Subject Classification ID

Factorization of matrices (15A23) Computational aspects of higher-dimensional varieties (14Q15) Multilinear algebra, tensor calculus (15A69) Varieties and morphisms (14A10) Elementary questions in algebraic geometry (14A25)

Related Items (32)

Identifiability for the k-secant variety of the Segre-Veronese varieties ⋮ Separability of Hermitian tensors and PSD decompositions ⋮ Estimating multivariate latent-structure models ⋮ Set evincing the ranks with respect to an embedded variety (symmetric tensor rank and tensor rank) ⋮ A very brief introduction to nonnegative tensors from the geometric viewpoint ⋮ Canonical polyadic decomposition of third-order tensors: relaxed uniqueness conditions and algebraic algorithm ⋮ Computing the unique CANDECOMP/PARAFAC decomposition of unbalanced tensors by homotopy method ⋮ Linearly dependent subsets of Segre varieties ⋮ Condition numbers for the tensor rank decomposition ⋮ A survey on deep matrix factorizations ⋮ Effective Criteria for Specific Identifiability of Tensors and Forms ⋮ On the description of identifiable quartics ⋮ Identifiability of an X-Rank Decomposition of Polynomial Maps ⋮ From non-defectivity to identifiability ⋮ On Best Low Rank Approximation of Positive Definite Tensors ⋮ On Uniqueness and Computation of the Decomposition of a Tensor into Multilinear Rank-$(1,L_r,L_r)$ Terms ⋮ Symmetric Hermitian decomposability criterion, decomposition, and its applications ⋮ The average condition number of most tensor rank decomposition problems is infinite ⋮ The Power of Tensor-Based Approaches in Cardiac Applications ⋮ A robust Parafac model for compositional data ⋮ Hermitian Tensor Decompositions ⋮ Real identifiability vs. complex identifiability ⋮ Waring decompositions and identifiability via Bertini and Macaulay2 software ⋮ Unnamed Item ⋮ A note on nonclosed tensor formats ⋮ Partially symmetric tensor rank: the description of the non-uniqueness case for low rank ⋮ Identifiability of rank-3 tensors ⋮ Fiber Sampling Approach to Canonical Polyadic Decomposition and Application to Tensor Completion ⋮ On secant dimensions and identifiability of flag varieties ⋮ Semialgebraic Geometry of Nonnegative Tensor Rank ⋮ On large-scale dynamic topic modeling with nonnegative CP tensor decomposition ⋮ On secant defectiveness and identifiability of Segre-Veronese varieties

Uses Software

• PARAFAC

Cites Work

• Unnamed Item
• Tensor Decompositions and Applications
• PARAFAC: Parallel factor analysis
• Refined methods for the identifiability of tensors
• Algebraic geometry. An introduction. Transl. from the French by Catriona Maclean
• Rank and optimal computation of generic tensors
• 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
• Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
• Optimization-Based Algorithms for Tensor Decompositions: Canonical Polyadic Decomposition, Decomposition in Rank-$(L_r,L_r,1)$ Terms, and a New Generalization
• On the Uniqueness of the Canonical Polyadic Decomposition of Third-Order Tensors---Part I: Basic Results and Uniqueness of One Factor Matrix
• On the Uniqueness of the Canonical Polyadic Decomposition of Third-Order Tensors---Part II: Uniqueness of the Overall Decomposition
• On Generic Identifiability of 3-Tensors of Small Rank
• An Algorithm For Generic and Low-Rank Specific Identifiability of Complex Tensors
• Decompositions of a Higher-Order Tensor in Block Terms—Part II: Definitions and Uniqueness
• Almost-sure identifiability of multidimensional harmonic retrieval
• Applied Multiway Data Analysis

This page was built for publication: Generic Uniqueness Conditions for the Canonical Polyadic Decomposition and INDSCAL