Efficient Tensor Decomposition via Moment Matrix Extension

Abstract: Motivated by a flurry of recent work on efficient tensor decomposition algorithms, we show that the celebrated moment matrix extension algorithm of Brachat, Comon, Mourrain, and Tsigaridas for symmetric tensor canonical polyadic (CP) decomposition can be made efficient under the right conditions. We first show that the crucial property determining the complexity of the algorithm is the regularity of a target decomposition. This allows us to reduce the complexity of the vanilla algorithm, while also unifying results from previous works. We then show that for tensors in $S^d\mathbb{C}^{n+1}$ with $d$ even, low enough regularity can reduce finding a symmetric tensor decomposition to solving a system of linear equations. For order-$4$ tensors we prove that generic tensors of rank up to $r=2n+1$ can be decomposed efficiently via moment matrix extension, exceeding the rank threshold allowed by simultaneous diagonalization. We then formulate a conjecture that states for generic order-$4$ tensors of rank $r=O(n^2)$ the induced linear system is sufficient for efficient tensor decomposition, matching the asymptotics of existing algorithms and in fact improving the leading coefficient. Towards this conjecture we give computer assisted proofs that the statement holds for $n=2, \dots, 17$. Next we demonstrate that classes of nonidentifiable tensors can be decomposed efficiently via the moment matrix extension algorithm, bypassing the usual need for uniqueness of decomposition. Of particular interest is the class of monomials, for which the extension algorithm is not only efficient but also improves on existing theory by explicitly parameterizing the space of decompositions. Code for implementations of the efficient algorithm for generic tensors and monomials are provided, along with several numerical examples.