Hanchi Huang

Scalable and Explainable 1-Bit Matrix Completion via Graph Signal Learning

One-bit matrix completion is an important class of positive-unlabeled (PU) learning problems where the observations consist of only positive examples, e.g., in top-N recommender systems. For the first time, we show that 1-bit matrix completion can be formulated as the problem of recovering clean gra…