On Fast algorithms for orthogonal Tucker decomposition
We propose algorithms for Tucker tensor decomposition, which can avoid computing singular value decomposition or eigenvalue decomposition of large matrices as in the work horse higher order orthogonal iteration (HOOI) algorithm. The novel algorithms require computational cost of O(I<sup>3</sup>R) which is cheaper than O(I<sup>3</sup>R IR<sup>4</sup> R<sup>6</sup> of HOOI for multilinear rank (R, R, R) tensors of size I x I x I.
2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)