Graph Cross Networks with Vertex Infomax Pooling

被引:0
作者
Li, Maosen [1 ]
Chen, Siheng [1 ]
Zhang, Ya [1 ]
Tsang, Ivor [2 ]
机构
[1] Shanghai Jiao Tong Univ, Shanghai, Peoples R China
[2] Univ Technol Sydney, Australian Artificial Intelligence Inst, Sydney, NSW, Australia
来源
ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 33, NEURIPS 2020 | 2020年 / 33卷
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We propose a novel graph cross network (GXN) to achieve comprehensive feature learning from multiple scales of a graph. Based on trainable hierarchical representations of a graph, GXN enables the interchange of intermediate features across scales to promote information flow. Two key ingredients of GXN include a novel vertex infomax pooling (VIPool), which creates multiscale graphs in a trainable manner, and a novel feature-crossing layer, enabling feature interchange across scales. The proposed VIPool selects the most informative subset of vertices based on the neural estimation of mutual information between vertex features and neighborhood features. The intuition behind is that a vertex is informative when it can maximally reflect its neighboring information. The proposed feature-crossing layer fuses intermediate features between two scales for mutual enhancement by improving information flow and enriching multiscale features at hidden layers. The cross shape of feature-crossing layer distinguishes GXN from many other multiscale architectures. Experimental results show that the proposed GXN improves the classification accuracy by 2:12% and 1:15% on average for graph classification and vertex classification, respectively. Based on the same network, the proposed VIPool consistently outperforms other graph-pooling methods.
引用
收藏
页数:13
相关论文
共 55 条
[1]   SegNet: A Deep Convolutional Encoder-Decoder Architecture for Image Segmentation [J].
Badrinarayanan, Vijay ;
Kendall, Alex ;
Cipolla, Roberto .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2017, 39 (12) :2481-2495
[2]  
Belghazi Mohamed Ishmael, 2018, P INT C MACHINE LEAR
[3]   Processing directed acyclic graphs with recursive neural networks [J].
Bianchini, M ;
Gori, M ;
Scarselli, F .
IEEE TRANSACTIONS ON NEURAL NETWORKS, 2001, 12 (06) :1464-1470
[4]   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
[5]  
Bruna J, 2014, 2 INT C LEARN REPR I, DOI DOI 10.48550/ARXIV.1312.6203
[6]  
Chen HC, 2018, AAAI CONF ARTIF INTE, P2127
[7]  
Chen J., 2018, ICLR POSTER, V1801, DOI 10.48550/arXiv.1801.10247
[8]   Discrete Signal Processing on Graphs: Sampling Theory [J].
Chen, Siheng ;
Varma, Rohan ;
Sandryhaila, Aliaksei ;
Kovacevic, Jelena .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2015, 63 (24) :6510-6523
[9]  
Chen X, 2020, Arxiv, DOI arXiv:2008.12450
[10]   Learning on Attribute-Missing Graphs [J].
Chen, Xu ;
Chen, Siheng ;
Yao, Jiangchao ;
Zheng, Huangjie ;
Zhang, Ya ;
Tsang, Ivor W. .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2022, 44 (02) :740-757