Search Results for author:
Found 2 papers, 2 papers with code
Inductive Matrix Completion: No Bad Local Minima and a Fast Algorithm
The inductive matrix completion (IMC) problem is to recover a low rank matrix from few observed entries while incorporating prior knowledge about its row and column subspaces.
GNMR: A provable one-line algorithm for low rank matrix recovery
Low rank matrix recovery problems, including matrix completion and matrix sensing, appear in a broad range of applications.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
