The condition number of many tensor decompositions is invariant under Tucker compression
arXiv:2106.13034 · doi:10.1007/s11075-023-01526-9
Abstract
We characterise the sensitivity of several additive tensor decompositions with respect to perturbations of the original tensor. These decompositions include canonical polyadic decompositions, block term decompositions, and sums of tree tensor networks. Our main result shows that the condition number of all these decompositions is invariant under Tucker compression. This result can dramatically speed up the computation of the condition number in practical applications. We give the example of an tensor of rank from a food science application whose condition number was computed in milliseconds by exploiting our new theorem, representing a speedup of four orders of magnitude over the previous state of the art.
References in corpus (7)
- A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
- Tensor Decomposition for Signal Processing and Machine Learning
- The condition number of join decompositions
- A condition number for the tensor rank decomposition
- Convergence analysis of Riemannian Gauss-Newton methods and its connection with the geometric condition number
- On the identifiability of ternary forms
- The condition number of Riemannian approximation problems