high-dimensional high-order data arise in many modern scientific applications including genomics, brain imaging, and social science. in this talk, we consider the methods, theories, and computations for tensor singular value decomposition (tensor svd), which aims to extract the hidden low-rank structure from high-dimensional high-order data. first, comprehensive results are developed on both the statistical and computational limits for tensor svd under the general scenario. this problem exhibits three different phases according to signal-noise-ratio (snr), and the minimax-optimal statistical and/or computational results are developed in each of the regimes. in addition, we further consider the sparse tensor singular value decomposition which allows more robust estimation under sparsity structural assumptions. a novel sparse tensor alternating thresholding algorithm is proposed. both the optimal theoretical results and numerical analyses are provided to guarantee the performance of the proposed procedure.