Matrix Completion From a Few Entries
From MaRDI portal
Publication:5281473
DOI10.1109/TIT.2010.2046205zbMath1366.62111WikidataQ63694325 ScholiaQ63694325MaRDI QIDQ5281473
Sewoong Oh, Raghunandan H. Keshavan, Andrea Montanari
Publication date: 27 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items
Matrix Completion Methods for Causal Panel Data Models, 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, Revisiting Landscape Analysis in Deep Neural Networks: Eliminating Decreasing Paths to Infinity, Iterative Collaborative Filtering for Sparse Matrix Estimation, Unnamed Item, Unnamed Item, Unnamed Item, A Nonlinear Matrix Decomposition for Mining the Zeros of Sparse Data, Nonconvex Low-Rank Tensor Completion from Noisy Data, GNMR: A Provable One-Line Algorithm for Low Rank Matrix Recovery, Modularity Maximization for Graphons, Solving orthogonal group synchronization via convex and low-rank optimization: tightness and landscape analysis, Recovery of low-rank matrices based on the rank null space properties, Color image inpainting based on low-rank quaternion matrix factorization, Detection thresholds in very sparse matrix completion, Learning Markov Models Via Low-Rank Optimization, Bayesian uncertainty quantification for low-rank matrix completion, Universal Features for High-Dimensional Learning and Inference, Covariate-assisted matrix completion with multiple structural breaks, On the second eigenvalue of random bipartite biregular graphs, Near-optimal bounds for generalized orthogonal Procrustes problem via generalized power method, Inference for low-rank models, Latent Space Model for Higher-Order Networks and Generalized Tensor Decomposition, Tractability from overparametrization: the example of the negative perceptron, An Equivalence between Critical Points for Rank Constraints Versus Low-Rank Factorizations, Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization, Matrix Denoising for Weighted Loss Functions and Heterogeneous Signals, Deterministic Tensor Completion with Hypergraph Expanders, An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity, Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization, Finding Low-Rank Solutions via Nonconvex Matrix Factorization, Efficiently and Provably, Unnamed Item, Blind Deconvolution by a Steepest Descent Algorithm on a Quotient Manifold, Low-Rank Matrix Estimation from Rank-One Projections by Unlifted Convex Optimization, Conformal symplectic and relativistic optimization, Approximate matrix completion based on cavity method, Heteroskedastic PCA: algorithm, optimality, and applications, A penalty method for rank minimization problems in symmetric matrices, Role of sparsity and structure in the optimization landscape of non-convex matrix sensing, Minimum \( n\)-rank approximation via iterative hard thresholding, Tight risk bound for high dimensional time series completion, Global optimality condition and fixed point continuation algorithm for non-Lipschitz \(\ell_p\) regularized matrix minimization, A graphical approach to the analysis of matrix completion, Parallel stochastic gradient algorithms for large-scale matrix completion, Low rank matrix recovery from rank one measurements, A Nonmonotone Alternating Updating Method for a Class of Matrix Factorization Problems, Unnamed Item, Asymmetry helps: eigenvalue and eigenvector analyses of asymmetrically perturbed low-rank matrices, Exact low-rank matrix completion from sparsely corrupted entries via adaptive outlier pursuit, Analytical convergence regions of accelerated gradient descent in nonconvex optimization under regularity condition, Seismic data reconstruction via weighted nuclear-norm minimization, Guarantees of Riemannian optimization for low rank matrix completion, Optimal prediction in the linearly transformed spiked model, Fast alternating linearization methods for minimizing the sum of two convex functions, An alternating minimization method for matrix completion problems, Finding one community in a sparse graph, Unnamed Item, Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution, Fundamental limits of weak recovery with applications to phase retrieval, Random perturbation of low rank matrices: improving classical bounds, A nonconvex approach to low-rank matrix completion using convex optimization, Synchronization problems in computer vision with closed-form solutions, Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval, First-order methods almost always avoid strict saddle points, Entrywise eigenvector analysis of random matrices with low expected rank, Two relaxation methods for rank minimization problems, Spectral norm bounds for block Markov chain random matrices, CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion, High-dimensional estimation with geometric constraints: Table 1., Low rank matrix completion by alternating steepest descent methods, T-product factorization based method for matrix and tensor completion problems, Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems, A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery, Recovering Structured Probability Matrices, Linear total variation approximate regularized nuclear norm optimization for matrix completion, Enhancing matrix completion using a modified second-order total variation, An introduction to a class of matrix cone programming, Median-Truncated Gradient Descent: A Robust and Scalable Nonconvex Approach for Signal Estimation, Cross: efficient low-rank tensor completion, Adaptive estimation of the sparsity in the Gaussian vector model, Stable rank-one matrix completion is solved by the level \(2\) Lasserre relaxation, Normal approximation and confidence region of singular subspaces, A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion, On the equivalence between low-rank matrix completion and tensor rank, Size biased couplings and the spectral gap for random regular graphs, Robust bilinear factorization with missing and grossly corrupted observations, The landscape of empirical risk for nonconvex losses, Matrix completion under interval uncertainty, Matrix recipes for hard thresholding methods, Convergence of projected Landweber iteration for matrix rank minimization, Equivalent Lipschitz surrogates for zero-norm and rank optimization problems, ELASTIC-NET REGULARIZATION FOR LOW-RANK MATRIX RECOVERY, On polynomial time methods for exact low-rank tensor completion, Unnamed Item, Unnamed Item, A proximal multiplier method for separable convex minimization, A geometric analysis of phase retrieval, Riemannian Preconditioning, Spectral Compressed Sensing via Projected Gradient Descent, Riemannian gradient descent methods for graph-regularized matrix completion, An efficient method for convex constrained rank minimization problems based on DC programming, Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach, Estimation in High Dimensions: A Geometric Perspective, Ranking recovery from limited pairwise comparisons using low-rank matrix completion, Robust principal component pursuit via inexact alternating minimization on matrix manifolds, Subspace estimation from unbalanced and incomplete data matrices: \({\ell_{2,\infty}}\) statistical guarantees, Flexible low-rank statistical modeling with missing data and side information, Matrix completion and tensor rank, Sparse random tensors: concentration, regularization and applications, Linear Models Based on Noisy Data and the Frisch Scheme, Community detection with dependent connectivity, Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data, Guarantees of Riemannian Optimization for Low Rank Matrix Recovery, Dynamic Assortment Personalization in High Dimensions, A gradient system for low rank matrix completion, Matrix completion for cost reduction in finite element simulations under hybrid uncertainties, Low-Rank Approximation and Completion of Positive Tensors, Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence, Toeplitz matrix completion via a low-rank approximation algorithm, Isolated calmness of solution mappings and exact recovery conditions for nuclear norm optimization problems, Efficient Matrix Sensing Using Rank-1 Gaussian Measurements, A Riemannian gossip approach to subspace learning on Grassmann manifold, Unnamed Item, Tensor Methods for Nonlinear Matrix Completion, Rank $2r$ Iterative Least Squares: Efficient Recovery of Ill-Conditioned Low Rank Matrices from Few Entries, Rapid, robust, and reliable blind deconvolution via nonconvex optimization, Typical and generic ranks in matrix completion, On the geometric analysis of a quartic-quadratic optimization problem under a spherical constraint, A \(p\)-spherical section property for matrix Schatten-\(p\) quasi-norm minimization, Riemannian conjugate gradient descent method for fixed multi rank third-order tensor completion, Unnamed Item, A non-convex algorithm framework based on DC programming and DCA for matrix completion, Unnamed Item, A mean value algorithm for Toeplitz matrix completion, Proof methods for robust low-rank matrix recovery, An alternating direction method with continuation for nonconvex low rank minimization
