Canonical polyadic decomposition of third-order tensors: relaxed uniqueness conditions and algebraic algorithm

By Ignat Domanov, Lieven De Lathauwer. 2015

84 citations recorded by the source corpus.

Canonical Polyadic Decomposition (CPD) of a third-order tensor is a minimal decomposition into a sum of rank-$1$ tensors. We find new mild deterministic conditions for the uniqueness of individual rank-$1$ tensors in CPD and present an algorithm to recover them. We call the algorithm "algebraic" because it relies only on standard linear algebra. It does not involve more advanced procedures than the computation of the null space of a matrix and eigen/singular value decomposition. Simulations indicate that the new conditions for uniqueness and the working assumptions for the algorithm hold for a randomly generated $I\times J\times K$ tensor of rank $R\geq K\geq J\geq I\geq 2$ if $R$ is bounded as $R\leq (I+J+K-2)/2 + (K-\sqrt{(I-J)^2+4K})/2$ at least for the dimensions that we have tested. This improves upon the famous Kruskal bound for uniqueness $R\leq (I+J+K-2)/2$ as soon as $I\geq 3$. In the particular case $R=K$, the new bound above is equivalent to the bound $R\leq(I-1)(J-1)$ which is known to be necessary and sufficient for the generic uniqueness of the CPD. An existing algebraic algorithm (based on simultaneous diagonalization of a set of matrices) computes the CPD under the more restrictive constraint $R(R-1)\leq I(I-1)J(J-1)/2$ (implying that $R<(J-\frac{1}{2})(I-\frac{1}{2})/\sqrt{2}+1$). On the other hand, optimization-based algorithms fail to compute the CPD in a reasonable amount of time even in the low-dimensional case $I=3$, $J=7$, $K=R=12$. By comparison, in our approach the computation takes less than $1$ sec. We demonstrate that, at least for $R\leq 24$, our algorithm can recover the rank-$1$ tensors in the CPD up to $R\leq(I-1)(J-1)$.

Subfields: Computational Mathematics, Computational Mechanics, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/555857d9f99e41975bc7bfd9d7d7b1e21bc06b36

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Mathematics

  1. T. Adalı
  2. Christian Jutten
  3. Dana Lahat

In Computational Mechanics

  1. T. Adalı
  2. Jinyuan Chang
  3. Christian Jutten
  4. Lin Yang
  5. Jingjing He
  6. Dana Lahat
  7. Qiwei Yao

In Computational Theory and Mathematics

  1. Jinyuan Chang
  2. Lin Yang
  3. Jingjing He
  4. Christian Jutten
  5. Qiwei Yao
  6. Jianqing Fan
  7. Clifford Lam

Citations in the corpus