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

TitleStatusHype
Matrix Completion from a Few EntriesCode0
Bayesian Matrix Completion via Adaptive Relaxed Spectral RegularizationCode0
Missing Not at Random in Matrix Completion: The Effectiveness of Estimating Missingness Probabilities Under a Low Nuclear Norm AssumptionCode0
Inductive Matrix Completion: No Bad Local Minima and a Fast AlgorithmCode0
Bayesian graph convolutional neural networks for semi-supervised classificationCode0
WARPd: A linearly convergent first-order method for inverse problems with approximate sharpness conditionsCode0
Balancing Molecular Information and Empirical Data in the Prediction of Physico-Chemical PropertiesCode0
Projected Gradient Descent for Spectral Compressed Sensing via Symmetric Hankel FactorizationCode0
Matrix Completion from Noisy EntriesCode0
Mixed Membership Graph Clustering via Systematic Edge QueryCode0
Fast and Sample Efficient Inductive Matrix Completion via Multi-Phase Procrustes FlowCode0
Provable Subspace Tracking from Missing Data and Matrix CompletionCode0
Interference-Aware Edge Runtime Prediction with Conformal Matrix CompletionCode0
Robust Matrix Completion for Discrete Rating-Scale DataCode0
Faster Matrix Completion Using Randomized SVDCode0
Faster One-Sample Stochastic Conditional Gradient Method for Composite Convex MinimizationCode0
Structured Learning of Compositional Sequential InterventionsCode0
Structured Low-Rank Algorithms: Theory, MR Applications, and Links to Machine LearningCode0
Simulation comparisons between Bayesian and de-biased estimators in low-rank matrix completionCode0
A regularized deep matrix factorized model of matrix completion for image restorationCode0
Fast Low-Rank Matrix Learning with Nonconvex RegularizationCode0
A Neural Network for SemigroupsCode0
Matrix Completion in the Unit Hypercube via Structured Matrix FactorizationCode0
Unlabeled Principal Component Analysis and Matrix CompletionCode0
Matrix Completion on GraphsCode0
Song Recommendation with Non-Negative Matrix Factorization and Graph Total VariationCode0
Multiple Imputation with Neural Network Gaussian Process for High-dimensional Incomplete DataCode0
Adaptive Matrix Completion for the Users and the Items in TailCode0
Robust PCA via Outlier PursuitCode0
Orthogonal Rank-One Matrix Pursuit for Low Rank Matrix CompletionCode0
Matrix Completion via Nonconvex Regularization: Convergence of the Proximal Gradient AlgorithmCode0
Outlier-robust sparse/low-rank least-squares regression and robust matrix completionCode0
Forecasting Algorithms for Causal Inference with Panel DataCode0
Unsupervised Metric Learning in Presence of Missing DataCode0
Proximal Interacting Particle Langevin AlgorithmsCode0
Sequence-Aware Recommender SystemsCode0
An extrapolated and provably convergent algorithm for nonlinear matrix decomposition with the ReLU functionCode0
Matrix Completion with Cross-Concentrated Sampling: Bridging Uniform Sampling and CUR SamplingCode0
Online Identification and Tracking of Subspaces from Highly Incomplete InformationCode0
A Perturbation Bound on the Subspace Estimator from Canonical ProjectionsCode0
Partial Trace Regression and Low-Rank Kraus DecompositionCode0
Collective Matrix CompletionCode0
Generalizing to Unseen Entities and Entity Pairs with Row-less Universal SchemaCode0
SweetRS: Dataset for a recommender systems of sweetsCode0
Geometric Matrix Completion: A Functional ViewCode0
Rotation Synchronization via Deep Matrix FactorizationCode0
Show:102550
← PrevPage 16 of 16Next →

No leaderboard results yet.