Subtracting a best rank-1 approximation may increase tensor rank

DOI10.1016/j.laa.2010.06.027zbMath1198.15018arXiv0906.0483OpenAlexW2569661359MaRDI QIDQ5962281

Alwin Stegeman, Pierre Comon

Publication date: 21 September 2010

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

symmetric tensorsdata analysistensor decompositioncandecomplow-rank approximationmulti-wayparafactensor rank

Mathematics Subject Classification ID

Related Items (12)

A very brief introduction to nonnegative tensors from the geometric viewpoint ⋮ Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors ⋮ A Constructive Algorithm for Decomposing a Tensor into a Finite Sum of Orthonormal Rank-1 Terms ⋮ Cayley's hyperdeterminant: A combinatorial approach via representation theory ⋮ Subtracting a best rank‐1 approximation from p × p × 2(p≥2) tensors ⋮ Factorization strategies for third-order tensors ⋮ On the hyperdeterminant for 2×2×3 arrays ⋮ The Euclidean distance degree of an algebraic variety ⋮ Tensor Decompositions for Learning Latent Variable Models (A Survey for ALT) ⋮ A Higher Order Unscented Transform ⋮ On the Uniqueness and Perturbation to the Best Rank-One Approximation of a Tensor ⋮ A literature survey of low-rank tensor approximation techniques

Cites Work

• Unnamed Item
• Tensor Decompositions and Applications
• On the non-existence of optimal solutions and the occurrence of ``degeneracy in the CANDECOMP/PARAFAC model
• On Kruskal's uniqueness condition for the Candecomp/Parafac decomposition
• Tensor-based techniques for the blind separation of DS-CDMA signals
• PARAFAC-based unified tensor modeling for wireless communication systems with application to blind multiuser equalization
• Rank and optimal computation of generic tensors
• Simplicity of core arrays in three-way principal component analysis and the typical rank of \(p\times q\times 2\) arrays
• Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
• Independent component analysis, a new concept?
• Decomposition of quantics in sums of powers of linear forms
• Typical rank and indscal dimensionality for symmetric three-way arrays of order \(I\times 2\times 2\) or \(I\times 3\times 3\)
• Degeneracy in Candecomp/Parafac explained for \(p\times p\times 2\) arrays of rank \(p+1\) or higher
• Rank and eigenvalues of a supersymmetric tensor, the multivariate homogeneous polynomial and the algebraic hypersurface it defines
• On the best rank-1 approximation to higher-order symmetric tensors
• Degeneracy in Candecomp/Parafac and Indscal explained for several three-sliced arrays with a two-valued typical rank
• Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
• Explicit Candecomp/Parafac solutions for a contrived 2\(\times 2\times 2\) array of rank three
• Rank-One Approximation to High Order Tensors
• On the Best Rank-1 Approximation of Higher-Order Supersymmetric Tensors
• A Method to Avoid Diverging Components in the Candecomp/Parafac Model for Generic $I\timesJ\times2$ Arrays
• The invariant theory of binary forms
• Optimal Evaluation of Pairs of Bilinear Forms
• On the Best Rank-1 and Rank-(R₁ ,R₂ ,. . .,R_N) Approximation of Higher-Order Tensors
• 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
• Symmetric Tensors and Symmetric Tensor Rank
• Applied Multiway Data Analysis

This page was built for publication: Subtracting a best rank-1 approximation may increase tensor rank