Group-sparse Embeddings in Collective Matrix Factorization

Abstract

CMF is a technique for simultaneously learning low-rank representations based on a collection of matrices with shared entities. A typical example is the joint modeling of user-item, item-property, and user-feature matrices in a recommender system. The key idea in CMF is that the embeddings are shared across the matrices, which enables transferring information between them. The existing solutions, however, break down when the individual matrices have low-rank structure not shared with others. In this work we present a novel CMF solution that allows each of the matrices to have a separate low-rank structure that is independent of the other matrices, as well as structures that are shared only by a subset of them. We compare MAP and variational Bayesian solutions based on alternating optimization algorithms and show that the model automatically infers the nature of each factor using group-wise sparsity. Our approach supports in a principled way continuous, binary and count observations and is efficient for sparse matrices involving missing data. We illustrate the solution on a number of examples, focusing in particular on an interesting use-case of augmented multi-view learning.

9+2 pages, submitted for International Conference on Learning Representations 2014. This version fixes minor typographic mistakes, has one new paragraph on computational efficiency, and describes the algorithm in more detail in the Supplementary material

Cited by in corpus (7)

• Bayesian multi-tensor factorization
• GFA: Exploratory Analysis of Multiple Data Sources with Group Factor Analysis
• Deep Collective Matrix Factorization for Augmented Multi-View Learning
• Mining urban lifestyles: urban computing, human behavior and recommender systems
• Group Factor Analysis
• MM-PCA: Integrative Analysis of Multi-group and Multi-view Data
• Multi-way Clustering and Discordance Analysis through Deep Collective Matrix Tri-Factorization