Fetching the paper…
Reading the bibliography…
While message passing Graph Neural Networks (GNNs) have become increasingly popular architectures for learning with graphs, recent works have revealed important shortcomings in their expressive power.
P. Kelly et al
1957
Earlier work this paper cites.
P. Erdos, A. Rényi, et al
1960
Earlier work this paper cites.
K. Hornik, M. Stinchcombe, H. White, et al
1989
Earlier work this paper cites.
K. Hornik, “Approximation capabilities of multilayer feedforward networks,” Neural networks
1991
Earlier work this paper cites.
B. D. McKay, “Small graphs are reconstructible,” Australasian Journal of Combinatorics
1997
Earlier work this paper cites.
A. Steger and N. C. Wormald, “Generating random regular graphs quickly,” Combinatorics, Probability and Computing
1999
Earlier work this paper cites.
R. Impagliazzo and R. Paturi, “On the complexity of k-sat,” Journal of Computer and System Sciences
2001
Earlier work this paper cites.
J. Chen, B. Chor, M. Fellows, X. Huang, D. Juedes, I. A. Kanj, and G. Xia, “Tight lower bounds for certain parameterized np-hard problems,” Information and Computation
2005
Earlier work this paper cites.
Pearson Education India, 2006
J. Kleinberg and E. Tardos, Algorithm design · 2006
Earlier work this paper cites.
F. Scarselli, M. Gori, A. C. Tsoi, M. Hagenbuchner, and G. Monfardini, “The graph neural network model,” IEEE Transactions on Neural Networks
2008
Earlier work this paper cites.
F. Scarselli, M. Gori, A. C. Tsoi, M. Hagenbuchner, and G. Monfardini, “Computational capabilities of graph neural networks,” IEEE Transactions on Neural Networks
2009
Earlier work this paper cites.
D. K. Duvenaud, D. Maclaurin, J. Iparraguirre, R. Bombarell, T. Hirzel, A. Aspuru-Guzik, and R. P. Adams, “Convolutional networks on graphs for learning molecular fingerprints,” in Advances in neural information processing systems
2015
Earlier work this paper cites.
M. Defferrard, X. Bresson, and P. Vandergheynst, “Convolutional neural networks on graphs with fast localized spectral filtering,” in Advances in neural information processing systems
2016
Earlier work this paper cites.
P. Battaglia, R. Pascanu, M. Lai, D. J. Rezende, et al
2016
Earlier work this paper cites.
T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” in International Conference on Learning Representations
2017
Earlier work this paper cites.
W. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” in Advances in neural information processing systems
2017
Earlier work this paper cites.
J. Gilmer, S. S. Schoenholz, P. F. Riley, O. Vinyals, and G. E. Dahl, “Neural message passing for quantum chemistry,” in Proceedings of the 34th International Conference on Machine Learning-Volume 70
2017
Earlier work this paper cites.
W. Jin, K. Yang, R. Barzilay, and T. Jaakkola, “Learning multimodal graph-to-graph translation for molecule optimization,” in International Conference on Learning Representations
2018
Earlier work this paper cites.
H. Maron, H. Ben-Hamu, N. Shamir, and Y. Lipman, “Invariant and equivariant graph networks,” in International Conference on Learning Representations
2018
Earlier work this paper cites.
F. Monti, K. Otness, and M. M. Bronstein, “Motifnet: a motif-based graph convolutional network for directed graphs,” in 2018 IEEE Data Science Workshop (DSW)
2018
Cited alongside, same era.
C. Meng, S. C. Mouli, B. Ribeiro, and J. Neville, “Subgraph pattern neural networks for high-order graph evolution prediction.,” in AAAI
2018
Cited alongside, same era.
Z. Chen, L. Li, and J. Bruna, “Supervised community detection with line graph neural networks,” in International Conference on Learning Representations
2018
Cited alongside, same era.
K. Xu, W. Hu, J. Leskovec, and S. Jegelka, “How powerful are graph neural networks?,” in International Conference on Learning Representations
2019
Cited alongside, same era.
C. Morris, M. Ritzert, M. Fey, W. L. Hamilton, J. E. Lenssen, G. Rattan, and M. Grohe, “Weisfeiler and leman go neural: Higher-order graph neural networks.,” in AAAI
V. Garg, S. Jegelka, and T. Jaakkola, “Generalization and representational limits of graph neural networks,” in Int. Conference on Machine Learning (ICML)
2020
Closest in time.
M. Sun, S. Zhao, C. Gilvary, O. Elemento, J. Zhou, and F. Wang, “Graph convolutional networks for computational drug development and discovery,” Briefings in bioinformatics
2020
Closest in time.
2020
Closest in time.
S. Kiefer and B. D. McKay, “The iteration number of colour refinement,” in 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)
2020
Closest in time.
X. Liu, H. Pan, M. He, Y. Song, X. Jiang, and L. Shang, “Neural subgraph isomorphism counting,” in Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2019
Cited alongside, same era.
D. C. Elton, Z. Boukouvalas, M. D. Fuge, and P. W. Chung, “Deep learning for molecular design a review of the state of the art,” Molecular Systems Design and Engineering
2019
Cited alongside, same era.
A. Loukas, “What graph neural networks cannot learn: depth vs width,” in International Conference on Learning Representations
2019
Cited alongside, same era.
R. Sato, M. Yamada, and H. Kashima, “Approximation ratios of graph neural networks for combinatorial problems,” in Advances in Neural Information Processing Systems
2019
Cited alongside, same era.
H. Maron, H. Ben-Hamu, H. Serviansky, and Y. Lipman, “Provably powerful graph networks,” in Advances in Neural Information Processing Systems (NeurIPS)
2019
Cited alongside, same era.
H. Maron, E. Fetaya, N. Segol, and Y. Lipman, “On the universality of invariant networks,” in International Conference on Machine Learning
2019
Cited alongside, same era.
N. Keriven and G. Peyré, “Universal invariant and equivariant graph neural networks,” in Advances in Neural Information Processing Systems (NeurIPS)
2019
Cited alongside, same era.
R. Murphy, B. Srinivasan, V. Rao, and B. Riberio, “Relational pooling for graph representations,” in International Conference on Machine Learning (ICML 2019)
2019
Cited alongside, same era.
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
E. Alsentzer, S. Finlayson, M. Li, and M. Zitnik, “Subgraph neural networks,” Advances in Neural Information Processing Systems
2020
Closest in time.
K. Huang and M. Zitnik, “Graph meta learning via local subgraphs,” arXiv preprint arXiv:2006.07889
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
S. K. Bera, N. Pashanasangi, and C. Seshadhri, “Near-linear time homomorphism counting in bounded degeneracy graphs: The barrier of long induced cycles,” 2020
2020
Closest in time.
R. Abboud, A. A. Ceylan, M. Grohe, and T. Lukasiewicz, “The surprising power of graph neural networks with random node initialization,” in Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI-21
2021
Closest in time.
J. You, J. M. Gomes-Selman, R. Ying, and J. Leskovec, “Identity-aware graph neural networks,” in Proceedings of the AAAI Conference on Artificial Intelligence
2021
Closest in time.
D. Sandfelder, P. Vijayan, and W. L. Hamilton, “Ego-gnns: Exploiting ego structures in graph neural networks,” in ICASSP 2021-2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
2021
Closest in time.
L. Cotta, C. Morris, and B. Ribeiro, “Reconstruction for powerful graph representations,” 2021
2021
Closest in time.