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 591–600 of 796 papers

TitleStatusHype
Online Policy Learning and Inference by Matrix Completion—0
Online Variational Bayesian Subspace Filtering with Applications—0
On Tensor Completion via Nuclear Norm Minimization—0
On the Convergence of Stochastic Gradient Descent with Low-Rank Projections for Convex Low-Rank Matrix Problems—0
On the convex geometry of blind deconvolution and matrix completion—0
On the Fundamental Limits of Matrix Completion: Leveraging Hierarchical Similarity Graphs—0
On the Optimality of Nuclear-norm-based Matrix Completion for Problems with Smooth Non-linear Structure—0
Can Learning Be Explained By Local Optimality In Robust Low-rank Matrix Recovery?—0
On the Power of Adaptivity in Matrix Completion and Approximation—0
On the Power of Truncated SVD for General High-rank Matrix Estimation Problems—0
Show:102550
← PrevPage 60 of 80Next →

No leaderboard results yet.