SOTAVerified

Low-Rank Matrix Completion

Low-Rank Matrix Completion is an important problem with several applications in areas such as recommendation systems, sketching, and quantum tomography. The goal in matrix completion is to recover a low rank matrix, given a small number of entries of the matrix.

Source: Universal Matrix Completion

Papers

Showing 7180 of 158 papers

TitleStatusHype
Bounded Manifold Completion0
Deep Generalization of Structured Low-Rank Algorithms (Deep-SLR)Code1
Factor Group-Sparse Regularization for Efficient Low-Rank Matrix Recovery0
Structured Low-Rank Algorithms: Theory, MR Applications, and Links to Machine LearningCode0
The Sparse Reverse of Principal Component Analysis for Fast Low-Rank Matrix Completion0
Low-rank matrix completion and denoising under Poisson noise0
A divide-and-conquer algorithm for binary matrix completion0
Depth Restoration: A fast low-rank matrix completion via dual-graph regularization0
Efficiently escaping saddle points on manifolds0
Guaranteed Matrix Completion Under Multiple Linear Transformations0
Show:102550
← PrevPage 8 of 16Next →

No leaderboard results yet.