Online Matrix Completion with Side Information
share
We give an online algorithm and prove novel mistake and regret bounds for online binary matrix completion with side information. The bounds we prove are of the form Õ(D/γ^2). The term 1/γ^2 is analogous to the usual margin term in SVM (perceptron) bounds. More specifically, if we assume that there is some factorization of the underlying m× n matrix into PQ^ where the rows of P are interpreted as "classifiers" in ^d and the rows of Q as "instances" in ^d, then γ is is the maximum (normalized) margin over all factorizations PQ^ consistent with the observed matrix. The quasi-dimension term D measures the quality of side information. In the presence of no side information, D = m+n. However, if the side information is predictive of the underlying factorization of the matrix, then in the best case, D∈O(k + ℓ) where k is the number of distinct row factors and ℓ is the number of distinct column factors. We additionally provide a generalization of our algorithm to the inductive setting. In this setting, the side information is not specified in advance. The results are similar to the transductive setting but in the best case, the quasi-dimension D is now bounded by O(k^2 + ℓ^2).
READ FULL TEXT