arrow
返回

SUGAR: Efficient Subgraph-Level Training via Resource-Aware Graph Partitioning

delete2023-11-01
delete4
delete
OA
AI
Z
Zihui Xue *
Y
Yuedong Yang
R
Radu Mărculescu
DOI:10.1109/TC.2023.3288755delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Graph Neural Networks (GNNs) have demonstrated a great potential in a variety of graph-based applications, such as recommender systems, drug discovery, and object recognition. Nevertheless, resource-efficient GNN learning is a rarely explored topic despite its many benefits for edge computing and Internet of Things (IoT) applications. To improve this state of affairs, this work proposes efficient subgraph-level training via resource-aware graph partitioning (SUGAR). SUGAR first partitions the initial graph into a set of disjoint subgraphs and then performs local training at the subgraph-level We provide a theoretical analysis and conduct extensive experiments on five graph benchmarks to verify its efficacy in practice. Our results across five different hardware platforms demonstrate great runtime speedup and memory reduction of SUGAR on large-scale graphs. We believe SUGAR opens a new research direction towards developing GNN methods that are resource-efficient, hence suitable for IoT deployment.
Keyword:
Graph neural networks
resource-efficient learning
edge computing

期刊

IEEE Transactions on Computers 封面图
IEEE Transactions on Computers
IF:
3.8
论文数:
5.4K
被引数:
9.8K

机构

U
university of texas system
学者数:
18.5W
论文数: 15.6W
被引数: 210
引用论文

引用论文

Highly Efficient State-Selective Submicrosecond Photoionization Detection of Single Atoms
err2010-12-13
err0
errOAAI
errF. Henkel; M. Krug; J. Hofmann; W. Rosenfeld; M. Weber; H. Weinfurter
err分享
err收藏
Essentials of Wireless Mesh Networking
err
IF0
err2010-03-01
err0
PREAI
errSteve Methley
err分享
err收藏
Improved bounds on sorting by length-weighted reversals改进了按长度加权反转排序的界限
err2008-08-01
err0
errOAAI
errMichael A. Bender; Dongdong Ge; Simai He; Haodong Hu; Ron Y. Pinter; Steven Skiena; Firas Swidan
err分享
err收藏
学者 查看更多内容