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

TitleStatusHype
Low-Rank Hankel Tensor Completion for Traffic Speed EstimationCode0
Low-Rank Inducing Norms with Optimality InterpretationsCode0
Adaptive Matrix Completion for the Users and the Items in TailCode0
Bayesian Matrix Completion via Adaptive Relaxed Spectral RegularizationCode0
A Neural Network for SemigroupsCode0
Matrix Completion from Noisy EntriesCode0
Collaborative Filtering with Graph Information: Consistency and Scalable MethodsCode0
Matrix Completion via Nonconvex Regularization: Convergence of the Proximal Gradient AlgorithmCode0
Causal Inference with Noisy and Missing Covariates via Matrix FactorizationCode0
A Generalized Latent Factor Model Approach to Mixed-data Matrix Completion with Entrywise ConsistencyCode0
Show:102550
← PrevPage 11 of 80Next →

No leaderboard results yet.