arXiv Analytics

Sign in

arXiv:2005.14612 [cs.LG]AbstractReferencesReviewsResources

Non-Local Graph Neural Networks

Meng Liu, Zhengyang Wang, Shuiwang Ji

Published 2020-05-29Version 1

Modern graph neural networks (GNNs) learn node embeddings through multilayer local aggregation and achieve great success in applications on assortative graphs. However, tasks on disassortative graphs usually require non-local aggregation. In this work, we propose a simple yet effective non-local aggregation framework with an efficient attention-guided sorting for GNNs. Based on it, we develop various non-local GNNs. We perform thorough experiments to analyze disassortative graph datasets and evaluate our non-local GNNs. Experimental results demonstrate that our non-local GNNs significantly outperform previous state-of-the-art methods on six benchmark datasets of disassortative graphs, in terms of both model performance and efficiency.

Related articles: Most relevant | Search more
arXiv:1905.12916 [cs.LG] (Published 2019-05-30)
Effective Medical Test Suggestions Using Deep Reinforcement Learning
arXiv:1907.06065 [cs.LG] (Published 2019-07-13)
Bringing Giant Neural Networks Down to Earth with Unlabeled Data
arXiv:1704.05041 [cs.LG] (Published 2017-04-17)
Fast multi-output relevance vector regression