Inductive Matrix Completion

Fast and Sample Efficient Inductive Matrix Completion via Multi-Phase Procrustes Flow
We present a new gradient-based optimization algorithm for inductive matrix completion, which achieves both linear rate of convengence and sample complexities linearly depending on the feature dimension.
Xiao Zhang, Simon Du, Quanquan Gu
PDF Cite Code Poster ArXiv Link
Fast and Sample Efficient Inductive Matrix Completion via Multi-Phase Procrustes Flow