From Personalization to Privatization: Meta Matrix Factorization for Private Rating Predictions

by   Yujie Lin, et al.

Matrix factorization (MF) techniques have been shown to be effective for rating predictions (RPs) in personalized recommender systems. Existing MF methods use the same item embeddings and the same RP model for all users, while ignoring the possibility that different users may have different views about the same item and may favor different RP models. We introduce a novel MF framework, named meta matrix factorization (MetaMF), that generates private item embeddings and RP models. Given a vector representing a user, we first obtain a collaborative vector by collecting useful information from all users with a collaborative memory (CM) module. Then, we employ a meta recommender (MR) module to generate private item embeddings and a RP model based on the collaborative vector. To address the challenge of generating a large number of high-dimensional item embeddings, we devise a rise-dimensional generation (RG) strategy that first generates a low-dimensional item embedding matrix and a rise-dimensional matrix, and then multiply them to obtain high-dimensional embeddings. Finally, we use the generated model to produce private RPs for a given user. Experiments on two benchmark datasets show that MetaMF outperforms state-of-the-art MF methods. MetaMF generates similar/dissimilar item embeddings and models for different users to flexibly exploit collaborative filtering (CF), demonstrating the benefits of MetaMF.


page 1

page 2

page 3

page 4


Adaptive Matrix Completion for the Users and the Items in Tail

Recommender systems are widely used to recommend the most appealing item...

Inductive Graph Pattern Learning for Recommender Systems Based on a Graph Neural Network

Most modern successful recommender systems are based on matrix factoriza...

Conditional Restricted Boltzmann Machines for Cold Start Recommendations

Restricted Boltzman Machines (RBMs) have been successfully used in recom...

GLocal-K: Global and Local Kernels for Recommender Systems

Recommender systems typically operate on high-dimensional sparse user-it...

Private Matrix Factorization with Public Item Features

We consider the problem of training private recommendation models with a...

Nonparametric Preference Completion

We consider the task of collaborative preference completion: given a poo...

Clustered Monotone Transforms for Rating Factorization

Exploiting low-rank structure of the user-item rating matrix has been th...

Please sign up or login with your details

Forgot password? Click here to reset