TY - GEN
T1 - CogDL
T2 - 32nd ACM World Wide Web Conference, WWW 2023
AU - Cen, Yukuo
AU - Hou, Zhenyu
AU - Wang, Yan
AU - Chen, Qibin
AU - Luo, Yizhen
AU - Yu, Zhongming
AU - Zhang, Hengrui
AU - Yao, Xingcheng
AU - Zeng, Aohan
AU - Guo, Shiguang
AU - Dong, Yuxiao
AU - Yang, Yang
AU - Zhang, Peng
AU - Dai, Guohao
AU - Wang, Yu
AU - Zhou, Chang
AU - Yang, Hongxia
AU - Tang, Jie
N1 - Publisher Copyright:
© 2023 Owner/Author.
PY - 2023/4/30
Y1 - 2023/4/30
N2 - Graph neural networks (GNNs) have attracted tremendous attention from the graph learning community in recent years. It has been widely adopted in various real-world applications from diverse domains, such as social networks and biological graphs. The research and applications of graph deep learning present new challenges, including the sparse nature of graph data, complicated training of GNNs, and non-standard evaluation of graph tasks. To tackle the issues, we present CogDL1, a comprehensive library for graph deep learning that allows researchers and practitioners to conduct experiments, compare methods, and build applications with ease and efficiency. In CogDL, we propose a unified design for the training and evaluation of GNN models for various graph tasks, making it unique among existing graph learning libraries. By utilizing this unified trainer, CogDL can optimize the GNN training loop with several training techniques, such as mixed precision training. Moreover, we develop efficient sparse operators for CogDL, enabling it to become the most competitive graph library for efficiency. Another important CogDL feature is its focus on ease of use with the aim of facilitating open and reproducible research of graph learning. We leverage CogDL to report and maintain benchmark results on fundamental graph tasks, which can be reproduced and directly used by the community.
AB - Graph neural networks (GNNs) have attracted tremendous attention from the graph learning community in recent years. It has been widely adopted in various real-world applications from diverse domains, such as social networks and biological graphs. The research and applications of graph deep learning present new challenges, including the sparse nature of graph data, complicated training of GNNs, and non-standard evaluation of graph tasks. To tackle the issues, we present CogDL1, a comprehensive library for graph deep learning that allows researchers and practitioners to conduct experiments, compare methods, and build applications with ease and efficiency. In CogDL, we propose a unified design for the training and evaluation of GNN models for various graph tasks, making it unique among existing graph learning libraries. By utilizing this unified trainer, CogDL can optimize the GNN training loop with several training techniques, such as mixed precision training. Moreover, we develop efficient sparse operators for CogDL, enabling it to become the most competitive graph library for efficiency. Another important CogDL feature is its focus on ease of use with the aim of facilitating open and reproducible research of graph learning. We leverage CogDL to report and maintain benchmark results on fundamental graph tasks, which can be reproduced and directly used by the community.
KW - graph deep learning
KW - graph library
KW - graph neural networks
UR - https://www.scopus.com/pages/publications/85159371283
U2 - 10.1145/3543507.3583472
DO - 10.1145/3543507.3583472
M3 - Conference article published in proceeding or book
AN - SCOPUS:85159371283
T3 - ACM Web Conference 2023 - Proceedings of the World Wide Web Conference, WWW 2023
SP - 747
EP - 758
BT - ACM Web Conference 2023 - Proceedings of the World Wide Web Conference, WWW 2023
PB - Association for Computing Machinery, Inc
Y2 - 30 April 2023 through 4 May 2023
ER -