Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
Indexed incrossref
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…
Citation impact
948
total citations
- FWCI
- 24.33
- Percentile
- 100%
- References
- 74
Citations per year
Authors
2Topics & keywords
Topics
Keywords
- Mathematics
- Rank (graph theory)
- Tensor (intrinsic definition)
- Counterexample
- Low-rank approximation
- Equivalence (formal languages)
- Norm (philosophy)
- Matrix norm
No related works found for this paper.