Weighted Low-Rank Approximations

We study the common problem of approximating a target matrix with a matrix of lower rank. We provide a simple and efficient (EM) algorithm for solving weighted low-rank approximation problems, which, unlike their unweighted version, do not admit a closedform solution in general. We analyze, in addition, the nature of locally optimal solutions that arise in this context, demonstrate the utility of accommodating the weights in reconstructing the underlying low-rank representation, and extend the formulation to nonGaussian noise models such as logistic models. Finally, we apply the methods developed to a collaborative filtering task.

• Type: Conference
• Year: 2003
• Where: ICML
• Authors: Nathan Srebro, Tommi Jaakkola
• Keywords: Collaborative Filtering Task, ICML 2003, Low-rank Representation, Machine Learning, Weighted Low-rank Approximation