Geometric Matrix Completion with Recurrent Multi-Graph Neural Networks

Matrix completion models are among the most common formulations of recommender systems. Recent works have showed a boost of performance of these techniques when introducing the pairwise relationships between users/items in the form of graphs, and imposing smoothness priors on these graphs. However, such techniques do not fully exploit the local stationarity structures of user/item graphs, and the number of parameters to learn is linear w.r.t. the number of users and items. We propose a novel approach to overcome these limitations by using geometric deep learning on graphs. Our matrix completion architecture combines graph convolutional neural networks and recurrent neural networks to learn meaningful statistical graph-structured patterns and the non-linear diffusion process that generates the known ratings. This neural network system requires a constant number of parameters independent of the matrix size. We apply our method on both synthetic and real datasets, showing that it outperforms state-of-the-art techniques.

PDF Abstract NeurIPS 2017 PDF NeurIPS 2017 Abstract

Datasets


Results from the Paper


Ranked #5 on Recommendation Systems on YahooMusic Monti (using extra training data)

     Get a GitHub badge
Task Dataset Model Metric Name Metric Value Global Rank Uses Extra
Training Data
Result Benchmark
Recommendation Systems Douban Monti sRGCNN RMSE 0.8012 # 7
Recommendation Systems Flixster Monti sRGCNN RMSE 0.9258 # 6
Recommendation Systems MovieLens 100K sRGCNN RMSE (u1 Splits) 0.929 # 12
Recommendation Systems YahooMusic Monti sRGCNN RMSE 22.4149 # 5

Methods


No methods listed for this paper. Add relevant methods here