Subspace-orbit randomized algorithms for low rank approximations of third-order tensors in t-product format

This paper focuses on computing low rank approximations of third-order tensors in the t-product format using random techniques. Given a truncated term K, we derive randomized algorithms for approximating the K-term t-SVD, which is called as the subspace-orbit randomized t-SVD (sort-SVD). Additionall...

Full description

Saved in:
Bibliographic Details
Published inPattern recognition Vol. 170; p. 112066
Main Authors Wang, Xuezhong, Wang, Kai, Mo, Changxin
Format Journal Article
LanguageEnglish
Published Elsevier Ltd 01.02.2026
Subjects
Deterministic error
Probabilistic error
Randomized t-SVD
Subspace-orbit t-SVD
t-SVD
Tensor-tensor product
t-SVD
Randomized t-SVD
Tensor-tensor product
Probabilistic error
Subspace-orbit t-SVD
Deterministic error
Online AccessGet full text

Cover

More Information
Summary:This paper focuses on computing low rank approximations of third-order tensors in the t-product format using random techniques. Given a truncated term K, we derive randomized algorithms for approximating the K-term t-SVD, which is called as the subspace-orbit randomized t-SVD (sort-SVD). Additionally, we conduct an analysis of the deterministic and probabilistic error bounds of the proposed algorithm, subject to certain assumptions. We integrate the present algorithm with the power method to enhance the accuracy of the approximate the K-term t-SVD. Furthermore, we demonstrate the effectiveness of our algorithms through numerous numerical examples. Lastly, the proposed algorithms are employed to compress data tensors from various image databases.
ISSN:0031-3203
DOI:10.1016/j.patcog.2025.112066