On the average condition number of tensor rank decompositions
Paul Breiding, Nick Vannieuwenhoven

TL;DR
This paper analyzes the expected sensitivity of tensor rank decompositions, revealing that certain low-dimensional tensors are highly sensitive to perturbations, while higher-dimensional tensors tend to be more stable.
Contribution
It provides the first theoretical and empirical analysis of the average condition number for tensor decompositions, highlighting differences based on tensor size and rank.
Findings
Expected condition number is infinite for certain $n_1\times n_2 \times 2$ tensors.
Tensors with all dimensions at least 3 have finite average condition numbers.
The results suggest a gap in sensitivity between low-dimensional and higher-dimensional tensors.
Abstract
We compute the expected value of powers of the geometric condition number of random tensor rank decompositions. It is shown in particular that the expected value of the condition number of tensors with a random rank- decomposition, given by factor matrices with independent and identically distributed standard normal entries, is infinite. This entails that it is expected and probable that such a rank- decomposition is sensitive to perturbations of the tensor. Moreover, it provides concrete further evidence that tensor decomposition can be a challenging problem, also from the numerical point of view. On the other hand, we provide strong theoretical and empirical evidence that tensors of size with all have a finite average condition number. This suggests there exists a gap in the expected sensitivity of tensors…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
