| | |
| | |
Stat |
Members: 3667 Articles: 2'599'751 Articles rated: 2609
07 February 2025 |
|
| | | |
|
Article overview
| |
|
Effective criteria for specific identifiability of tensors and forms | Luca Chiantini
; Giorgio Ottaviani
; Nick Vannieuwenhoven
; | Date: |
1 Sep 2016 | Abstract: | In applications where the tensor rank decomposition arises, one often relies
on its identifiability properties for interpreting the individual rank-$1$
terms appearing in the decomposition. Several criteria for identifiability have
been proposed in the literature, however few results exist on how frequently
they are satisfied. We propose to call a criterion effective if it is satisfied
on a dense, open subset of the smallest semi-algebraic set enclosing the set of
rank-$r$ tensors. We analyze the effectiveness of Kruskal’s criterion when it
is combined with reshaping. It is proved that this criterion is effective for
both real and complex tensors in its entire range of applicability, which is
usually much smaller than the smallest typical rank. Our proof explains when
reshaping-based algorithms for computing tensor rank decompositions may be
expected to recover the decomposition. Specializing the analysis to symmetric
tensors or forms reveals that the reshaped Kruskal criterion may even be
effective up to the smallest typical rank for some third, fourth and sixth
order symmetric tensors of small dimension as well as for binary forms of
degree at least three. We extended this result to $4 imes 4 imes 4 imes
4$ symmetric tensors by analyzing the Hilbert function, resulting in a
criterion for symmetric identifiability that is effective up to symmetric rank
$8$, which is optimal. | Source: | arXiv, 1609.0123 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
|
| |
|
|
|