Improving Graph Neural Networks at Scale: Combining Approximate PageRank and CoreRank

November 08, 2022 · Entered Twilight · 🏛 arXiv.org

Repo contents: .DS_Store, .gitignore, LICENSE.md, README.md, config_demo.yaml, config_seml.yaml, coredata, data, demo.ipynb, elbow_point.py, environment.yaml, pprgo, run_seml.py, setup.py

Authors Ariel R. Ramos Vela, Johannes F. Lutzeyer, Anastasios Giovanidis, Michalis Vazirgiannis arXiv ID 2211.04248 Category cs.LG: Machine Learning Cross-listed cs.SI, stat.ML Citations 0 Venue arXiv.org Repository https://github.com/arielramos97/CorePPR ⭐ 2 Last Checked 3 months ago

Abstract

Graph Neural Networks (GNNs) have achieved great successes in many learning tasks performed on graph structures. Nonetheless, to propagate information GNNs rely on a message passing scheme which can become prohibitively expensive when working with industrial-scale graphs. Inspired by the PPRGo model, we propose the CorePPR model, a scalable solution that utilises a learnable convex combination of the approximate personalised PageRank and the CoreRank to diffuse multi-hop neighbourhood information in GNNs. Additionally, we incorporate a dynamic mechanism to select the most influential neighbours for a particular node which reduces training time while preserving the performance of the model. Overall, we demonstrate that CorePPR outperforms PPRGo, particularly on large graphs where selecting the most influential nodes is particularly relevant for scalability. Our code is publicly available at: https://github.com/arielramos97/CorePPR.