Optimal Statistical and Computational Rates for One Bit Matrix Completion

Renkun Ni, Quanquan Gu

Abstract: We consider one bit matrix completion under rank constraint. We present an estimator based on rank constrained maximum likelihood estimation, and an efficient greedy algorithm to solve it approxima...