Scalable Probabilistic Matrix Factorization with Graph-Based Priors

Abstract

In matrix factorization, available graph side-information may not be well suited for the matrix completion problem, having edges that disagree with the latent-feature relations learnt from the incomplete data matrix. We show that removing these $\text{contested}$ edges improves prediction accuracy and scalability. We identify the contested edges through a highly-efficient graphical lasso approximation. The identification and removal of contested edges adds no computational complexity to state-of-the-art graph-regularized matrix factorization, remaining linear with respect to the number of non-zeros. Computational load even decreases proportional to the number of edges removed. Formulating a probabilistic generative model and using expectation maximization to extend graph-regularised alternating least squares (GRALS) guarantees convergence. Rich simulated experiments illustrate the desired properties of the resulting algorithm. On real data experiments we demonstrate improved prediction accuracy with fewer graph edges (empirical evidence that graph side-information is often inaccurate). A 300 thousand dimensional graph with three million edges (Yahoo music side-information) can be analyzed in under ten minutes on a standard laptop computer demonstrating the efficiency of our graph update.

arXiv commentUnder review

References in corpus (7)

• Geometric Matrix Completion with Recurrent Multi-Graph Neural Networks
• Graph Summarization Methods and Applications: A Survey
• Learning Laplacian Matrix in Smooth Graph Signal Representations
• Leveraging Node Attributes for Incomplete Relational Data
• Graphical Lasso and Thresholding: Equivalence and Closed-form Solutions
• Fast and Sample Efficient Inductive Matrix Completion via Multi-Phase Procrustes Flow
• Large-Scale Sparse Inverse Covariance Estimation via Thresholding and Max-Det Matrix Completion

Cited by in corpus (4)

• Robust Preference-Guided Denoising for Graph based Social Recommendation
• Federated Multi-view Matrix Factorization for Personalized Recommendations
• Correlating sparse sensing for large-scale traffic speed estimation: A Laplacian-enhanced low-rank tensor kriging approach
• GLocal-K: Global and Local Kernels for Recommender Systems