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 1120 of 158 papers

TitleStatusHype
Guaranteed Rank Minimization via Singular Value ProjectionCode0
Algebraic Variety Models for High-Rank Matrix CompletionCode0
GNMR: A provable one-line algorithm for low rank matrix recoveryCode0
A Gradient Descent Algorithm on the Grassman Manifold for Matrix CompletionCode0
Efficient and Robust Freeway Traffic Speed Estimation under Oblique Grid using Vehicle Trajectory DataCode0
Efficient Compression of Overparameterized Deep Models through Low-Dimensional Learning DynamicsCode0
Depth Image Inpainting: Improving Low Rank Matrix Completion with Low Gradient RegularizationCode0
Adaptive Matrix Completion for the Users and the Items in TailCode0
Collaborative Filtering with Graph Information: Consistency and Scalable MethodsCode0
Distant Supervision for Relation Extraction with Matrix CompletionCode0
Show:102550
← PrevPage 2 of 16Next →

No leaderboard results yet.