Spectral Algorithms for Tensor Completion

DOI10.1002/cpa.21748zbMath1404.15023arXiv1612.07866OpenAlexW2964021737MaRDI QIDQ4962471

Nike Sun, Andrea Montanari

Publication date: 2 November 2018

Published in: Communications on Pure and Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

unfoldingtensor completion

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Matrix completion problems (15A83)

Related Items

An optimal statistical and computational framework for generalized tensor estimation, Inference for low-rank tensors -- no need to debias, Noisy tensor completion via the sum-of-squares hierarchy, Statistically optimal and computationally efficient low rank tensor completion from noisy entries, Nonconvex Low-Rank Tensor Completion from Noisy Data, Tensor completion by multi-rank via unitary transformation, Marchenko–Pastur law with relaxed independence conditions, Covariate-Assisted Sparse Tensor Completion, Quantized Compressed Sensing: A Survey, Deterministic Tensor Completion with Hypergraph Expanders, On polynomial time methods for exact low-rank tensor completion, Subspace estimation from unbalanced and incomplete data matrices: \({\ell_{2,\infty}}\) statistical guarantees, Sparse random tensors: concentration, regularization and applications, Endpoint Results for Fourier Integral Operators on Noncompact Symmetric Spaces, An \({\ell_p}\) theory of PCA and spectral clustering, ISLET: Fast and Optimal Low-Rank Tensor Regression via Importance Sketching