Matthew Klug

Low-Rank Matrix Recovery from One-Bit Comparison Information

In this paper, we study the problem of low-rank matrix recovery based on the information obtained by comparing matrix entries (where each comparison is represented by one-bit) and not the entries themselves. This is highly relevant in the context of recommendation systems, due to the fact that users…