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

TitleStatusHype
Representation learning of drug and disease terms for drug repositioning—0
RGNMR: A Gauss-Newton method for robust matrix completion with theoretical guarantees—0
Riemannian Optimization for Non-convex Euclidean Distance Geometry with Global Recovery Guarantees—0
Riemannian Perspective on Matrix Factorization—0
Riemannian Stochastic Proximal Gradient Methods for Nonsmooth Optimization over the Stiefel Manifold—0
Riemannian stochastic quasi-Newton algorithm with variance reduction and its convergence analysis—0
Truncated Nuclear Norm Minimization for Image Restoration Based On Iterative Support Detection—0
Two-snapshot DOA Estimation via Hankel-structured Matrix Completion—0
Robust Egoistic Rigid Body Localization—0
Robust Low-rank Matrix Completion via an Alternating Manifold Proximal Gradient Continuation Method—0
Robust Low-Rank Matrix Completion via a New Sparsity-Inducing Regularizer—0
Uncertainty Quantification For Low-Rank Matrix Completion With Heterogeneous and Sub-Exponential Noise—0
Robust Matrix Completion State Estimation in Distribution Systems—0
Robust matrix completion via Novel M-estimator Functions—0
Robust Matrix Completion with Heavy-tailed Noise—0
Robust Matrix Completion with Mixed Data Types—0
On Robust Mean Estimation under Coordinate-level Corruption—0
Understanding Alternating Minimization for Matrix Completion—0
Robust Spectral Compressed Sensing via Structured Matrix Completion—0
Robust Spectral Detection of Global Structures in the Data by Learning a Regularization—0
Robust Task Clustering for Deep Many-Task Learning—0
Unified View of Matrix Completion under General Structural Constraints—0
RTRMC: A Riemannian trust-region method for low-rank matrix completion—0
ACCAMS: Additive Co-Clustering to Approximate Matrices Succinctly—0
SAR: Semantic Analysis for Recommendation—0
Show:102550
← PrevPage 27 of 32Next →

No leaderboard results yet.