Skip to yearly menu bar Skip to main content


LazyGNN: Large-Scale Graph Neural Networks via Lazy Propagation

Rui Xue · Haoyu Han · MohamadAli Torkamani · Jian Pei · Xiaorui Liu

Exhibit Hall 1 #327
[ ]
[ PDF [ Poster


Recent works have demonstrated the benefits of capturing long-distance dependency in graphs by deeper graph neural networks (GNNs). But deeper GNNs suffer from the long-lasting scalability challenge due to the neighborhood explosion problem in large-scale graphs. In this work, we propose to capture long-distance dependency in graphs by shallower models instead of deeper models, which leads to a much more efficient model, LazyGNN, for graph representation learning. Moreover, we demonstrate that LazyGNN is compatible with existing scalable approaches (such as sampling methods) for further accelerations through the development of mini-batch LazyGNN. Comprehensive experiments demonstrate its superior prediction performance and scalability on large-scale benchmarks. The implementation of LazyGNN is available at https: //

Chat is not available.