Name
Abstract | ||
|---|---|---|
ABSTRACTHyperbolic spaces offer a rich setup to learn embeddings with superior properties that have been leveraged in areas such as computer vision, natural language processing and computational biology. Recently, several hyperbolic approaches have been proposed to learn robust representations for users and items in the recommendation setting. However, these approaches don’t capture the higher order relationships that typically exist in the recommendation domain. Graph convolutional neural networks (GCNs) on the other hand excel at capturing higher order information by applying multiple levels of aggregation to local representations. In this paper we combine these frameworks in a novel way, by proposing a hyperbolic GCN model for collaborative filtering. We demonstrate that our model can be effectively learned with a margin ranking loss, and show that hyperbolic space has desirable properties under the rank margin setting. At test time, inference in our model is done using the hyperbolic distance which preserves the structure of the learned space. We conduct extensive empirical analysis on three public benchmarks and compare against a large set of baselines. Our approach achieves highly competitive results and outperforms leading baselines including the Euclidean GCN counterpart. We further study the properties of the learned hyperbolic embeddings and show that they offer meaningful insights into the data. Full code for this work is available here: https://github.com/layer6ai-labs/HGCF. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1145/3442381.3450101 | International World Wide Web Conference |
Keywords | DocType | Citations |
Recommender Systems, Hyperbolic Embeddings, Graph Convolutions | Conference | 3 |
PageRank | References | Authors |
0.37 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jianing Sun | 1 | 3 | 1.05 |
| Zhaoyue Cheng | 2 | 5 | 2.45 |
| Saba Zuberi | 3 | 3 | 0.37 |
| Felipe Pérez | 4 | 5 | 1.77 |
| Maksims Volkovs | 5 | 216 | 14.48 |