Abstract

Low-tubal-rank tensor approximation has been proposed to analyze large-scale and multidimensional data. However, finding such an accurate approximation is challenging in the streaming setting, due to the limited computational resources. To alleviate this issue, this article extends a popular matrix sketching technique, namely, frequent directions (FDs), 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 multidimensional 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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.