An efficient uniqueness theorem for overcomplete tensor decomposition
<|reference_start|>An efficient uniqueness theorem for overcomplete tensor decomposition: We give a new, constructive uniqueness theorem for tensor decomposition. It applies to order 3 tensors of format $n \times n \times p$ and can prove uniqueness of decomposition for generic tensors up to rank $r=4n/3$ as soon as $p \geq 4$. One major advantage over Kruskal's uniqueness theorem is that our theorem has an algorithmic proof, and the resulting algorithm is efficient. Like the uniqueness theorem, it applies in the range $n \leq r \leq 4n/3$. As a result, we obtain the first efficient algorithm for overcomplete decomposition of generic tensors of order 3.   For instance, prior to this work it was not known how to efficiently decompose generic tensors of format $n \times n \times n$ and rank $r=1.01n$ (or rank $r \leq (1+\epsilon) n$, for some constant $\epsilon >0$). Efficient overcomplete decomposition of generic tensors of format $n \times n \times 3$ remains an open problem.   Our results are based on the method of commuting extensions pioneered by Strassen for the proof of his $3n/2$ lower bound on tensor rank and border rank. In particular, we rely on an algorithm for the computation of commuting extensions recently proposed in a companion paper, and on the classical diagonalization-based "Jennrich algorithm" for undercomplete tensor decomposition.<|reference_end|>
@article{koiran2024an,
    title={An efficient uniqueness theorem for overcomplete tensor decomposition},
    author={Pascal Koiran},
    journal={arXiv preprint arXiv:2404.07801},
    year={2024},
    archivePrefix={arXiv},
    eprint={2404.07801},
    primaryClass={cs.DS cs.CC cs.DM math.CO}
}