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 151–175 of 796 papers

TitleStatusHype
A Non-convex One-Pass Framework for Generalized Factorization Machine and Rank-One Matrix Sensing—0
A General Framework for Fast Stagewise Algorithms—0
Annotation Projection-based Representation Learning for Cross-lingual Dependency Parsing—0
Causal Inference with Corrupted Data: Measurement Error, Missing Values, Discretization, and Differential Privacy—0
Causal Imputation for Counterfactual SCMs: Bridging Graphs and Latent Factor Models—0
A framework to generate sparsity-inducing regularizers for enhanced low-rank matrix completion—0
Active Feature Acquisition with Supervised Matrix Completion—0
Categorical Matrix Completion—0
Calibrated Elastic Regularization in Matrix Completion—0
Spectal Harmonics: Bridging Spectral Embedding and Matrix Completion in Self-Supervised Learning—0
An Extended Frank-Wolfe Method with "In-Face" Directions, and its Application to Low-Rank Matrix Completion—0
A Fast Matrix-Completion-Based Approach for Recommendation Systems—0
Bounded Manifold Completion—0
Low-rank matrix completion theory via Plucker coordinates—0
Boolean Matrix Factorization and Noisy Completion via Message Passing—0
Blocked Collaborative Bandits: Online Collaborative Filtering with Per-Item Budget Constraints—0
Adversarial Robust Low Rank Matrix Estimation: Compressed Sensing and Matrix Completion—0
A Comparison of Clustering and Missing Data Methods for Health Sciences—0
Abrupt Learning in Transformers: A Case Study on Matrix Completion—0
BlockEcho: Retaining Long-Range Dependencies for Imputing Block-Wise Missing Data—0
Blind Regression: Nonparametric Regression for Latent Variable Models via Collaborative Filtering—0
A New Theory for Matrix Completion—0
Binary matrix completion with nonconvex regularizers—0
Binary Matrix Completion Using Unobserved Entries—0
A New Retraction for Accelerating the Riemannian Three-Factor Low-Rank Matrix Completion Algorithm—0
Show:102550
← PrevPage 7 of 32Next →

No leaderboard results yet.