Uniqueness of Tensor Decompositions with Applications to Polynomial Identifiability thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Uniqueness of Tensor Decompositions with Applications to Polynomial Identifiability

Published on Jul 15, 20142529 Views

We give a robust version of the celebrated result of Kruskal on the uniqueness of tensor decompositions: given a tensor whose decomposition satisfies a robust form of Kruskal’s rank condition, we prov

Related categories