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

Showing 631640 of 796 papers

TitleStatusHype
Fast Optimization Algorithm on Riemannian Manifolds and Its Application in Low-Rank Representation0
Bayesian Matrix Completion via Adaptive Relaxed Spectral RegularizationCode0
Fast Low-Rank Matrix Learning with Nonconvex RegularizationCode0
Collaborative Filtering with Graph Information: Consistency and Scalable MethodsCode0
Recognizing retinal ganglion cells in the dark0
Matrix Completion with Noisy Side Information0
Secrets of Matrix Factorization: Approximations, Numerics, Manifold Optimization and Random Restarts0
Taming the Wild: A Unified Analysis of Hogwild-Style Algorithms0
An Extended Frank-Wolfe Method with "In-Face" Directions, and its Application to Low-Rank Matrix Completion0
Decomposition into Low-rank plus Additive Matrices for Background/Foreground Separation: A Review for a Comparative Evaluation with a Large-Scale DatasetCode0
Show:102550
← PrevPage 64 of 80Next →

No leaderboard results yet.