Fetching the paper…
Reading the bibliography…
Recent studies have revealed that GNNs are vulnerable to adversarial attacks.
N. Tishby, F. C. Pereira, and W. Bialek, “The information bottleneck method,” arXiv preprint physics/0004057 , 2000
2000
Earlier work this paper cites.
A. K. McCallum, K. Nigam, J. Rennie, and K. Seymore, “Automating the construction of internet portals with machine learning,” Information Retrieval , vol. 3, no. 2, pp. 127–163, 2000
2000
Earlier work this paper cites.
Y. LeCun, L. Bottou, G. B. Orr, and K.-R. Müller, “Efficient backprop,” in Neural networks: Tricks of the trade . Springer, 2002, pp. 9–50
2002
Earlier work this paper cites.
2006
Earlier work this paper cites.
J. Yang, S. Yang, Y. Fu, X. Li, and T. Huang, “Non-negative graph embedding,” in 2008 IEEE Conference on Computer Vision and Pattern Recognition . IEEE, 2008, pp. 1–8
2008
Earlier work this paper cites.
T. Champion, L. De Pascale, and P. Juutinen, “The infinity-wasserstein distance: Local solutions and existence of optimal transport maps,” SIAM Journal on Mathematical Analysis , vol. 40, no. 1, pp. 1–20, 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, pp. 93–93, 2008
2008
Earlier work this paper cites.
B. Perozzi, R. Al-Rfou, and S. Skiena, “Deepwalk: Online learning of social representations,” in Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining , 2014, pp. 701–710
2014
Earlier work this paper cites.
J. Tang, M. Qu, M. Wang, M. Zhang, J. Yan, and Q. Mei, “Line: Large-scale information network embedding,” in Proceedings of the 24th international conference on world wide web , 2015, pp. 1067–1077
2015
Earlier work this paper cites.
2016
Earlier work this paper cites.
T. N. Kipf and M. Welling, “Variational graph auto-encoders,” arXiv preprint arXiv:1611.07308 , 2016
2016
Earlier work this paper cites.
S. Nowozin, B. Cseke, and R. Tomioka, “f-gan: Training generative neural samplers using variational divergence minimization,” in Proceedings of the 30th International Conference on Neural Information Processing Systems , 2016, pp. 271–279
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 (ICLR) , 2017
2017
Earlier work this paper cites.
W. L. Hamilton, R. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” in NIPS , 2017
2017
Earlier work this paper cites.
A. Garcia Duran and M. Niepert, “Learning graph representations with embedding propagation,” Advances in neural information processing systems , vol. 30, pp. 5119–5130, 2017
2017
Earlier work this paper cites.
L. Liao, X. He, H. Zhang, and T. Chua, “Attributed social network embedding,” IEEE Transactions on Knowledge and Data Engineering , vol. 30, no. 12, pp. 2257–2270, dec 2018
2018
Earlier work this paper cites.
D. Zügner, A. Akbarnejad, and S. Günnemann, “Adversarial attacks on neural networks for graph data,” in Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining , 2018, pp. 2847–2856
2018
Earlier work this paper cites.
R. Ying, R. He, K. Chen, P. Eksombatchai, W. L. Hamilton, and J. Leskovec, “Graph convolutional neural networks for web-scale recommender systems,” in Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining , 2018, pp. 974–983
2018
Earlier work this paper cites.
J. Qiu, Y. Dong, H. Ma, J. Li, K. Wang, and J. Tang, “Network embedding as matrix factorization: Unifying deepwalk, line, pte, and node2vec,” in Proceedings of the eleventh ACM international conference on web search and data mining , 2018, pp. 459–467
2018
Earlier work this paper cites.
S. Pan, R. Hu, G. Long, J. Jiang, L. Yao, and C. Zhang, “Adversarially regularized graph autoencoder for graph embedding.” in IJCAI , 2018, pp. 2609–2615
2018
Cited alongside, same era.
H. Dai, H. Li, T. Tian, X. Huang, L. Wang, J. Zhu, and L. Song, “Adversarial attack on graph structured data,” in International conference on machine learning . PMLR, 2018, pp. 1115–1124
2018
Cited alongside, same era.
A. Madry, A. Makelov, L. Schmidt, D. Tsipras, and A. Vladu, “Towards deep learning models resistant to adversarial attacks,” in International Conference on Learning Representations (ICLR) , 2018
2018
Cited alongside, same era.
P. Velickovic, W. Fedus, W. L. Hamilton, P. Liò, Y. Bengio, and R. D. Hjelm, “Deep graph infomax.” in ICLR (Poster) , 2019
2019
Cited alongside, same era.
P. Cui, X. Wang, J. Pei, and W. Zhu, “A survey on network embedding,” IEEE Transactions on Knowledge and Data Engineering , vol. 31, no. 05, pp. 833–852, may 2019
S. Ye, J. Liang, R. Liu, and X. Zhu, “Symmetrical graph neural network for quantum chemistry with dual real and momenta space,” The Journal of Physical Chemistry A , vol. 124, no. 34, pp. 6945–6953, 2020
2020
Later among the works it cites.
H. Yuan, J. Tang, X. Hu, and S. Ji, “Xgnn: Towards model-level explanations of graph neural networks,” in Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining , 2020, pp. 430–438
2020
Later among the works it cites.
W. Fan, Y. Ma, Q. Li, J. Wang, G. Cai, J. Tang, and D. Yin, “A graph neural network framework for social recommendations,” IEEE Transactions on Knowledge and Data Engineering , 2020
2020
Later among the works it cites.
X. Zhang and M. Zitnik, “Gnnguard: Defending graph neural networks against adversarial attacks,” in NeurIPS , 2020
2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2019
Cited alongside, same era.
F. Feng, X. He, J. Tang, and T.-S. Chua, “Graph adversarial training: Dynamically regularizing based on graph structure,” IEEE Transactions on Knowledge and Data Engineering , 2019
2019
Cited alongside, same era.
D. Zügner and S. Günnemann, “Adversarial attacks on graph neural networks via meta learning,” in International Conference on Learning Representations (ICLR) , 2019
2019
Cited alongside, same era.
K. Xu, H. Chen, S. Liu, P.-Y. Chen, T.-W. Weng, M. Hong, and X. Lin, “Topology attack and defense for graph neural networks: An optimization perspective,” in International Joint Conference on Artificial Intelligence (IJCAI) , 2019
2019
Cited alongside, same era.
W. Fan, Y. Ma, Q. Li, Y. He, E. Zhao, J. Tang, and D. Yin, “Graph neural networks for social recommendation,” in The World Wide Web Conference , 2019, pp. 417–426
2019
Cited alongside, same era.
F. Wu, A. Souza, T. Zhang, C. Fifty, T. Yu, and K. Weinberger, “Simplifying graph convolutional networks,” in International conference on machine learning . PMLR, 2019, pp. 6861–6871
2019
Cited alongside, same era.
Y. Li, C. Gu, T. Dullien, O. Vinyals, and P. Kohli, “Graph matching networks for learning the similarity of graph structured objects,” in International conference on machine learning . PMLR, 2019, pp. 3835–3845
2019
Cited alongside, same era.
F.-Y. Sun, J. Hoffman, V. Verma, and J. Tang, “Infograph: Unsupervised and semi-supervised graph-level representation learning via mutual information maximization,” in International Conference on Learning Representations , 2019
2019
Cited alongside, same era.
Y. Tian, D. Krishnan, and P. Isola, “Contrastive multiview coding,” in Computer Vision–ECCV 2020: 16th European Conference, Glasgow, UK, August 23–28, 2020, Proceedings, Part XI 16 . Springer, 2020, pp. 776–794
2020
Later among the works it cites.
K. Hassani and A. H. Khasahmadi, “Contrastive multi-view representation learning on graphs,” in International Conference on Machine Learning . PMLR, 2020, pp. 4116–4126
2020
Later among the works it cites.
W. Jin, Y. Ma, X. Liu, X. Tang, S. Wang, and J. Tang, “Graph structure learning for robust graph neural networks,” in Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining , 2020, pp. 66–74
2020
Later among the works it cites.
N. Entezari, S. A. Al-Sayouri, A. Darvishzadeh, and E. E. Papalexakis, “All you need is low (rank) defending against adversarial attacks on graphs,” in Proceedings of the 13th International Conference on Web Search and Data Mining , 2020, pp. 169–177
2020
Later among the works it cites.
M. Federici, A. Dutta, P. Forré, N. Kushman, and Z. Akata, “Learning robust representations via multi-view information bottleneck,” in International Conference on Learning Representations , 2020
2020
Later among the works it cites.
S. Zhu, X. Zhang, and D. Evans, “Learning adversarially robust representations via worst-case mutual information maximization,” in International Conference on Machine Learning . PMLR, 2020, pp. 11 609–11 618
2020
Later among the works it cites.
H. Wang, J. Wang, J. Wang, M. Zhao, W. Zhang, F. Zhang, W. Li, X. Xie, and M. Guo, “Learning graph representation with generative adversarial nets,” IEEE Transactions on Knowledge and Data Engineering , vol. 33, no. 08, pp. 3090–3103, aug 2021
2021
Later among the works it cites.
V. Fung, J. Zhang, E. Juarez, and B. G. Sumpter, “Benchmarking graph neural networks for materials chemistry,” npj Computational Materials , vol. 7, no. 1, pp. 1–8, 2021
2021
Later among the works it cites.
F. Guo, Y. Yuan, G. Wang, L. Chen, X. Lian, and Z. Wang, “Cohesive group nearest neighbor queries on road-social networks under multi-criteria,” IEEE Transactions on Knowledge and Data Engineering , vol. 33, no. 11, pp. 3520–3536, nov 2021
2021
Later among the works it cites.
Q. Zhang, T. Chu, and C. Zhang, “Semi-supervised graph based embedding with non-convex sparse coding techniques,” IEEE Transactions on Knowledge and Data Engineering , vol. 33, no. 05, pp. 2193–2207, may 2021
2021
Later among the works it cites.
M. Jin, H. Chang, W. Zhu, and S. Sojoudi, “Power up! robust graph convolutional network against evasion attacks based on graph powering,” in Proceedings of the Thirty-Fifth Conference on Association for the Advancement of Artificial Intelligence (AAAI) , 2021, pp. 8004–8012
2021
Later among the works it cites.
W. Jin, Y. Li, H. Xu, Y. Wang, S. Ji, C. Aggarwal, and J. Tang, “Adversarial attacks and defenses on graphs,” SIGKDD Explor. Newsl. , p. 19–34, 2021
2021
Later among the works it cites.
J. Xu, Y. Yang, J. Chen, X. Jiang, C. Wang, J. Lu, and Y. Sun, “Unsupervised adversarially robust representation learning on graphs,” in Proceedings of the AAAI Conference on Artificial Intelligence , vol. 36, no. 4, 2022, pp. 4290–4298
2022
Closest in time.
S. Zhang, H. Chen, X. Sun, Y. Li, and G. Xu, “Unsupervised graph poisoning attack via contrastive loss back-propagation,” in Proceedings of the ACM Web Conference 2022 , 2022, pp. 1322–1330
2022
Closest in time.
Y. Zhu, Y. Xu, F. Yu, Q. Liu, S. Wu, and L. Wang, “Graph contrastive learning with adaptive augmentation,” in Proceedings of the Web Conference 2021 , 2021, pp. 2069–2080
2080
Closest in time.