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 361–370 of 796 papers

TitleStatusHype
L_2,1-Norm Regularized Quaternion Matrix Completion Using Sparse Representation and Quaternion QR Decomposition—0
Large-Scale Low-Rank Matrix Learning with Nonconvex Regularizers—0
Global Convergence of Stochastic Gradient Descent for Some Non-convex Matrix Problems—0
Large-Scale Sparse Inverse Covariance Estimation via Thresholding and Max-Det Matrix Completion—0
Latent Variable Models for Predicting File Dependencies in Large-Scale Software Development—0
Learning Counterfactual Distributions via Kernel Nearest Neighbors—0
Learning from Ambiguously Labeled Face Images—0
Learning Iterative Reasoning through Energy Diffusion—0
Learning Latent Features with Pairwise Penalties in Low-Rank Matrix Completion—0
Global Convergence of Gradient Descent for Asymmetric Low-Rank Matrix Factorization—0
Show:102550
← PrevPage 37 of 80Next →

No leaderboard results yet.