-
Matrix Completion using SGD
The dataset used in the paper is a matrix completion problem, where the goal is to predict missing entries in a matrix based on known entries. -
Provable Low Rank Plus Sparse Matrix Separation Via Nonconvex Regularizers
This paper considers a large class of problems where we seek to recover a low rank matrix and/or sparse vector from some set of measurements. -
Inductive Matrix Completion Using Graph Autoencoder
Matrix completion has been formulated as the link prediction problem on a bipartite user-item graph in recent GNN-based matrix completion methods.
