Matrix Completion From a Few Entries

DOI10.1109/TIT.2010.2046205zbMATH Open1366.62111WikidataQ63694325 ScholiaQ63694325MaRDI QIDQ5281473FDOQ5281473

Authors: Raghunandan H. Keshavan, Sewoong Oh, Andrea Montanari 

Publication date: 27 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Recommendations

• Matrix completion from noisy entries
• Matrix completion problems
• Some matrix completion problems
• Matrix completion problems with arbitrary locations of prescribed entries
• Matrix completion via minimizing an approximate rank
• Some empirical advances in matrix completion
• A simpler approach to matrix completion
• Matrix Completion under Low-Rank Missing Mechanism
• A note on matrix completion problems
• On a Class of Matrix Completion Problems

Mathematics Subject Classification ID

Estimation in multivariate analysis (62H12) Random graphs (graph-theoretic aspects) (05C80)

Cited In (only showing first 100 items - show all)

• Finding low-rank solutions of sparse linear matrix inequalities using convex optimization
• An alternating direction method with continuation for nonconvex low rank minimization
• Spectral Compressed Sensing via Projected Gradient Descent
• Linear total variation approximate regularized nuclear norm optimization for matrix completion
• Enhancing matrix completion using a modified second-order total variation
• Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval
• A non-convex algorithm framework based on DC programming and DCA for matrix completion
• A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery
• Typical and generic ranks in matrix completion
• Conformal symplectic and relativistic optimization
• Guarantees of Riemannian optimization for low rank matrix recovery
• First-order methods almost always avoid strict saddle points
• Toeplitz matrix completion via a low-rank approximation algorithm
• Flexible low-rank statistical modeling with missing data and side information
• On polynomial time methods for exact low-rank tensor completion
• Matrix completion from noisy entries
• Robust bilinear factorization with missing and grossly corrupted observations
• Stable rank-one matrix completion is solved by the level \(2\) Lasserre relaxation
• Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence
• A penalty method for rank minimization problems in symmetric matrices
• Title not available (Why is that?)
• Universal latent space model fitting for large networks with edge covariates
• Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution
• Finding low-rank solutions via nonconvex matrix factorization, efficiently and provably
• Learning Markov models via low-rank optimization
• Noisy matrix completion: understanding statistical guarantees for convex relaxation via nonconvex optimization
• A proximal multiplier method for separable convex minimization
• A nonmonotone alternating updating method for a class of matrix factorization problems
• A mean value algorithm for Toeplitz matrix completion
• Low-rank approximation and completion of positive tensors
• Fundamental limits of weak recovery with applications to phase retrieval
• Matrix completion under interval uncertainty
• Entrywise eigenvector analysis of random matrices with low expected rank
• Spectral norm bounds for block Markov chain random matrices
• Parallel stochastic gradient algorithms for large-scale matrix completion
• A geometric analysis of phase retrieval
• Minimum \( n\)-rank approximation via iterative hard thresholding
• Modularity Maximization for Graphons
• Equivalent Lipschitz surrogates for zero-norm and rank optimization problems
• Non-convex matrix completion and related problems via strong duality
• Matrix completion and related problems via strong duality
• Riemannian gradient descent methods for graph-regularized matrix completion
• Rapid, robust, and reliable blind deconvolution via nonconvex optimization
• Global optimality condition and fixed point continuation algorithm for non-Lipschitz \(\ell_p\) regularized matrix minimization
• A gradient system for low rank matrix completion
• Learning from comparisons and choices
• Inference for low-rank models
• An ADMM-factorization algorithm for low rank matrix completion
• An efficient method for convex constrained rank minimization problems based on DC programming
• A graphical approach to the analysis of matrix completion
• Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems
• On the second eigenvalue of random bipartite biregular graphs
• Seismic data reconstruction via weighted nuclear-norm minimization
• Low-Rank Matrix Estimation from Rank-One Projections by Unlifted Convex Optimization
• Low rank matrix completion by alternating steepest descent methods
• Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data
• Low rank matrix recovery from rank one measurements
• Recovery of low-rank matrices based on the rank null space properties
• A nonconvex approach to low-rank matrix completion using convex optimization.
• Random perturbation of low rank matrices: improving classical bounds
• Matrix recipes for hard thresholding methods
• Fast alternating linearization methods for minimizing the sum of two convex functions
• Robust principal component pursuit via inexact alternating minimization on matrix manifolds
• An alternating minimization method for matrix completion problems
• CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
• Exact low-rank matrix completion from sparsely corrupted entries via adaptive outlier pursuit
• The landscape of empirical risk for nonconvex losses
• Size biased couplings and the spectral gap for random regular graphs
• Detection thresholds in very sparse matrix completion
• Estimation in high dimensions: a geometric perspective
• High-dimensional estimation with geometric constraints
• Cross: efficient low-rank tensor completion
• An introduction to a class of matrix cone programming
• Proof methods for robust low-rank matrix recovery
• Adaptive estimation of the sparsity in the Gaussian vector model
• Finding one community in a sparse graph
• Tensor methods for nonlinear matrix completion
• Title not available (Why is that?)
• Matrix Completion Methods for Causal Panel Data Models
• Matrix denoising for weighted loss functions and heterogeneous signals
• On the equivalence between low-rank matrix completion and tensor rank
• Isolated calmness of solution mappings and exact recovery conditions for nuclear norm optimization problems
• A \(p\)-spherical section property for matrix Schatten-\(p\) quasi-norm minimization
• Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach
• Title not available (Why is that?)
• Riemannian preconditioning
• Sharp restricted isometry bounds for the inexistence of spurious local minima in nonconvex matrix recovery
• Rank $2r$ Iterative Least Squares: Efficient Recovery of Ill-Conditioned Low Rank Matrices from Few Entries
• A nonlinear matrix decomposition for mining the zeros of sparse data
• Normal approximation and confidence region of singular subspaces
• Dynamic assortment personalization in high dimensions
• Role of sparsity and structure in the optimization landscape of non-convex matrix sensing
• Tight risk bound for high dimensional time series completion
• Near-optimal bounds for generalized orthogonal Procrustes problem via generalized power method
• Matrix completion from a computational statistics perspective
• Convergence of projected Landweber iteration for matrix rank minimization
• GNMR: a provable one-line algorithm for low rank matrix recovery
• Elastic-net regularization for low-rank matrix recovery
• Efficient matrix sensing using rank-1 Gaussian measurements
• Latent Space Model for Higher-Order Networks and Generalized Tensor Decomposition

This page was built for publication: Matrix Completion From a Few Entries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281473)