This paper considers the problem of recovering a tensor with an underlying low-tubal-rank structure from a small number of corrupted linear measurements. Traditional approaches tackling such a problem require the computation of tensor Singular Value Decomposition (t-SVD), that is a computationally intensive process, rendering them impractical for dealing with large-scale tensors. Aim to address this challenge, we propose an efficient and effective low-tubal-rank tensor recovery method based on a factorization procedure akin to the Burer-Monteiro (BM) method. Precisely, our fundamental approach involves decomposing a large tensor into two smaller factor tensors, followed by solving the problem through factorized gradient descent (FGD). This strategy eliminates the need for t-SVD computation, thereby reducing computational costs and storage requirements. We provide rigorous theoretical analysis to ensure the convergence of FGD under both noise-free and noisy situations. Additionally, it is worth noting that our method does not require the precise estimation of the tensor tubal-rank. Even in cases where the tubal-rank is slightly overestimated, our approach continues to demonstrate robust performance. A series of experiments have been carried out to demonstrate that, as compared to other popular ones, our approach exhibits superior performance in multiple scenarios, in terms of the faster computational speed and the smaller convergence error.

翻译：本文研究从少量损坏的线性测量中恢复具有潜在低管秩结构的张量问题。解决此类问题的传统方法需要计算张量奇异值分解（t-SVD），这是一个计算密集型过程，导致其无法处理大规模张量。为应对这一挑战，我们提出一种基于类似于布勒-蒙特罗（BM）方法的因子化过程的高效低管秩张量恢复方法。具体而言，我们的基本方法是将大型张量分解为两个较小的因子张量，然后通过因子化梯度下降（FGD）求解问题。该策略避免了t-SVD计算，从而降低了计算成本和存储需求。我们提供了严格的理论分析，以确保FGD在无噪声和有噪声情况下的收敛性。此外，值得注意的是，我们的方法不需要精确估计张量的管秩。即使在管秩被轻微高估的情况下，我们的方法仍能表现出鲁棒的性能。一系列实验表明，与其他常用方法相比，我们的方法在多种场景下均展现出更优的性能，具体表现为更快的计算速度和更小的收敛误差。