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

TitleStatusHype
Advancing Matrix Completion by Modeling Extra Structures beyond Low-Rankness—0
A new accelerated gradient method inspired by continuous-time perspective—0
A New Retraction for Accelerating the Riemannian Three-Factor Low-Rank Matrix Completion Algorithm—0
A New Theory for Matrix Completion—0
Adversarial Robust Low Rank Matrix Estimation: Compressed Sensing and Matrix Completion—0
Low-rank matrix completion theory via Plucker coordinates—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
A framework to generate sparsity-inducing regularizers for enhanced low-rank matrix completion—0
Annotation Projection-based Representation Learning for Cross-lingual Dependency Parsing—0
A Non-convex One-Pass Framework for Generalized Factorization Machine and Rank-One Matrix Sensing—0
A Non-monotone Alternating Updating Method for A Class of Matrix Factorization Problems—0
A Block Lanczos with Warm Start Technique for Accelerating Nuclear Norm Minimization Algorithms—0
Asymptotic Convergence Rate of Alternating Minimization for Rank One Matrix Completion—0
A Unified Computational and Statistical Framework for Nonconvex Low-Rank Matrix Estimation—0
Convergence of the majorized PAM method with subspace correction for low-rank composite factorization model—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
A majorization-minimization algorithm for nonnegative binary matrix factorization—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
AltGDmin: Alternating GD and Minimization for Partly-Decoupled (Federated) Optimization—0
Alternating Iteratively Reweighted Minimization Algorithms for Low-Rank Matrix Factorization—0
Ad Hoc Microphone Array Calibration: Euclidean Distance Matrix Completion Algorithm and Theoretical Guarantees—0
Show:102550
← PrevPage 3 of 32Next →

No leaderboard results yet.