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

TitleStatusHype
Algebraic Variety Models for High-Rank Matrix CompletionCode0
Distant Supervision for Relation Extraction with Matrix CompletionCode0
CayleyNets: Graph Convolutional Neural Networks with Complex Rational Spectral FiltersCode0
Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient DescentCode0
Estimating Missing Data in Temporal Data Streams Using Multi-directional Recurrent Neural NetworksCode0
Fast and Sample Efficient Inductive Matrix Completion via Multi-Phase Procrustes FlowCode0
A Perturbation Bound on the Subspace Estimator from Canonical ProjectionsCode0
Adaptive Matrix Completion for the Users and the Items in TailCode0
Causal Inference with Noisy and Missing Covariates via Matrix FactorizationCode0
Collaborative Filtering with Graph Information: Consistency and Scalable MethodsCode0
Show:102550
← PrevPage 9 of 80Next →

No leaderboard results yet.