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

TitleStatusHype
RTRMC: A Riemannian trust-region method for low-rank matrix completion0
Scaled Gradients on Grassmann Manifolds for Matrix Completion0
Scaled stochastic gradient descent for low-rank matrix completion0
Secrets of Matrix Factorization: Approximations, Numerics, Manifold Optimization and Random Restarts0
Solving Uncalibrated Photometric Stereo Using Fewer Images by Jointly Optimizing Low-rank Matrix Completion and Integrability0
Sparse Array Beamformer Design for Active and Passive Sensing0
Sparse Group Inductive Matrix Completion0
Static and Dynamic Robust PCA and Matrix Completion: A Review0
Structured low-rank matrix completion for forecasting in time series analysis0
Structure-Preserving Progressive Low-rank Image Completion for Defending Adversarial Attacks0
Show:102550
← PrevPage 12 of 16Next →

No leaderboard results yet.