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

TitleStatusHype
Graph-Based Matrix Completion Applied to Weather Data—0
Exploiting Observation Bias to Improve Matrix Completion—0
Efficient Alternating Minimization with Applications to Weighted Low Rank Approximation—0
One-sided Matrix Completion from Two Observations Per Row—0
Matrix Completion from General Deterministic Sampling Patterns—0
Combining Explicit and Implicit Regularization for Efficient Learning in Deep Networks—0
Gibbs-Duhem-Informed Neural Networks for Binary Activity Coefficient Prediction—0
Spectal Harmonics: Bridging Spectral Embedding and Matrix Completion in Self-Supervised Learning—0
Implicit bias of SGD in L_2-regularized linear DNNs: One-way jumps from high to low rank—0
Matrix Estimation for Offline Reinforcement Learning with Low-Rank Structure—0
Disjunctive Branch-And-Bound for Certifiably Optimal Low-Rank Matrix Completion—0
Matrix tri-factorization over the tropical semiringCode0
Rotation Synchronization via Deep Matrix FactorizationCode0
MISNN: Multiple Imputation via Semi-parametric Neural Networks—0
Quaternion Matrix Completion Using Untrained Quaternion Convolutional Neural Network for Color Image Inpainting—0
A Majorization-Minimization Gauss-Newton Method for 1-Bit Matrix Completion—0
Towards Addressing Training Data Scarcity Challenge in Emerging Radio Access Networks: A Survey and Framework—0
Sequence-aware item recommendations for multiply repeated user-item interactions—0
Region-wise matching for image inpainting based on adaptive weighted low-rank decomposition—0
Constructing High Frequency Economic Indicators by Imputation—0
Can Learning Be Explained By Local Optimality In Robust Low-rank Matrix Recovery?—0
Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time—0
Transductive Matrix Completion with Calibration for Multi-Task Learning—0
Netflix and Forget: Efficient and Exact Machine Unlearning from Bi-linear Recommendations—0
Graph Signal Sampling for Inductive One-Bit Matrix Completion: a Closed-form SolutionCode0
Show:102550
← PrevPage 6 of 32Next →

No leaderboard results yet.