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 5160 of 796 papers

TitleStatusHype
Doubly robust nearest neighbors in factor modelsCode0
A Neural Network for SemigroupsCode0
Adversarially-Trained Nonnegative Matrix FactorizationCode0
Dictionary Learning for Massive Matrix FactorizationCode0
Fast Low-Rank Matrix Learning with Nonconvex RegularizationCode0
Counterfactual inference for sequential experimentsCode0
Efficient Model-Based Collaborative Filtering with Fast Adaptive PCACode0
An extrapolated and provably convergent algorithm for nonlinear matrix decomposition with the ReLU functionCode0
An Inertial Block Majorization Minimization Framework for Nonsmooth Nonconvex OptimizationCode0
Contrastive Matrix Completion with Denoising and Augmented Graph Views for Robust RecommendationCode0
Show:102550
← PrevPage 6 of 80Next →

No leaderboard results yet.