2000 character limit reached
An Efficient Randomized Fixed-Precision Algorithm for Tensor Singular Value Decomposition (2207.08307v11)
Published 17 Jul 2022 in math.NA and cs.NA
Abstract: The existing randomized algorithms need an initial estimation of the tubal rank to compute a tensor singular value decomposition. This paper proposes a new randomized fixedprecision algorithm which for a given third-order tensor and a prescribed approximation error bound, automatically finds an optimal tubal rank and the corresponding low tubal rank approximation. The algorithm is based on the random projection technique and equipped with the power iteration method for achieving a better accuracy. We conduct simulations on synthetic and real-world datasets to show the efficiency and performance of the proposed algorithm.