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

TitleStatusHype
Probabilistic low-rank matrix completion on finite alphabets0
Errata: Distant Supervision for Relation Extraction with Matrix Completion0
Ad Hoc Microphone Array Calibration: Euclidean Distance Matrix Completion Algorithm and Theoretical Guarantees0
Algebraic-Combinatorial Methods for Low-Rank Matrix Completion with Application to Athletic Performance Prediction0
Distant Supervision for Relation Extraction with Matrix CompletionCode0
Depth Enhancement via Low-rank Matrix Completion0
Advancing Matrix Completion by Modeling Extra Structures beyond Low-Rankness0
Orthogonal Rank-One Matrix Pursuit for Low Rank Matrix CompletionCode0
Universal Matrix Completion0
Phase transitions and sample complexity in Bayes-optimal matrix factorization0
Show:102550
← PrevPage 14 of 16Next →

No leaderboard results yet.