Вход на сайт

Просмотр новости

Найдите то, что Вас интересует

Guaranteed Nonconvex Low-Rank Tensor Estimation via Scaled Gradient Descent

Дата публикации: 17-08-2026 20:26:00


Tensors, which give a faithful and effective representation to deliver the intrinsic structure of multi-dimensional data, play a crucial role in an increasing number of signal processing and machine learning problems. However, tensor data are often accompanied by arbitrary signal corruptions, including missing entries and sparse noise. A fundamental challenge is to reliably extract the meaningful information from corrupted tensor data in a statistically and computationally efficient manner. This paper develops a scaled gradient descent (ScaledGD) algorithm to directly estimate the tensor factors with tailored spectral initializations under the tensor-tensor product (t-product) and tensor singular value decomposition (t-SVD) framework. With tailored variants for tensor robust principal component analysis, (robust) tensor completion and tensor regression, we theoretically show that ScaledGD achieves linear convergence at a constant rate that is independent of the condition number of the ground truth low-rank tensor, while maintaining the low per-iteration cost of gradient descent. To the best of our knowledge, ScaledGD is the first algorithm that provably has such properties for low-rank tensor estimation with the t-SVD. Finally, numerical examples are provided to demonstrate the efficacy of ScaledGD in accelerating the convergence rate of ill-conditioned low-rank tensor estimation in a number of applications.

Схожие новости

#Наименование новостиТональностьИнформативностьДата публикации
1 Efficient frequent directions algorithms for approximate decomposition of matrices and higher-order tensors 05.6817-08-2026
2 Graph-based Clustering Revisited: A Relaxation of Kernel k-Means Perspective 010.9417-08-2026
3 Stochastic Differential Equations models for Least-Squares Stochastic Gradient Descent 06.6617-08-2026
4 Convergence and complexity of block majorization-minimization for constrained block-Riemannian optimization 07.1717-08-2026
5 Near-optimal Delta-convex Estimation of Lipschitz Functions 09.7117-08-2026
6 High-Dimensional Analysis of Gradient Flow for Extensive-Width Quadratic Neural Networks 08.717-08-2026
7 Statistical Learning Theory for Neural Operators 010.2117-08-2026
8 Asymptotics of Stochastic Gradient Descent with Dropout Regularization in Linear Models 05.8617-08-2026
9 Kernel Mean Embedding Deviation Subspace for Unsupervised Learning with Heterogeneous Data 05.717-08-2026
10 Unsupervised Feature Selection via Nonnegative Orthogonal Constrained Regularized Minimization 05.3317-08-2026

Классификация: Пресс-релизы. Схожих патентов: 0. Схожих новостей: 10. Тональность: 0. Информативность: 8.24. Источник: jmlr.org.