Randomized algorithms for the low multilinear rank approximations of tensors

Published: 01 Jan 2021, Last Modified: 16 Apr 2025J. Comput. Appl. Math. 2021EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: In this paper, we focus on developing randomized algorithms for the computation of low multilinear rank approximations of tensors based on the random projection and the singular value decomposition. Following the theory of the singular values of sub-Gaussian matrices, we make a probabilistic analysis for the error bounds for the randomized algorithm. We demonstrate the effectiveness of proposed algorithms via several numerical examples.
Loading

OpenReview is a long-term project to advance science through improved peer review with legal nonprofit status. We gratefully acknowledge the support of the OpenReview Sponsors. © 2025 OpenReview