On Fast algorithms for orthogonal Tucker decomposition
Lists
Only you see this
Abstract
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 xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">3</sup> R), which is cheaper than O(I <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">3</sup> R + IR <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">4</sup> + R <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">6</sup> ) of HOOI for multilinear rank-(R, R, R) tensors of size I × I × I.
BibTeX
@inproceedings{phan2014fast,
author = {Anh Huy Phan and Andrzej S. Cichocki and Petr Tichavský},
title = {{On Fast algorithms for orthogonal Tucker decomposition}},
booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing},
year = {2014},
url = {https://openreview.net/forum?id=SzzMDgpU5gx},
}Loading related content...