Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
Top Cited Papers
- 1 January 2008
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 30 (3), 1084-1127
- https://doi.org/10.1137/06066518x
Abstract
There has been continued interest in seeking a theorem describing optimal low-rank approximations to tensors of order 3 or higher that parallels the Eckart–Young theorem for matrices. In this paper, we argue that the naive approach to this problem is doomed to failure because, unlike matrices, tensors of order 3 or higher can fail to have best rank-r approximations. The phenomenon is much more widespread than one might suspect: examples of this failure can be constructed over a wide range of dimensions, orders, and ranks, regardless of the choice of norm (or even Brègman divergence). Moreover, we show that in many instances these counterexamples have positive volume: they cannot be regarded as isolated phenomena. In one extreme case, we exhibit a tensor space in which no rank-3 tensor has an optimal rank-2 approximation. The notable exceptions to this misbehavior are rank-1 tensors and order-2 tensors (i.e., matrices). In a more positive spirit, we propose a natural way of overcoming the ill-posedness of...Keywords
All Related Versions
This publication has 35 references indexed in Scilit:
- Symmetric Tensors and Symmetric Tensor RankSIAM Journal on Matrix Analysis and Applications, 2008
- Higher secant varieties of the Segre varietiesJournal of Pure and Applied Algebra, 2005
- Ranks of tensors, secant varieties of Segre varieties and fat pointsLinear Algebra and its Applications, 2002
- A Multilinear Singular Value DecompositionSIAM Journal on Matrix Analysis and Applications, 2000
- Border rank of m×n×(mn−q) tensorsLinear Algebra and its Applications, 1986
- Approximate Solutions for the Bilinear Form Computational ProblemSIAM Journal on Computing, 1980
- Bounds on the ranks of some 3-tensorsLinear Algebra and its Applications, 1980
- On the maximal multiplicative complexity of a family of bilinear formsLinear Algebra and its Applications, 1979
- O(n2.7799) complexity for n × n approximate matrix multiplicationInformation Processing Letters, 1979
- Ranks of tensors and change of base fieldJournal of Algebra, 1969