2024/04/25 by Zhiguang Cheng, Gaohang Yu, Cheng, Zhiguang +5
Mathematics · #68Q25 #68R10 #68U05 #FOS: Mathematics #Optimization and Control (math.OC) #Tensor decomposition and applications
paper · pdf · doi:10.48550/arxiv.2404.16580
openalex publication_date 2024/04/25 · openalex created_date 2024/04/27 · openalex updated_date 2026/07/28
Large tensors are frequently encountered in various fields such as computer vision, scientific simulations, sensor networks, and data mining. However, these tensors are often too large for convenient processing, transfer, or storage. Fortunately, they typically exhibit a low-rank structure that can be leveraged through tensor decomposition. However, performing large-scale tensor decomposition can be time-consuming. Sketching is a useful technique to reduce the dimensionality of the data. In this paper, we propose a novel two-sided sketching method based on the ⋆L-product decomposition and transformed domains like the discrete cosine transformation. A rigorous theoretical analysis is also conducted to assess the approximation error of the proposed method. Specifically, we improve our method with power iteration to achieve more precise approximate solutions. Extensive numerical experiments and comparisons on low-rank approximation of synthetic large tensors and real-world data like color images and grayscale videos illustrate the efficiency and effectiveness of the proposed approach in terms of both CPU time and approximation accuracy.