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 11–20 of 796 papers

TitleStatusHype
A Scalable Second Order Method for Ill-Conditioned Matrix Completion from Few SamplesCode1
Escaping Saddle Points in Ill-Conditioned Matrix Completion with a Scalable Second Order MethodCode1
Geometric Matrix Completion with Recurrent Multi-Graph Neural NetworksCode1
GLocal-K: Global and Local Kernels for Recommender SystemsCode1
Deep Generalization of Structured Low-Rank Algorithms (Deep-SLR)Code1
Causal Matrix CompletionCode1
Adversarial Crowdsourcing Through Robust Rank-One Matrix CompletionCode1
Compressible Dynamics in Deep Overparameterized Low-Rank Learning & AdaptationCode1
Accelerating Ill-Conditioned Low-Rank Matrix Estimation via Scaled Gradient DescentCode1
Indiscriminate Poisoning Attacks on Unsupervised Contrastive LearningCode1
Show:102550
← PrevPage 2 of 80Next →

No leaderboard results yet.