Fetching the paper…
Reading the bibliography…
From the perspective of expressive power, this work compares multi-layer Graph Neural Networks (GNNs) with a simplified alternative that we call Graph-Augmented Multi-Layer Perceptrons (GA-MLPs), which first augments node features with certain multi-hop operators on the graph and then applies an MLP in a node-wise fashion.
Are powerful graph neural nets necessary? a dissection on graph classification
Ting Chen, Song Bian, and Yizhou Sun · 1905
Earlier work this paper cites.
The reduction of a graph to canonical form and the algebra which appears therein
B Weisfeiler and A Leman · 1968
Earlier work this paper cites.
On the uniform convergence of relative frequencies of events to their probabilities
V. N. Vapnik and A. Ya. Chervonenkis · 1971
Earlier work this paper cites.
Random graph isomorphism
László Babai, Paul Erdos, and Stanley M Selkow · 1980
Earlier work this paper cites.
Can graph neural networks count substructures?
Zhengdao Chen, Lei Chen, Soledad Villar, and Joan Bruna · 2002
Earlier work this paper cites.
Deepergcn: All you need to train deeper gcns
Guohao Li, Chenxin Xiong, Ali Thabet, and Bernard Ghanem · 2006
Earlier work this paper cites.
Simple and deep graph convolutional networks
Ming Chen, Zhewei Wei, Zengfeng Huang, Bolin Ding, and Yaliang Li · 2007
Earlier work this paper cites.
Distance encoding–design provably more powerful gnns for structural representation learning
Pan Li, Yanbang Wang, Hongwei Wang, and Jure Leskovec · 2009
Earlier work this paper cites.
From local measurements to network spectral properties: Beyond degree distributions
Victor M Preciado and Ali Jadbabaie · 2010
Earlier work this paper cites.
Spectral networks and locally connected networks on graphs
Joan Bruna, Wojciech Zaremba, Arthur Szlam, and Yann LeCun · 2013
Earlier work this paper cites.
Spectral redemption in clustering sparse networks
Florent Krzakala, Cristopher Moore, Elchanan Mossel, Joe Neeman, Allan Sly, Lenka Zdeborová, and Pan Zhang · 2013
Earlier work this paper cites.
Adam: A method for stochastic optimization
Diederik P Kingma and Jimmy Ba · 2014
Earlier work this paper cites.
Spectral clustering of graphs with the bethe hessian
Alaa Saade, Florent Krzakala, and Lenka Zdeborová · 2014
Earlier work this paper cites.
Batch normalization: Accelerating deep network training by reducing internal covariate shift
Sergey Ioffe and Christian Szegedy · 2015
Earlier work this paper cites.
Convolutional neural networks on graphs with fast localized spectral filtering
Michaël Defferrard, Xavier Bresson, and Pierre Vandergheynst · 2016
Earlier work this paper cites.
Deep residual learning for image recognition
Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun · 2016
Earlier work this paper cites.
Semi-supervised classification with graph convolutional networks
Thomas N Kipf and Max Welling · 2016
Earlier work this paper cites.
Instance normalization: The missing ingredient for fast stylization
Dmitry Ulyanov, Andrea Vedaldi, and Victor Lempitsky · 2016
Cited alongside, same era.
Community detection and stochastic block models: recent developments
Emmanuel Abbe · 2017
Cited alongside, same era.
Geometric deep learning: Going beyond euclidean data
M. M. Bronstein, J. Bruna, Y. LeCun, A. Szlam, and P. Vandergheynst · 2017
Cited alongside, same era.
Inductive representation learning on large graphs
Will Hamilton, Zhitao Ying, and Jure Leskovec · 2017
Cited alongside, same era.
Manzil Zaheer, Satwik Kottur, Siamak Ravanbakhsh, Barnabas Poczos, Russ R Salakhutdinov, and Alexander J Smola · 2017
Cited alongside, same era.
Weisfeiler and leman go neural: Higher-order graph neural networks
Christopher Morris, Martin Ritzert, Matthias Fey, William L Hamilton, Jan Eric Lenssen, Gaurav Rattan, and Martin Grohe · 2019
Later among the works it cites.
Revisiting graph neural networks: All we have is low-pass filters
Hoang NT and Takanori Maehara · 2019
Later among the works it cites.
Approximation ratios of graph neural networks for combinatorial problems
Ryoma Sato, Makoto Yamada, and Hisashi Kashima · 2019
Later among the works it cites.
Simplifying graph convolutional networks
Felix Wu, Amauri Souza, Tianyi Zhang, Christopher Fifty, Tao Yu, and Kilian Weinberger · 2019
Later among the works it cites.
How powerful are graph neural networks?
Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka · 2019
Later among the works it cites.
Position-aware graph neural networks
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Johannes Klicpera, Aleksandar Bojchevski, and Stephan Günnemann · 2018
Cited alongside, same era.
Deeper insights into graph convolutional networks for semi-supervised learning
Qimai Li, Zhichao Han, and Xiao-Ming Wu · 2018
Cited alongside, same era.
Foundations of machine learning
Mehryar Mohri, Afshin Rostamizadeh, and Ameet Talwalkar · 2018
Cited alongside, same era.
Motifnet: a motif-based graph convolutional network for directed graphs
Federico Monti, Karl Otness, and Michael M Bronstein · 2018
Cited alongside, same era.
Representation learning on graphs with jumping knowledge networks
Keyulu Xu, Chengtao Li, Yonglong Tian, Tomohiro Sonobe, Ken-ichi Kawarabayashi, and Stefanie Jegelka · 2018
Cited alongside, same era.
Understanding isomorphism bias in graph data sets
Sergei Ivanov, Sergei Sviridov, and Evgeny Burnaev · 2019
Cited alongside, same era.
Universal invariant and equivariant graph neural networks
Nicolas Keriven and Gabriel Peyré · 2019
Cited alongside, same era.
Jiaxuan You, Rex Ying, and Jure Leskovec · 2019
Later among the works it cites.
On the bottleneck of graph neural networks and its practical implications
Uri Alon and Eran Yahav · 2020
Closest in time.
Improving graph neural network expressivity via subgraph isomorphism counting
Giorgos Bouritsas, Fabrizio Frasca, Stefanos Zafeiriou, and Michael M Bronstein · 2020
Closest in time.
Neural message passing on high order paths
Daniel Flam-Shepherd, Tony Wu, Pascal Friederich, and Alan Aspuru-Guzik · 2020
Closest in time.
Generalization and representational limits of graph neural networks, 2020
Vikas K. Garg, Stefanie Jegelka, and Tommi Jaakkola · 2020
Closest in time.
Geometrically principled connections in graph neural networks
Shunwang Gong, Mehdi Bahri, Michael M Bronstein, and Stefanos Zafeiriou · 2020
Closest in time.
What graph neural networks cannot learn: depth vs width
Andreas Loukas · 2020
Closest in time.
Graph neural networks exponentially lose expressive power for node classification
Kenta Oono and Taiji Suzuki · 2020
Closest in time.
Sign: Scalable inception graph neural networks
Emanuele Rossi, Fabrizio Frasca, Ben Chamberlain, Davide Eynard, Michael Bronstein, and Federico Monti · 2020
Closest in time.
A survey on the expressive power of graph neural networks
Ryoma Sato · 2020
Closest in time.
Random features strengthen graph neural networks
Ryoma Sato, Makoto Yamada, and Hisashi Kashima · 2020
Closest in time.