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 351–375 of 796 papers

TitleStatusHype
Dropout: Explicit Forms and Capacity Control—0
On the simplicity and conditioning of low rank semidefinite programs—0
Online high rank matrix completion—0
Results on the algebraic matroid of the determinantal variety—0
On Robust Mean Estimation under Coordinate-level Corruption—0
Optimal Exact Matrix Completion Under new Parametrization—0
On the Convergence of Stochastic Gradient Descent with Low-Rank Projections for Convex Low-Rank Matrix Problems—0
Machine Learning in Thermodynamics: Prediction of Activity Coefficients by Matrix Completion—0
Nonlinear Traffic Prediction as a Matrix Completion Problem with Ensemble Learning—0
Solving Cold Start Problem in Recommendation with Attribute Graph Neural Networks—0
Bounded Manifold Completion—0
Polynomial Matrix Completion for Missing Data Imputation and Transductive Learning—0
Balancing Accuracy and Diversity in Recommendations using Matrix Completion Framework—0
Influenza Modeling Based on Massive Feature Engineering and International Flow Deconvolution—0
Community Detection and Matrix Completion with Social and Item Similarity Graphs—0
A Fast Matrix-Completion-Based Approach for Recommendation Systems—0
Provable Non-linear Inductive Matrix Completion—0
Matrix Completion using Kronecker Product Approximation—0
Spectral Geometric Matrix CompletionCode0
Factor Group-Sparse Regularization for Efficient Low-Rank Matrix Recovery—0
Intelligent Reflecting Surface for Massive Device Connectivity: Joint Activity Detection and Channel Estimation—0
Missing Not at Random in Matrix Completion: The Effectiveness of Estimating Missingness Probabilities Under a Low Nuclear Norm AssumptionCode0
Structured Low-Rank Algorithms: Theory, MR Applications, and Links to Machine LearningCode0
Bayesian Graph Convolutional Neural Networks Using Non-Parametric Graph Learning—0
Fast Exact Matrix Completion: A Unified Optimization Framework for Matrix Completion—0
Show:102550
← PrevPage 15 of 32Next →

No leaderboard results yet.