SOTAVerified

Low-Rank Matrix Completion

Low-Rank Matrix Completion is an important problem with several applications in areas such as recommendation systems, sketching, and quantum tomography. The goal in matrix completion is to recover a low rank matrix, given a small number of entries of the matrix.

Source: Universal Matrix Completion

Papers

Recently AddedMost HypedMost ActiveNeeds VerificationMost Verified

Showing 51–60 of 158 papers

TitleStatusHype
Efficiently escaping saddle points on manifolds—0
Communication Efficient Parallel Algorithms for Optimization on Manifolds—0
Entry-Specific Bounds for Low-Rank Matrix Completion under Highly Non-Uniform Sampling—0
Errata: Distant Supervision for Relation Extraction with Matrix Completion—0
Error-Minimizing Estimates and Universal Entry-Wise Error Bounds for Low-Rank Matrix Completion—0
Relative Error Bound Analysis for Nuclear Norm Regularized Matrix Completion—0
Exact Linear Convergence Rate Analysis for Low-Rank Symmetric Matrix Completion via Gradient Descent—0
Exact Reconstruction of Euclidean Distance Geometry Problem Using Low-rank Matrix Completion—0
Factor Group-Sparse Regularization for Efficient Low-Rank Matrix Recovery—0
Adjusting Leverage Scores by Row Weighting: A Practical Approach to Coherent Matrix Completion—0
Show:102550
← PrevPage 6 of 16Next →

No leaderboard results yet.