Share your thoughts, 1 month free Claude Pro on usSee more
WorkDL logo mark

Deep Graph Library: A Graph-Centric, Highly-Performant Package for Graph Neural Networks

About

Advancing research in the emerging field of deep graph learning requires new tools to support tensor computation over graphs. In this paper, we present the design principles and implementation of Deep Graph Library (DGL). DGL distills the computational patterns of GNNs into a few generalized sparse tensor operations suitable for extensive parallelization. By advocating graph as the central programming abstraction, DGL can perform optimizations transparently. By cautiously adopting a framework-neutral design, DGL allows users to easily port and leverage the existing components across multiple deep learning frameworks. Our evaluation shows that DGL significantly outperforms other popular GNN-oriented frameworks in both speed and memory consumption over a variety of benchmarks and has little overhead for small scale workloads.

Minjie Wang, Da Zheng, Zihao Ye, Quan Gan, Mufei Li, Xiang Song, Jinjing Zhou, Chao Ma, Lingfan Yu, Yu Gai, Tianjun Xiao, Tong He, George Karypis, Jinyang Li, Zheng Zhang• 2019

Related benchmarks

TaskDatasetResultRank
Node ClassificationREDDIT
Avg Runtime (ms)3.696
18
Node ClassificationOGBN-Products
Avg Iteration Runtime (ms)2.255
18
Knowledge Graph RetrievalPKG Hop 5
QT (ms)1.10e+3
17
Knowledge Graph RetrievalPKG Hop 4
QT (ms)1.12e+3
17
Knowledge Graph RetrievalPKG Hop 3
Query Time (ms)1.04e+3
17
Knowledge Graph RetrievalPKG Hop 2
Query Time (ms)989.9
17
Knowledge Graph RetrievalPKG Hop 1
Query Time (ms)966.6
17
Maximum Independent SetER [700-800] DIMES (test)
Approximation Ratio (ApR)0.83
11
Knowledge Graph Completionogbl-biokg
Step Time (ms)7.177
8
Knowledge Graph Completionogbl-wikikg2
Step-Time (ms)85.776
8
Showing 10 of 16 rows

Other info

Code

Follow for update