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

TitleStatusHype
Guaranteed Rank Minimization via Singular Value ProjectionCode0
High resolution neural connectivity from incomplete tracing data using nonnegative spline regressionCode0
Collaborative Filtering with Graph Information: Consistency and Scalable MethodsCode0
Implicit Regularization in Deep Learning May Not Be Explainable by NormsCode0
A Gradient Descent Algorithm on the Grassman Manifold for Matrix CompletionCode0
Balancing Molecular Information and Empirical Data in the Prediction of Physico-Chemical PropertiesCode0
Collective Matrix CompletionCode0
A Perturbation Bound on the Subspace Estimator from Canonical ProjectionsCode0
Adaptive Matrix Completion for the Users and the Items in TailCode0
CayleyNets: Graph Convolutional Neural Networks with Complex Rational Spectral FiltersCode0
Show:102550
← PrevPage 10 of 80Next →

No leaderboard results yet.