Low-tubal-rank tensor approximation has been proposed to analyze large-scale and multi-dimensional data. However, finding such an accurate approximation is challenging in the streaming setting, due to the limited computational resources. To alleviate this issue, this paper extends a popular matrix sketching technique, namely Frequent Directions, for constructing an efficient and accurate low-tubal-rank tensor approximation from streaming data based on the tensor Singular Value Decomposition (t-SVD). Specifically, the new algorithm allows the tensor data to be observed slice by slice, but only needs to maintain and incrementally update a much smaller sketch which could capture the principal information of the original tensor. The rigorous theoretical analysis shows that the approximation error of the new algorithm can be arbitrarily small when the sketch size grows linearly. Extensive experimental results on both synthetic and real multi-dimensional data further reveal the superiority of the proposed algorithm compared with other sketching algorithms for getting low-tubal-rank approximation, in terms of both efficiency and accuracy.
翻译:由于计算资源有限,因此在流流环境中找到这样一个准确的近似值具有挑战性。为了缓解这一问题,本文件扩展了一种流行的矩阵草图技术,即“常线方向”,用于根据“高声” Singulal值分解法(t-SVD) 构建高效和准确的低声速近近似值数据。具体地说,新的算法允许按切片来观测强光数据,但只需要维持并逐步更新一个小得多的草图,以捕捉原始拉子的主要信息。严格的理论分析表明,在草图尺寸线性增长时,新算法的近似错误可能任意地很小。合成数据和实际的多维数据的广泛实验结果进一步揭示了拟议的算法相对于其他草图算法在效率和准确性两方面获得低调近似率方面的优势。