Fetching the paper…
Reading the bibliography…
Graph neural networks (GNNs) have received much attention recently because of their excellent performance on graph-based tasks.
D. Yarowsky, “Unsupervised word sense disambiguation rivaling supervised methods,” in
1995
Earlier work this paper cites.
A. Blum and T. Mitchell, “Combining labeled and unlabeled data with co-training,” in
1998
Earlier work this paper cites.
T. G. Dietterich, “Ensemble methods in machine learning,” in
2000
Earlier work this paper cites.
X. Glorot and Y. Bengio, “Understanding the difficulty of training deep feedforward neural networks,” in
2010
Earlier work this paper cites.
D. P. Kingma and J. Ba, “Adam: A method for stochastic optimization,”
2014
Earlier work this paper cites.
Y. Li, D. Tarlow, M. Brockschmidt, and R. Zemel, “Gated graph sequence neural networks,”
2015
Earlier work this paper cites.
J. McAuley, C. Targett, Q. Shi, and A. Van Den Hengel, “Image-based recommendations on styles and substitutes,” in
2015
Earlier work this paper cites.
G. Hinton, O. Vinyals, and J. Dean, “Distilling the knowledge in a neural network,”
2015
Earlier work this paper cites.
2016
Earlier work this paper cites.
T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” in
2017
Earlier work this paper cites.
W. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” in
2017
Earlier work this paper cites.
P. Veličković, G. Cucurull, A. Casanova, A. Romero, P. Liò, and Y. Bengio, “Graph Attention Networks,” in
2018
Cited alongside, same era.
K. Xu, C. Li, Y. Tian, T. Sonobe, K.-i. Kawarabayashi, and S. Jegelka, “Representation learning on graphs with jumping knowledge networks,” in
2018
Cited alongside, same era.
2018
Cited alongside, same era.
Q. Li, Z. Han, and X.-M. Wu, “Deeper insights into graph convolutional networks for semi-supervised learning,” in
2018
Cited alongside, same era.
M. Caron, P. Bojanowski, A. Joulin, and M. Douze, “Deep clustering for unsupervised learning of visual features,” in
2018
Cited alongside, same era.
P. Chen, B. B. Liao, G. Chen, and S. Zhang, “Understanding and utilizing deep neural networks trained with noisy labels,” in
2019
Later among the works it cites.
O. Shchur, M. Mumme, A. Bojchevski, and S. Günnemann, “Pitfalls of graph neural network evaluation,”
2019
Later among the works it cites.
A. Paszke, S. Gross, F. Massa, A. Lerer, J. Bradbury, G. Chanan, T. Killeen, Z. Lin, N. Gimelshein, L. Antiga, A. Desmaison, A. Kopf, E. Yang, Z. DeVito, M. Raison, A. Tejani, S. Chilamkurthy, B. Steiner, L. Fang, J. Bai, and S. Chintala, “PyTorch: An imperative style, high-performance deep learning library,” in
2019
Later among the works it cites.
M. Fey and J. E. Lenssen, “Fast graph representation learning with PyTorch Geometric,” in
2019
Later among the works it cites.
H. Pei, B. Wei, K. C.-C. Chang, Y. Lei, and B. Yang, “Geom-gcn: Geometric graph convolutional networks,” in
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
D. Zügner, A. Akbarnejad, and S. Günnemann, “Adversarial attacks on neural networks for graph data,” in
2018
Cited alongside, same era.
F. Wu, A. Souza, T. Zhang, C. Fifty, T. Yu, and K. Weinberger, “Simplifying graph convolutional networks,” in
2019
Cited alongside, same era.
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
2019
Cited alongside, same era.
H. NT and T. Maehara, “Revisiting graph neural networks: All we have is low-pass filters,”
2019
Cited alongside, same era.
2019
Cited alongside, same era.
H. Wu, C. Wang, Y. Tyshetskiy, A. Docherty, K. Lu, and L. Zhu, “Adversarial examples for graph data: Deep insights into attack and defense,” in
2019
Cited alongside, same era.
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
2020
Closest in time.
K. Sun, Z. Lin, and Z. Zhu, “Multi-stage self-supervised learning for graph convolutional networks on graphs with few labeled nodes.” in
2020
Closest in time.
H. Yang, K. Ma, and J. Cheng, “Rethinking graph regularization for graph neural networks,”
2020
Closest in time.
H. Wang and J. Leskovec, “Unifying graph convolutional neural networks and label propagation,”
2020
Closest in time.
K. Oono and T. Suzuki, “Graph neural networks exponentially lose expressive power for node classification,” in
2020
Closest in time.