Nonconvex Low-Rank Tensor Completion from Noisy Data
From MaRDI portal
Publication:5080674
DOI10.1287/opre.2021.2106MaRDI QIDQ5080674
Changxiao Cai, Yuxin Chen, H. Vincent Poor, Gen Li
Publication date: 31 May 2022
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.04436
90C26: Nonconvex programming, global optimization
Related Items
Convex and Nonconvex Optimization Are Both Minimax-Optimal for Noisy Blind Deconvolution Under Random Designs, Covariate-Assisted Sparse Tensor Completion
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- Parallel matrix factorization for low-rank tensor completion
- On tensor completion via nuclear norm minimization
- High-dimensional covariance matrix estimation with missing observations
- On the impact of predictor geometry on the performance on high-dimensional ridge-regularized generalized robust regression estimators
- Cross: efficient low-rank tensor completion
- Tensor completion using total variation and low-rank matrix factorization
- Subspace estimation from unbalanced and incomplete data matrices: \({\ell_{2,\infty}}\) statistical guarantees
- Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution
- Entrywise eigenvector analysis of random matrices with low expected rank
- Spectral method and regularized MLE are both optimal for top-\(K\) ranking
- Low rank tensor recovery via iterative hard thresholding
- Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval
- Exact matrix completion via convex optimization
- Orthogonal Tensor Decompositions
- Riemannian Optimization for High-Dimensional Tensor Completion
- A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
- Robust Low-Rank Tensor Recovery: Models and Algorithms
- Tensor decompositions for learning latent variable models
- Guaranteed Matrix Completion via Non-Convex Factorization
- Phase Retrieval via Wirtinger Flow: Theory and Algorithms
- Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems
- Robust Spectral Compressed Sensing via Structured Matrix Completion
- Tensor completion and low-n-rank tensor recovery via convex optimization
- Tensor SVD: Statistical and Computational Limits
- Incoherent Tensor Norms and Their Applications in Higher Order Tensor Completion
- Tensor-Based Formulation and Nuclear Norm Regularization for Multienergy Computed Tomography
- Exact Tensor Completion Using t-SVD
- Hankel Matrix Nuclear Norm Regularized Tensor Completion for $N$-dimensional Exponential Signals
- Tensor Decomposition for Signal Processing and Machine Learning
- Near-Optimal Bounds for Phase Synchronization
- Spectral Algorithms for Tensor Completion
- Sparse and Low-Rank Tensor Estimation via Cubic Sketchings
- Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization
- Inference and uncertainty quantification for noisy matrix completion
- Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview
- The non-convex geometry of low-rank matrix optimization
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- Matrix Completion From a Few Entries
- Third-Order Tensors as Operators on Matrices: A Theoretical and Computational Framework with Applications in Imaging
- Fundamental Conditions for Low-CP-Rank Tensor Completion
- Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors
- Robust Statistics for Signal Processing
- Most Tensor Problems Are NP-Hard
- Provable Sparse Tensor Decomposition
