Generalized Low-Rank Plus Sparse Tensor Estimation by Fast Riemannian Optimization

• Published in: Journal of the American Statistical Association Vol. 118; no. 544; pp. 2588 - 2604
• Main Authors: Cai, Jian-Feng, Li, Jingyang, Xia, Dong
• Format: Journal Article
• Language: English
• Published: Alexandria Taylor & Francis 02.10.2023; Taylor & Francis Ltd
• Subjects: Algorithms; Binary tensor; Continuity (mathematics); data collection; Errors; Generalized linear model; Generalized linear models; Heavy-tailed noise; International trade; Linear analysis; Optimization; Principal components analysis; Statistical models; Statistics; Tensor robust PCA; Tensors; Trade flows; Tucker decomposition
• ISSN: 0162-1459; 1537-274X; 1537-274X
• DOI: 10.1080/01621459.2022.2063131

We investigate a generalized framework to estimate a latent low-rank plus sparse tensor, where the low-rank tensor often captures the multi-way principal components and the sparse tensor accounts for potential model mis-specifications or heterogeneous signals that are unexplainable by the low-rank part. The framework flexibly covers both linear and generalized linear models, and can easily handle continuous or categorical variables. We propose a fast algorithm by integrating the Riemannian gradient descent and a novel gradient pruning procedure. Under suitable conditions, the algorithm converges linearly and can simultaneously estimate both the low-rank and sparse tensors. The statistical error bounds of final estimates are established in terms of the gradient of loss function. The error bounds are generally sharp under specific statistical models, for example, the sub-Gaussian robust PCA and Bernoulli tensor model. Moreover, our method achieves nontrivial error bounds for heavy-tailed tensor PCA whenever the noise has a finite 2 + ε moment. We apply our method to analyze the international trade flow dataset and the statistician hypergraph coauthorship network, both yielding new and interesting findings. Supplementary materials for this article are available online.