Fetching the paper…
Reading the bibliography…
Graph Convolutional Networks (GCNs) suffer from performance degradation when models go deeper.
P. Erdös and A. Rényi, “On random graphs I,” Publicationes Mathematicae (Debrecen) , vol. 6, pp. 290–297, 1959
1959
Earlier work this paper cites.
E. N. Gilbert, “Random graphs,” The Annals of Mathematical Statistics , vol. 30, no. 4, pp. 1141–1144, 1959
1959
Earlier work this paper cites.
Y. Bengio, P. Simard, and P. Frasconi, “Learning long-term dependencies with gradient descent is difficult,” IEEE transactions on neural networks , vol. 5, no. 2, pp. 157–166, 1994
1994
Earlier work this paper cites.
N. Srivastava, G. Hinton, A. Krizhevsky, I. Sutskever, and R. Salakhutdinov, “Dropout: a simple way to prevent neural networks from overfitting,” The journal of machine learning research , vol. 15, no. 1, pp. 1929–1958, 2014
2014
Earlier work this paper cites.
J. Bruna, W. Zaremba, A. Szlam, and Y. LeCun, “Spectral networks and locally connected networks on graphs,” ICLR , 2014
2014
Earlier work this paper cites.
2015
Earlier work this paper cites.
K. He, X. Zhang, S. Ren, and J. Sun, “Deep residual learning for image recognition,” in Proceedings of the ICCV , 2016, pp. 770–778
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 ICCV , 2016, pp. 770–778
2016
Earlier work this paper cites.
2016
Earlier work this paper cites.
N. T. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” ICLR , 2017
2017
Earlier work this paper cites.
M. Raghu, B. Poole, J. Kleinberg, S. Ganguli, and J. Sohl-Dickstein, “On the expressive power of deep neural networks,” in ICML . PMLR, 2017, pp. 2847–2854
2017
Earlier work this paper cites.
L. W. Hamilton, R. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” NeurIPS 2017 , pp. 1024–1034, 2017
2017
Earlier work this paper cites.
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 ICCV , 2017, pp. 5115–5124
2017
Earlier work this paper cites.
T. Yao, Y. Pan, Y. Li, and T. Mei, “Exploring visual relationship for image captioning,” in ECCV , September 2018
2018
Earlier work this paper cites.
Q. Li, Z. Han, and X.-M. Wu, “Deeper insights into graph convolutional networks for semi-supervised learning,” in AAAI , vol. 32, no. 1, 2018
2018
Earlier work this paper cites.
K. Xu, C. Li, Y. Tian, T. Sonobe, K.-i. Kawarabayashi, and S. Jegelka, “Representation learning on graphs with jumping knowledge networks,” in ICML . PMLR, 2018, pp. 5453–5462
2018
Earlier work this paper cites.
P. Velickovic, G. Cucurull, A. Casanova, A. Romero, P. Liò, and Y. Bengio, “Graph attention networks,” ICLR , 2018
2018
Earlier work this paper cites.
L. Li, Z. Gan, Y. Cheng, and J. Liu, “Relation-aware graph attention network for visual question answering,” in ECCV (ICCV) , October 2019
2019
Earlier work this paper cites.
2019
Cited alongside, same era.
F. Wu, A. Souza, T. Zhang, C. Fifty, T. Yu, and K. Weinberger, “Simplifying graph convolutional networks,” in ICML . PMLR, 2019, pp. 6861–6871
2019
Cited alongside, same era.
J. Klicpera, A. Bojchevski, and S. Günnemann, “Predict then propagate: Graph neural networks meet personalized pagerank,” ICLR , 2019
2019
Cited alongside, same era.
G. Li, M. Muller, A. Thabet, and B. Ghanem, “Deepgcns: Can gcns go as deep as cnns?” in ECCV , 2019, pp. 9267–9276
2019
Cited alongside, same era.
A. Kazi, S. Shekarforoush, S. A. Krishna, H. Burwinkel, G. Vivar, K. Kortüm, S.-A. Ahmadi, S. Albarqouni, and N. Navab, “Inceptiongcn: receptive field aware graph convolutional network for disease prediction,” in IPMI . Springer, 2019, pp. 73–85
S. Abu-El-Haija, A. Kapoor, B. Perozzi, and J. Lee, “N-gcn: Multi-scale graph convolution for semi-supervised node classification,” in UAI . PMLR, 2020, pp. 841–851
2020
Later among the works it cites.
2020
Later among the works it cites.
2021
Closest in time.
E. Chien, J. Peng, P. Li, and O. Milenkovic, “Adaptive universal generalized pagerank graph neural network,” in ICLR. https://openreview. net/forum , 2021
2021
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2019
Cited alongside, same era.
K. Xu, W. Hu, J. Leskovec, and S. Jegelka, “How powerful are graph neural networks?” ICLR , 2019
2019
Cited alongside, same era.
J. You, R. Ying, and J. Leskovec, “Position-aware graph neural networks,” in ICML . PMLR, 2019, pp. 7134–7143
2019
Cited alongside, same era.
Z. Yang, W. Cohen, and R. Salakhudinov, “Revisiting semi-supervised learning with graph embeddings,” in ICML . PMLR, 2016, pp. 40–48
2019
Cited alongside, same era.
J. Zhou, G. Cui, S. Hu, Z. Zhang, C. Yang, Z. Liu, L. Wang, C. Li, and M. Sun, “Graph neural networks: A review of methods and applications,” AI Open , vol. 1, pp. 57–81, 2020
2020
Cited alongside, same era.
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 , vol. 34, no. 04, 2020, pp. 3438–3445
2020
Cited alongside, same era.
2020
Cited alongside, same era.
L. Zhao and L. Akoglu, “Pairnorm: Tackling oversmoothing in gnns,” ICLR , 2020
2020
Cited alongside, same era.
2021
Closest in time.
Y. Wang, Y. Wang, J. Yang, and Z. Lin, “Dissecting the diffusion process in linear graph convolutional networks,” NeurIPS , pp. 5758–5769, 2021
2021
Closest in time.
W. Cong, M. Ramezani, and M. Mahdavi, “On provable benefits of depth in training graph convolutional networks,” NeurIPS , pp. 9936–9949, 2021
2021
Closest in time.
T. H. Do, D. M. Nguyen, G. Bekoulis, A. Munteanu, and N. Deligiannis, “Graph convolutional neural networks with node transition probability-based message passing and dropnode regularization,” Expert Systems with Applications , vol. 174, p. 114711, 2021
2021
Closest in time.
F. M. Bianchi, D. Grattarola, L. Livi, and C. Alippi, “Graph neural networks with convolutional arma filters,” TPAMI , pp. 1–1, 2021
2021
Closest in time.
K. Zhou, X. Huang, D. Zha, R. Chen, L. Li, S.-H. Choi, and X. Hu, “Dirichlet energy constrained learning for deep graph neural networks,” in NeurIPS , 2021
2021
Closest in time.
X. Miao, W. Zhang, Y. Shao, B. Cui, L. Chen, C. Zhang, and J. Jiang, “Lasagne: A multi-layer graph convolutional network framework via node-aware deep architecture,” TKDE , 2021
2021
Closest in time.
Y. Yang, Z. Guan, W. Zhao, L. Weigang, and B. Zong, “Graph substructure assembling network with soft sequence and context attention,” TKDE , 2022
2022
Closest in time.
T. K. Rusch, B. Chamberlain, J. Rowbottom, S. Mishra, and M. Bronstein, “Graph-coupled oscillator networks,” in Proceedings of the 39th ICML , ser. Proceedings of Machine Learning Research, vol. 162. PMLR, 17–23 Jul 2022, pp. 18 888–18 909
2022
Closest in time.
2022
Closest in time.
2023
Closest in time.
T. Fang, Z. Xiao, C. Wang, J. Xu, X. Yang, and Y. Yang, “Dropmessage: Unifying random dropping for graph neural networks,” in AAAI , vol. 37, no. 4, 2023, pp. 4267–4275
2023
Closest in time.
M. Niepert, M. Ahmed, and K. Kutzkov, “Learning convolutional neural networks for graphs,” in ICML . PMLR, 2016, pp. 2014–2023
2023
Closest in time.