mlsanityData to 7 Oct 2026

Effective Streaming Low-tubal-rank Tensor Approximation via Frequent Directions

arXiv 2108.10129 ↗First posted 23 Aug 2021cs.LG stat.MLcited by 1

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 13 of its 52 references that are in the map. First posted on arXiv 23 Aug 2021.

Builds on

13 of 52 references.

References · 13

  1. 2014Sketching as a Tool for Numerical Linear Algebracited by 285
  2. 2018Tensor Robust Principal Component Analysis with A New Tensor Nuclear Normcited by 110
  3. 2015Exact tensor completion using t-SVDcited by 70
  4. 2015Frequent Directions : Simple and Deterministic Matrix Sketchingcited by 39
  5. 2017Tensor Robust Principal Component Analysis: Exact Recovery of Corrupted Low-Rank Tensors via Convex Optimizationcited by 35
  6. 2015Fast and Guaranteed Tensor Decomposition via Sketchingcited by 19
  7. 2019Low-Rank Tucker Approximation of a Tensor From Streaming Datacited by 15
  8. 2018Efficient Linear Bandits through Matrix Sketchingcited by 11
  9. 2020Grassmannian Optimization for Online Tensor Completion and Tracking with the t-SVDcited by 6
  10. 2017Effective Tensor Sketching via Sparsificationcited by 5
  11. 2020Low-Rank Autoregressive Tensor Completion for Multivariate Time Series Forecastingcited by 4
  12. 2013Randomized Approximation of the Gram Matrix: Exact Computation and Probabilistic Boundscited by 3
1 more
  1. 2020Randomized Online CP Decompositioncited by 1

Built on by

Cited by year

Citing papers per year: 2021: 1.

1 paper.