Adaptive Cross Tubal Tensor Approximation

DOI10.1016/J.LAA.2024.04.015MaRDI QIDQ6435830zbMATH OpenOpenAlexFDO

Authors S. Ahmadi-Asl, Anh-Huy Phan, Andrzej Cichocki, Anastasia Sozykina, Zaher Al Aghbari, Jun Wang, Ivan Oseledets

Publication date 8 May 2023

Full work available at URL https://doi.org/10.1016/j.laa.2024.04.015

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Multilinear algebra, tensor calculus (15A69) Numerical linear algebra (65F99)

Abstract: In this paper, we propose a new adaptive cross algorithm for computing a low tubal rank approximation of third-order tensors, with less memory and lower computational complexity than the truncated tensor SVD (t-SVD). This makes it applicable for decomposing large-scale tensors. We conduct numerical experiments on synthetic and real-world datasets to confirm the efficiency and feasibility of the proposed algorithm. The simulation results show more than one order of magnitude acceleration in the computation of low tubal rank (t-SVD) for large-scale tensors. An application to pedestrian attribute recognition is also presented.

Recommendations

• Efficient alternating least squares algorithms for low multilinear rank approximation of tensors
• Practical sketching algorithms for low-rank Tucker approximation of large tensors
• Generalized cross approximation for 3D-tensors
• An efficient randomized fixed-precision algorithm for tensor singular value decomposition
• Proximal gradient algorithm for nonconvex low tubal rank tensor recovery

Cited in

(2)

• RA-HOOI: rank-adaptive higher-order orthogonal iteration for the fixed-accuracy low multilinear-rank approximation of tensors
• Robust Low-Tubal-Rank Tensor Completion under Cross-Concentrated Sampling

This page was built for publication: Adaptive Cross Tubal Tensor Approximation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6435830)