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

TitleStatusHype
A Gradient Descent Algorithm on the Grassman Manifold for Matrix CompletionCode0
Distant Supervision for Relation Extraction with Matrix CompletionCode0
Collaborative Filtering with Graph Information: Consistency and Scalable MethodsCode0
Adaptive Matrix Completion for the Users and the Items in TailCode0
Algebraic Variety Models for High-Rank Matrix CompletionCode0
Mixed Membership Graph Clustering via Systematic Edge QueryCode0
Efficient and Robust Freeway Traffic Speed Estimation under Oblique Grid using Vehicle Trajectory DataCode0
Spectal Harmonics: Bridging Spectral Embedding and Matrix Completion in Self-Supervised Learning0
A Majorization-Minimization Gauss-Newton Method for 1-Bit Matrix Completion0
Bounded Manifold Completion0
Show:102550
← PrevPage 3 of 16Next →

No leaderboard results yet.