Taxonomy of Benchmarks in Graph Representation Learning

被引:0
作者
Liu, Renming [1 ]
Canturk, Semih [2 ]
Wenkel, Frederik [2 ]
McGuire, Sarah [1 ]
Wang, Xinyi [1 ]
Little, Anna [3 ]
O'Bray, Leslie [4 ]
Perlmutter, Michael [5 ]
Rieck, Bastian [6 ,7 ]
Hirn, Matthew [1 ]
Wolf, Guy [2 ]
Rampasek, Ladislav [2 ]
机构
[1] Michigan State Univ, E Lansing, MI 48824 USA
[2] Univ Montreal, Mila, Montreal, PQ, Canada
[3] Univ Utah, Salt Lake City, UT 84112 USA
[4] Swiss Fed Inst Technol, Zurich, Switzerland
[5] Univ Calif Los Angeles, Los Angeles, CA USA
[6] Helmholtz Munich, Munich, Germany
[7] Tech Univ Munich, Munich, Germany
来源
LEARNING ON GRAPHS CONFERENCE, VOL 198 | 2022年 / 198卷
基金
美国国家科学基金会; 美国国家卫生研究院; 芬兰科学院;
关键词
MULTICELLULAR FUNCTION; NETWORKS; DISEASE;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Graph Neural Networks (GNNs) extend the success of neural networks to graph-structured data by accounting for their intrinsic geometry. While extensive research has been done on developing GNN models with superior performance according to a collection of graph representation learning benchmarks, it is currently not well understood what aspects of a given model are probed by them. For example, to what extent do they test the ability of a model to leverage graph structure vs. node features? Here, we develop a principled approach to taxonomize benchmarking datasets according to a sensitivity profile that is based on how much GNN performance changes due to a collection of graph perturbations. Our data-driven analysis provides a deeper understanding of which benchmarking data characteristics are leveraged by GNNs. Consequently, our taxonomy can aid in selection and development of adequate graph benchmarks, and better informed evaluation of future GNN methods. Finally, our approach and implementation in GTaxoGym package(1) are extendable to multiple graph prediction task types and future datasets.
引用
收藏
页数:25
相关论文
共 72 条
[1]  
Abboud R., 2021, IJCAI
[2]  
Alon U., 2021, BOTTLENECK GRAPH NEU
[3]  
Bevilacqua Beatrice, 2021, EQUIVARIANT SUBGRAPH
[4]   Deep Graph Mapper: Seeing Graphs Through the Neural Lens [J].
Bodnar, Cristian ;
Cangea, Catalina ;
Lio, Pietro .
FRONTIERS IN BIG DATA, 2021, 4
[5]  
Bojchevski Aleksandar, 2018, P ICLR
[6]   Protein function prediction via graph kernels [J].
Borgwardt, KM ;
Ong, CS ;
Schönauer, S ;
Vishwanathan, SVN ;
Smola, AJ ;
Kriegel, HP .
BIOINFORMATICS, 2005, 21 :I47-I56
[7]  
Bresson X., 2018, ICLR
[8]   Geometric Deep Learning Going beyond Euclidean data [J].
Bronstein, Michael M. ;
Bruna, Joan ;
LeCun, Yann ;
Szlam, Arthur ;
Vandergheynst, Pierre .
IEEE SIGNAL PROCESSING MAGAZINE, 2017, 34 (04) :18-42
[9]  
Bronstein MM., 2021, GEOMETRIC DEEP LEARN
[10]  
Brugnone N, 2019, IEEE INT CONF BIG DA, P2624, DOI [10.1109/bigdata47090.2019.9006013, 10.1109/BigData47090.2019.9006013]