Hierarchical Estimation for Effective and Efficient Sampling Graph Neural Network
Yang Li, Bingbing Xu, Qi Cao, Yige Yuan, Huawei Shen

TL;DR
This paper introduces HE-SGNN, a hierarchical sampling method for GNNs that reduces variance and improves scalability on large graphs by addressing the circular dependency problem in sampling probabilities.
Contribution
It proposes a unified variance analysis framework and a hierarchical estimation approach to effectively and efficiently sample nodes for large-scale GNNs.
Findings
Reduces variance in sampling GNNs
Improves scalability on large graphs
Demonstrates effectiveness on seven datasets
Abstract
Improving the scalability of GNNs is critical for large graphs. Existing methods leverage three sampling paradigms including node-wise, layer-wise and subgraph sampling, then design unbiased estimator for scalability. However, the high variance still severely hinders GNNs' performance. On account that previous studies either lacks variance analysis or only focus on a particular sampling paradigm, we firstly propose an unified node sampling variance analysis framework and analyze the core challenge "circular dependency" for deriving the minimum variance sampler, i. e., sampling probability depends on node embeddings while node embeddings can not be calculated until sampling is finished. Existing studies either ignore the node embeddings or introduce external parameters, resulting in the lack of a both efficient and effective variance reduction methods. Therefore, we propose the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Complex Network Analysis Techniques · Functional Brain Connectivity Studies
