Optimal High-order Tensor SVD via Tensor-Train Orthogonal Iteration
Abstract
This paper studies a general framework for high-order tensor SVD. We propose a new computationally efficient algorithm, tensor-train orthogonal iteration (TTOI), that aims to estimate the low tensor-train rank structure from the noisy high-order tensor observation. The proposed TTOI consists of initialization via TT-SVD (Oseledets, 2011) and new iterative backward/forward updates. We develop the general upper bound on estimation error for TTOI with the support of several new representation lemmas on tensor matricizations. By developing a matching information-theoretic lower bound, we also prove that TTOI achieves the minimax optimality under the spiked tensor model. The merits of the proposed TTOI are illustrated through applications to estimation and dimension reduction of high-order Markov processes, numerical studies, and a real data example on New York City taxi travel records. The software of the proposed algorithm is available online.
Cite
@article{arxiv.2010.02482,
title = {Optimal High-order Tensor SVD via Tensor-Train Orthogonal Iteration},
author = {Yuchen Zhou and Anru R. Zhang and Lili Zheng and Yazhen Wang},
journal= {arXiv preprint arXiv:2010.02482},
year = {2022}
}
Comments
to appear in IEEE Transactions on Information Theory