Fetching the paper…
Reading the bibliography…
Increasing the depth of GCN, which is expected to permit more expressivity, is shown to incur performance detriment especially on node classification.
P. Erdos, A. Rényi et al. , “On the evolution of random graphs,” Publ. Math. Inst. Hung. Acad. Sci , vol. 5, no. 1, pp. 17–60, 1960
1960
Earlier work this paper cites.
B. Weisfeiler and A. A. Lehman, “A reduction of a graph to a canonical form and an algebra arising during this reduction,” Nauchno-Technicheskaya Informatsia , vol. 2, no. 9, pp. 12–16, 1968
1968
Earlier work this paper cites.
C. F. Van Loan and G. Golub, “Matrix computations (johns hopkins studies in mathematical sciences),” 1996
1996
Earlier work this paper cites.
F. R. Chung and F. C. Graham, Spectral graph theory . American Mathematical Soc., 1997, no. 92
1997
Earlier work this paper cites.
D. Eppstein, Z. Galil, G. F. Italiano, and A. Nissenzweig, “Sparsification—a technique for speeding up dynamic graph algorithms,” Journal of the ACM (JACM) , vol. 44, no. 5, pp. 669–696, 1997
1997
Earlier work this paper cites.
J. Atwood and D. Towsley, “Diffusion-convolutional neural networks,” in Advances in Neural Information Processing Systems , 2016, pp. 1993–2001
2001
Earlier work this paper cites.
S. U. Pillai, T. Suel, and S. Cha, “The perron-frobenius theorem: some of its applications,” IEEE Signal Processing Magazine , vol. 22, no. 2, pp. 62–75, 2005
2005
Earlier work this paper cites.
F. Fouss, K. Fran?oisse, L. Yen, A. Pirotte, and M. Saerens, “An experimental investigation of graph kernels on a collaborative recommendation task,” in Proceedings of the 6th International Conference on Data Mining (ICDM 2006 , 2006, pp. 863–868
2006
Earlier work this paper cites.
J. Friedman, T. Hastie, and R. Tibshirani, “Sparse inverse covariance estimation with the graphical lasso,” Biostatistics , vol. 9, no. 3, pp. 432–441, 2008
2008
Earlier work this paper cites.
P. Sen, G. Namata, M. Bilgic, L. Getoor, B. Galligher, and T. Eliassi-Rad, “Collective classification in network data,” AI magazine , vol. 29, no. 3, p. 93, 2008
2008
Earlier work this paper cites.
2012
Earlier work this paper cites.
J. Bruna, W. Zaremba, A. Szlam, and Y. LeCun, “Spectral networks and locally connected networks on graphs,” in Proceedings of International Conference on Learning Representations , 2013
2013
Earlier work this paper cites.
M. Vetterli, J. Kovačević, and V. K. Goyal, Foundations of signal processing . Cambridge University Press, 2014
2014
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, pp. 2224–2232
2015
Earlier work this paper cites.
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, pp. 3844–3852
2016
Earlier work this paper cites.
2016
Earlier work this paper cites.
K. He, X. Zhang, S. Ren, and J. Sun, “Deep residual learning for image recognition,” in Proceedings of the IEEE conference on computer vision and pattern recognition , 2016, pp. 770–778
2016
Cited alongside, same era.
T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” in Proceedings of the International Conference on Learning Representations , 2017
2017
Cited alongside, same era.
D. Xu, Y. Zhu, C. B. Choy, and L. Fei-Fei, “Scene graph generation by iterative message passing,” in Proceedings of the IEEE conference on computer vision and pattern recognition , 2017, pp. 5410–5419
2017
Cited alongside, same era.
W. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” in Advances in Neural Information Processing Systems , 2017, pp. 1025–1035
2017
Cited alongside, same era.
P. Velickovic, G. Cucurull, A. Casanova, A. Romero, P. Liò, and Y. Bengio, “Graph attention networks,” in ICLR , 2018
2018
Later among the works it cites.
A. Ortega, P. Frossard, J. Kovačević, J. M. Moura, and P. Vandergheynst, “Graph signal processing: Overview, challenges, and applications,” Proceedings of the IEEE , vol. 106, no. 5, pp. 808–828, 2018
2018
Later among the works it cites.
H. Ren, W. Hu, and J. Leskovec, “Query2box: Reasoning over knowledge graphs in vector space using box embeddings,” in International Conference on Learning Representations , 2019
2019
Later among the works it cites.
2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
R. Levie, F. Monti, X. Bresson, and M. M. Bronstein, “Cayleynets: Graph convolutional neural networks with complex rational spectral filters,” IEEE Transactions on Signal Processing , vol. 67, no. 1, pp. 97–109, 2017
2017
Cited alongside, same era.
F. Monti, D. Boscaini, J. Masci, E. Rodola, J. Svoboda, and M. M. Bronstein, “Geometric deep learning on graphs and manifolds using mixture model cnns,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , 2017, pp. 5115–5124
2017
Cited alongside, same era.
2017
Cited alongside, same era.
2018
Cited alongside, same era.
2018
Cited alongside, same era.
J. Chen, T. Ma, and C. Xiao, “Fastgcn: Fast learning with graph convolutional networks via importance sampling,” in Proceedings of the 6th International Conference on Learning Representations , 2018
2018
Cited alongside, same era.
W. Huang, T. Zhang, Y. Rong, and J. Huang, “Adaptive sampling towards fast graph representation learning,” in Advances in Neural Information Processing Systems , 2018, pp. 4558–4567
2018
Cited alongside, same era.
2018
Cited alongside, same era.
J. Klicpera, A. Bojchevski, and S. Günnemann, “Predict then propagate: Graph neural networks meet personalized pagerank,” in Proceedings of the 7th International Conference on Learning Representations , 2019
2019
Later among the works it cites.
N. Dehmamy, A.-L. Barabási, and R. Yu, “Understanding the representation power of graph neural networks in learning graph topology,” in Advances in Neural Information Processing Systems , 2019, pp. 15 413–15 423
2019
Later among the works it cites.
A. Loukas, “What graph neural networks cannot learn: depth vs width,” in International Conference on Learning Representations , 2019
2019
Later among the works it cites.
G. Li, M. Müller, A. Thabet, and B. Ghanem, “Deepgcns: Can gcns go as deep as cnns?” in International Conference on Computer Vision , 2019
2019
Later among the works it cites.
W.-L. Chiang, X. Liu, S. Si, Y. Li, S. Bengio, and C.-J. Hsieh, “Cluster-gcn: An efficient algorithm for training deep and large graph convolutional networks,” in KDD , 2019, pp. 257–266
2019
Later among the works it cites.
L. Zhao and L. Akoglu, “Pairnorm: Tackling oversmoothing in gnns,” in International Conference on Learning Representations , 2019
2019
Later among the works it cites.
Y. Rong, W. Huang, T. Xu, and J. Huang, “Dropedge: Towards deep graph convolutional networks on node classification,” in International Conference on Learning Representations , 2019
2019
Later among the works it cites.
K. Oono and T. Suzuki, “Graph neural networks exponentially lose expressive power for node classification,” in International Conference on Learning Representations , 2020
2020
Closest in time.
H. Zeng, H. Zhou, A. Srivastava, R. Kannan, and V. Prasanna, “Graphsaint: Graph sampling based inductive learning method,” ICLR , 2020
2020
Closest in time.
M. Liu, H. Gao, and S. Ji, “Towards deeper graph neural networks,” in Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining , 2020, pp. 338–348
2020
Closest in time.
D. Chen, Y. Lin, W. Li, P. Li, J. Zhou, and X. Sun, “Measuring and relieving the over-smoothing problem for graph neural networks from the topological view.” in AAAI , 2020, pp. 3438–3445
2020
Closest in time.
M. Niepert, M. Ahmed, and K. Kutzkov, “Learning convolutional neural networks for graphs,” in International conference on machine learning , 2016, pp. 2014–2023
2023
Closest in time.