Canonical polyadic decomposition of third-order tensors: relaxed uniqueness conditions and algebraic algorithm
From MaRDI portal
Publication:344915
DOI10.1016/j.laa.2016.10.019zbMath1349.15065arXiv1501.07251OpenAlexW2964313686WikidataQ60307029 ScholiaQ60307029MaRDI QIDQ344915
Lieven De Lathauwer, I. Yu. Domanov
Publication date: 25 November 2016
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.07251
tensorsingular value decompositionCANDECOMP/PARAFAC decompositioncanonical polyadic decompositionCP decompositioneigenvalue decompositionuni-mode uniquenessuniqueness of CPD
Related Items (18)
Solving systems of polynomial equations -- a tensor approach ⋮ Overcomplete Order-3 Tensor Decomposition, Blind Deconvolution, and Gaussian Mixture Models ⋮ An ATLD-ALS method for the trilinear decomposition of large third-order tensors ⋮ Computing the unique CANDECOMP/PARAFAC decomposition of unbalanced tensors by homotopy method ⋮ High-order tensor estimation via trains of coupled third-order CP and Tucker decompositions ⋮ On the identifiability of ternary forms ⋮ $(L_r,L_r,1)$-Decompositions, Sparse Component Analysis, and the Blind Separation of Sums of Exponentials ⋮ The Power of Tensor-Based Approaches in Cardiac Applications ⋮ A robust Parafac model for compositional data ⋮ Bilinear factorizations subject to monomial equality constraints via tensor decompositions ⋮ A note on nonclosed tensor formats ⋮ Coherent signal parameter estimation by exploiting decomposition of tensors ⋮ Identifiability of rank-3 tensors ⋮ Pencil-Based Algorithms for Tensor Rank Decomposition are not Stable ⋮ Fiber Sampling Approach to Canonical Polyadic Decomposition and Application to Tensor Completion ⋮ A Riemannian gradient ascent algorithm with applications to orthogonal approximation problems of symmetric tensors ⋮ A Recursive Eigenspace Computation for the Canonical Polyadic Decomposition ⋮ Minimality and uniqueness for decompositions of specific ternary forms
Uses Software
Cites Work
- Tensor Decompositions and Applications
- PARAFAC: Parallel factor analysis
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- Uni-mode uniqueness conditions for CANDECOMP/PARAFAC decomposition of \(n\)-way arrays with linearly dependent loadings
- 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
- Uni-mode and Partial Uniqueness Conditions for CANDECOMP/PARAFAC of Three-Way Arrays with Linearly Dependent Loadings
- Canonical Polyadic Decomposition of Third-Order Tensors: Reduction to Generalized Eigenvalue Decomposition
- A Decomposition for Three-Way Arrays
- Generic Uniqueness Conditions for the Canonical Polyadic Decomposition and INDSCAL
- On Generic Identifiability of 3-Tensors of Small Rank
- A Link between the Canonical Decomposition in Multilinear Algebra and Simultaneous Matrix Diagonalization
- Kruskal's Permutation Lemma and the Identification of CANDECOMP/PARAFAC and Bilinear Models with Constant Modulus Constraints
This page was built for publication: Canonical polyadic decomposition of third-order tensors: relaxed uniqueness conditions and algebraic algorithm
