SOTAVerified

Matrix Completion

Matrix Completion is a method for recovering lost information. It originates from machine learning and usually deals with highly sparse matrices. Missing or unknown data is estimated using the low-rank matrix of the known data.

Source: A Fast Matrix-Completion-Based Approach for Recommendation Systems

Papers

Recently AddedMost HypedMost ActiveNeeds VerificationMost Verified

Showing 601–610 of 796 papers

TitleStatusHype
Fast Algorithms for Robust PCA via Gradient Descent—0
High resolution neural connectivity from incomplete tracing data using nonnegative spline regressionCode0
Matrix Completion has No Spurious Local Minimum—0
Riemannian stochastic variance reduced gradient on Grassmann manifoldCode0
A Riemannian gossip approach to decentralized matrix completion—0
Convergence Analysis for Rectangular Matrix Completion Using Burer-Monteiro Factorization and Gradient Descent—0
Sub-Gaussian estimators of the mean of a random matrix with heavy-tailed entries—0
A note on the statistical view of matrix completion—0
Dictionary Learning for Massive Matrix FactorizationCode0
Depth Image Inpainting: Improving Low Rank Matrix Completion with Low Gradient RegularizationCode0
Show:102550
← PrevPage 61 of 80Next →

No leaderboard results yet.