PU Learning for Matrix Completion

11/22/2014
by   Cho-Jui Hsieh, et al.
0

In this paper, we consider the matrix completion problem when the observations are one-bit measurements of some underlying matrix M, and in particular the observed samples consist only of ones and no zeros. This problem is motivated by modern applications such as recommender systems and social networks where only "likes" or "friendships" are observed. The problem of learning from only positive and unlabeled examples, called PU (positive-unlabeled) learning, has been studied in the context of binary classification. We consider the PU matrix completion problem, where an underlying real-valued matrix M is first quantized to generate one-bit observations and then a subset of positive entries is revealed. Under the assumption that M has bounded nuclear norm, we provide recovery guarantees for two different observation models: 1) M parameterizes a distribution that generates a binary matrix, 2) M is thresholded to obtain a binary matrix. For the first case, we propose a "shifted matrix completion" method that recovers M using only a subset of indices corresponding to ones, while for the second case, we propose a "biased matrix completion" method that recovers the (thresholded) binary matrix. Both methods yield strong error bounds --- if M is n by n, the Frobenius error is bounded as O(1/((1-rho)n), where 1-rho denotes the fraction of ones observed. This implies a sample complexity of O(n n) ones to achieve a small error, when M is dense and n is large. We extend our methods and guarantees to the inductive matrix completion problem, where rows and columns of M have associated features. We provide efficient and scalable optimization procedures for both the methods and demonstrate the effectiveness of the proposed methods for link prediction (on real-world networks consisting of over 2 million nodes and 90 million links) and semi-supervised clustering tasks.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/28/2019

Missing Not at Random in Matrix Completion: The Effectiveness of Estimating Missingness Probabilities Under a Low Nuclear Norm Assumption

Matrix completion is often applied to data with entries missing not at r...
research
03/13/2018

Binary Matrix Completion Using Unobserved Entries

A matrix completion problem, which aims to recover a complete matrix fro...
research
07/02/2015

Categorical Matrix Completion

We consider the problem of completing a matrix with categorical-valued e...
research
06/07/2023

Exploiting Observation Bias to Improve Matrix Completion

We consider a variant of matrix completion where entries are revealed in...
research
04/24/2015

Social Trust Prediction via Max-norm Constrained 1-bit Matrix Completion

Social trust prediction addresses the significant problem of exploring i...
research
01/10/2014

Online Matrix Completion Through Nuclear Norm Regularisation

It is the main goal of this paper to propose a novel method to perform m...
research
05/04/2021

A Note on Statistical Inference for Noisy Incomplete 1-Bit Matrix

We consider the statistical inference for noisy incomplete 1-bit matrix....

Please sign up or login with your details

Forgot password? Click here to reset