We consider the problem of noisy 1-bit matrix completion under an exact rank
constraint on the true underlying matrix $M^*$. Instead of observing a subset
of the noisy continuous-valued entries of a matrix $M^*$, we observe a subset
of noisy 1-bit (or binary) measurements generated acc