Guaranteed Matrix Completion via Non-Convex Factorization
From MaRDI portal
Publication:2976533
DOI10.1109/TIT.2016.2598574zbMath1359.94179arXiv1411.8003OpenAlexW2566608758MaRDI QIDQ2976533
Publication date: 28 April 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.8003
Related Items
The numerics of phase retrieval, Model-free Nonconvex Matrix Completion: Local Minima Analysis and Applications in Memory-efficient Kernel PCA, Sharp Restricted Isometry Bounds for the Inexistence of Spurious Local Minima in Nonconvex Matrix Recovery, Role of sparsity and structure in the optimization landscape of non-convex matrix sensing, A frequency-domain analysis of inexact gradient methods, Unnamed Item, Unnamed Item, A Nonmonotone Alternating Updating Method for a Class of Matrix Factorization Problems, Unnamed Item, Nonconvex Low-Rank Tensor Completion from Noisy Data, Column $\ell_{2,0}$-Norm Regularized Factorization Model of Low-Rank Matrix Recovery and Its Computation, GNMR: A Provable One-Line Algorithm for Low Rank Matrix Recovery, Sharp global convergence guarantees for iterative nonconvex optimization with random data, An upper bound on the minimum rank of a symmetric Toeplitz matrix completion problem, Unnamed Item, Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution, Convex and Nonconvex Optimization Are Both Minimax-Optimal for Noisy Blind Deconvolution Under Random Designs, Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval, Matrix completion with nonconvex regularization: spectral operators and scalable algorithms, Entrywise eigenvector analysis of random matrices with low expected rank, Affine matrix rank minimization problem via non-convex fraction function penalty, Inference for low-rank models, Performance bounds of the intensity-based estimators for noisy phase retrieval, A matrix nonconvex relaxation approach to unconstrained binary polynomial programs, Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems, Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization, A review on distance based time series classification, Robust principal component analysis using facial reduction, Median-Truncated Gradient Descent: A Robust and Scalable Nonconvex Approach for Signal Estimation, Unnamed Item, Analysis of biased stochastic gradient descent using sequential semidefinite programs, Unnamed Item, A geometric analysis of phase retrieval, Riemannian gradient descent methods for graph-regularized matrix completion, Quartic first-order methods for low-rank minimization, Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach, Subspace estimation from unbalanced and incomplete data matrices: \({\ell_{2,\infty}}\) statistical guarantees, Majorized proximal alternating imputation for regularized rank constrained matrix completion, Nonconvex Robust Low-Rank Matrix Recovery, Error bound of critical points and KL property of exponent 1/2 for squared F-norm regularized factorization, Matrix optimization over low-rank spectral sets: stationary points and local and global minimizers, Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data, Guarantees of Riemannian Optimization for Low Rank Matrix Recovery, On the Landscape of Synchronization Networks: A Perspective from Nonconvex Optimization, Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence, Blind Deconvolution by a Steepest Descent Algorithm on a Quotient Manifold, Matrix completion via minimizing an approximate rank, Rank $2r$ Iterative Least Squares: Efficient Recovery of Ill-Conditioned Low Rank Matrices from Few Entries, Unnamed Item, Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods, On the geometric analysis of a quartic-quadratic optimization problem under a spherical constraint, Low-Rank Matrix Estimation from Rank-One Projections by Unlifted Convex Optimization, Unnamed Item, Proof methods for robust low-rank matrix recovery, One-dimensional system arising in stochastic gradient descent, Suboptimal Local Minima Exist for Wide Neural Networks with Smooth Activations
