Guarantees for Existence of a Best Canonical Polyadic Approximation of a Noisy Low-Rank Tensor

DOI10.1137/20M1381046zbMath1484.15029arXiv2112.08283MaRDI QIDQ5862812

Publication date: 10 March 2022

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

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

zbMATH Keywords

existence multilinear algebra low-rank approximation tensors canonical polyadic decomposition generalized eigenvalue border rank Bauer-Fike matching distance

Mathematics Subject Classification ID

Inequalities involving eigenvalues and eigenvectors (15A42) Eigenvalues, singular values, and eigenvectors (15A18) Multilinear algebra, tensor calculus (15A69)

Related Items (2)

On Best Low Rank Approximation of Positive Definite Tensors ⋮ A Recursive Eigenspace Computation for the Canonical Polyadic Decomposition

Uses Software

Tensorlab
PARAFAC

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Tensor Decompositions and Applications
On the non-existence of optimal solutions and the occurrence of ``degeneracy in the CANDECOMP/PARAFAC model
The number of singular vector tuples and uniqueness of best rank-one approximation of tensors
On commuting matrices in max algebra and in classical nonnegative algebra
Rank and optimal computation of generic tensors
Computing stable eigendecompositions of matrix pencils
Simplicity of core arrays in three-way principal component analysis and the typical rank of $p\times q\times 2$ arrays
Unique best approximation from a $C^2$-manifold in Hilbert space
Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
On stability of invariant subspaces of commuting matrices
Tensor eigenvalues and their applications
Exact probabilities for typical ranks of $2 \times 2 \times 2$ and $3 \times 3 \times 2$ tensors
Spectral norm and nuclear norm of a third order tensor
Complex best $r$-term approximations almost always exist in finite dimensions
Degeneracy in Candecomp/Parafac explained for $p\times p\times 2$ arrays of rank $p+1$ or higher
Abelian tensors
Condition numbers for the tensor rank decomposition
A generalized solution of the orthogonal Procrustes problem
Explicit Candecomp/Parafac solutions for a contrived 2$\times 2\times 2$ array of rank three
Some approximation problems in semi-algebraic geometry
Semialgebraic Geometry of Nonnegative Tensor Rank
On the Uniqueness of the Canonical Polyadic Decomposition of Third-Order Tensors---Part I: Basic Results and Uniqueness of One Factor Matrix
Canonical Polyadic Decomposition of Third-Order Tensors: Reduction to Generalized Eigenvalue Decomposition
Tensor decompositions for learning latent variable models
On best rank one approximation of tensors
Tensors and Their Eigenvectors
Gerschgorin’s theorem for generalized eigenvalue problems in the Euclidean metric
A Multilinear Singular Value Decomposition
Real Algebraic Geometry for Geometric Constraints
Nuclear norm of higher-order tensors
Using Joint Generalized Eigenvectors of a Set of Covariance Matrix Pencils for Deflationary Blind Source Extraction
Tensor Decomposition for Signal Processing and Machine Learning
On perturbations of matrix pencils with real spectra, a revisit
Canonical Polyadic Decomposition with a Columnwise Orthonormal Factor Matrix
Low-Rank Approximation of Generic $p \timesq \times2$ Arrays and Diverging Components in the Candecomp/Parafac Model
Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
Blind Multilinear Identification
Most Tensor Problems Are NP-Hard
Algorithms and Computation

This page was built for publication: Guarantees for Existence of a Best Canonical Polyadic Approximation of a Noisy Low-Rank Tensor