Search Results for author:
Found 1 papers, 0 papers with code
1-Bit Matrix Completion under Exact Low-Rank Constraint
We consider the problem of noisy 1-bit matrix completion under an exact rank constraint on the true underlying matrix $M^*$.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
