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

DOI10.1080/01621459.2022.2063131arXiv2103.08895OpenAlexW3139260387WikidataQ114101028 ScholiaQ114101028MaRDI QIDQ6144773

Dong Xia, Jingyang Li, Jian-Feng Cai

Publication date: 8 January 2024

Published in: Journal of the American Statistical Association (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2103.08895

zbMATH Keywords

generalized linear modelTucker decompositionheavy-tailed noisebinary tensortensor robust PCA

Mathematics Subject Classification ID

Statistics (62-XX)

Related Items (1)

Latent Space Model for Higher-Order Networks and Generalized Tensor Decomposition

Cites Work

• Unnamed Item
• Unnamed Item
• Tensor Decompositions and Applications
• Covariate-Adjusted Tensor Classification in High-Dimensions
• Fast community detection by SCORE
• Main effects and interactions in mixed and incomplete data frames
• Low-rank tensor completion by Riemannian optimization
• Coauthorship and citation networks for statisticians
• Spectral clustering in the dynamic stochastic block model
• Spectral norm of products of random and deterministic matrices
• Multilayer tensor factorization with applications to recommender systems
• On polynomial time methods for exact low-rank tensor completion
• Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data
• Community detection on mixture multilayer networks via regularized tensor decomposition
• An optimal statistical and computational framework for generalized tensor estimation
• Tensor clustering with planted structures: statistical optimality and computational limits
• Inference for low-rank tensors -- no need to debias
• Spectral and matrix factorization methods for consistent community detection in multi-layer networks
• Normal approximation and confidence region of singular subspaces
• Convex regularization for high-dimensional multiresponse tensor regression
• Common and individual structure of brain networks
• Statistically optimal and computationally efficient low rank tensor completion from noisy entries
• Tensor decompositions for learning latent variable models
• Robust principal component analysis?
• The Geometry of Algorithms with Orthogonality Constraints
• Tensor SVD: Statistical and Computational Limits
• Incoherent Tensor Norms and Their Applications in Higher Order Tensor Completion
• High-Dimensional Probability
• ISLET: Fast and Optimal Low-Rank Tensor Regression via Importance Sketching
• Sparse and Low-Rank Tensor Estimation via Cubic Sketchings
• 1-Bit matrix completion
• Dynamic Tensor Clustering
• Tensor Regression with Applications in Neuroimaging Data Analysis
• The Sup-norm Perturbation of HOSVD and Low Rank Tensor Denoising
• Provable Sparse Tensor Decomposition

This page was built for publication: Generalized Low-Rank Plus Sparse Tensor Estimation by Fast Riemannian Optimization