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

TitleStatusHype
Extended Gauss-Newton and ADMM-Gauss-Newton Algorithms for Low-Rank Matrix Optimization—0
Factor Group-Sparse Regularization for Efficient Low-Rank Matrix Recovery—0
Factorization Approach for Low-complexity Matrix Completion Problems: Exponential Number of Spurious Solutions and Failure of Gradient Methods—0
Factorizing LambdaMART for cold start recommendations—0
Deep Learning Approach for Matrix Completion Using Manifold Learning—0
Deep learned SVT: Unrolling singular value thresholding to obtain better MSE—0
Autoencoder-based Graph Construction for Semi-supervised Learning—0
A Majorization-Minimization Gauss-Newton Method for 1-Bit Matrix Completion—0
Adjusting Leverage Scores by Row Weighting: A Practical Approach to Coherent Matrix Completion—0
DeepHand: Robust Hand Pose Estimation by Completing a Matrix Imputed With Deep Features—0
A Unified Framework for Structured Low-rank Matrix Learning—0
Deep geometric matrix completion: Are we doing it right?—0
A Unified Framework for Sparse Relaxed Regularized Regression: SR3—0
A majorization-minimization algorithm for nonnegative binary matrix factorization—0
A Unified Convex Surrogate for the Schatten-p Norm—0
Decentralized Singular Value Decomposition for Large-scale Distributed Sensor Networks—0
Decentralized Frank-Wolfe Algorithm for Convex and Non-convex Problems—0
A Unified Computational and Statistical Framework for Nonconvex Low-Rank Matrix Estimation—0
Always Valid Risk Monitoring for Online Matrix Completion—0
A divide-and-conquer algorithm for binary matrix completion—0
Accelerating Permutation Testing in Voxel-wise Analysis through Subspace Tracking: A new plugin for SnPM—0
Data-driven model selection within the matrix completion method for causal panel data models—0
Data-based system representations from irregularly measured data—0
A two-dimensional decomposition approach for matrix completion through gossip—0
CUR Algorithm with Incomplete Matrix Observation—0
Show:102550
← PrevPage 11 of 32Next →

No leaderboard results yet.