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

TitleStatusHype
Phase transitions and sample complexity in Bayes-optimal matrix factorization0
Practical Matrix Completion and Corruption Recovery using Proximal Alternating Robust Subspace Minimization0
Probabilistic low-rank matrix completion on finite alphabets0
Probabilistic Low-Rank Matrix Completion with Adaptive Spectral Regularization Algorithms0
R3MC: A Riemannian three-factor algorithm for low-rank matrix completion0
Ranking Recovery from Limited Comparisons using Low-Rank Matrix Completion0
Reconstruction of Fragmented Trajectories of Collective Motion using Hadamard Deep Autoencoders0
Recovery of damped exponentials using structured low rank matrix completion0
Reflection Removal Using Low-Rank Matrix Completion0
Relaxed Leverage Sampling for Low-rank Matrix Completion0
Show:102550
← PrevPage 13 of 16Next →

No leaderboard results yet.