Fetching the paper…
Reading the bibliography…
Vertex classification is vulnerable to perturbations of both graph topology and vertex attributes, as shown in recent research.
Evaluating Statistical Tests for Within-Network Classifiers of Relational Data. In IEEE ICDM . 397–406
J. Neville, B. Gallagher, and T. Eliassi-Rad. 2009 · 2009
Earlier work this paper cites.
Intriguing properties of neural networks. In ICLR
Christian Szegedy, Wojciech Zaremba, Ilya Sutskever, Joan Bruna, Dumitru Erhan, Ian Goodfellow, and Rob Fergus. 2014 · 2014
Earlier work this paper cites.
Explaining and Harnessing Adversarial Examples. In ICLR
Ian J. Goodfellow, Jonathon Shlens, and Christian Szegedy. 2015 · 2015
Earlier work this paper cites.
node2vec: Scalable Feature Learning for Networks. In KDD . 855–864
Aditya Grover and Jure Leskovec. 2016 · 2016
Earlier work this paper cites.
DeepFool: A Simple and Accurate Method to Fool Deep Neural Networks. In CVPR . 2574–2582
Seyed-Mohsen Moosavi-Dezfooli, Alhussein Fawzi, and Pascal Frossard. 2016 · 2016
Earlier work this paper cites.
Towards Evaluating the Robustness of Neural Networks. In IEEE Symp. on Security and Privacy (SP) . 39–57
N. Carlini and D. Wagner. 2017 · 2017
Earlier work this paper cites.
Inductive Representation Learning on Large Graphs. In NeurIPS . 1025–1035
William L. Hamilton, Zhitao Ying, and Jure Leskovec. 2017 · 2017
Earlier work this paper cites.
Deep collective inference. In AAAI . 2364–2372
John Moore and Jennifer Neville. 2017 · 2017
Earlier work this paper cites.
On the Robustness of the CVPR 2018 White-Box Adversarial Example Defenses
Anish Athalye and Nicholas Carlini. 2018 · 2018
Earlier work this paper cites.
Obfuscated Gradients Give a False Sense of Security: Circumventing Defenses to Adversarial Examples. In ICML . 274–283
Anish Athalye, Nicholas Carlini, and David Wagner. 2018 · 2018
Cited alongside, same era.
Adversarial Attack on Graph Structured Data. In ICML . 1115–1124
Hanjun Dai, Hui Li, Tian Tian, Xin Huang, Lin Wang, Jun Zhu, and Le Song. 2018 · 2018
Cited alongside, same era.
An Example of Counter-Adversarial Community Detection Analysis
W. Philip Kegelmeyer, Jeremy D Wendt, and Ali Pinar. 2018 · 2018
Cited alongside, same era.
Deflecting Adversarial Attacks With Pixel Deflection. In CVPR . 8571–8580
Aaditya Prakash, Nick Moran, Solomon Garber, Antonella DiLillo, and James Storer. 2018 · 2018
Cited alongside, same era.
Provable Defenses against Adversarial Examples via the Convex Outer Adversarial Polytope. In ICML . 5286–5295
Eric Wong and Zico Kolter. 2018 · 2018
Cited alongside, same era.
On Evaluating Adversarial Robustness
Nicholas Carlini et al · 2019
Later among the works it cites.
Improving Robustness to Attacks Against Vertex Classification. In MLG Workshop
Benjamin A. Miller, Mustafa Çamurcu, Alexander J. Gomez, Kevin Chan, and Tina Eliassi-Rad. 2019 · 2019
Later among the works it cites.
Robustness May Be at Odds with Accuracy. In ICLR
Dimitris Tsipras, Shibani Santurkar, Logan Engstrom, Alexander Turner, and Aleksander Madry. 2019 · 2019
Later among the works it cites.
Adversarial examples for graph data: Deep insights into attack and defense. In IJCAI . 4816–4823
Huijun Wu, Chen Wang, Yuriy Tyshetskiy, Andrew Docherty, Kai Lu, and Liming Zhu. 2019 · 2019
Later among the works it cites.
Robust Graph Convolutional Networks Against Adversarial Attacks. In KDD . 1399–1407
Dingyuan Zhu, Ziwei Zhang, Peng Cui, and Wenwu Zhu. 2019 · 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…
Mitigating Adversarial Effects Through Randomization. In ICLR
Cihang Xie, Jianyu Wang, Zhishuai Zhang, Zhou Ren, and Alan Yuille. 2018 · 2018
Cited alongside, same era.
Adversarial classification on social networks. In AAMAS . 211–219
Sixie Yu, Yevgeniy Vorobeychik, and Scott Alfeld. 2018 · 2018
Cited alongside, same era.
Adversarial Attacks on Neural Networks for Graph Data. In KDD . 2847–2856
Daniel Zügner, Amir Akbarnejad, and Stephan Günnemann. 2018 · 2018
Cited alongside, same era.
Adversarial Attacks on Node Embeddings via Graph Poisoning. In ICML . 695–704
Aleksandar Bojchevski and Stephan Günnemann. 2019a
Cited in the paper.
Certifiable Robustness to Graph Perturbations. In NeurIPS . 8317–8328
Aleksandar Bojchevski and Stephan Günnemann. 2019b
Cited in the paper.
The Limitations of Deep Learning in Adversarial Settings. In IEEE European Symp. on Security and Privacy (EuroSP) . 372–387
N. Papernot, P. McDaniel, S. Jha, M. Fredrikson, Z. B. Celik, and A. Swami. 2016a
Cited in the paper.
Distillation as a Defense to Adversarial Perturbations Against Deep Neural Networks. In IEEE Symp. on Security and Privacy (SP) . 582–597
N. Papernot, P. McDaniel, X. Wu, S. Jha, and A. Swami. 2016b
Cited in the paper.
All You Need Is Low (Rank): Defending Against Adversarial Attacks on Graphs. In WSDM . 169–177
Negin Entezari, Saba A Al-Sayouri, Amirali Darvishzadeh, and Evangelos E Papalexakis. 2020 · 2020
Closest in time.
Adversarial Examples for Evaluating Reading Comprehension Systems. In EMNLP . 2021–2031
Robin Jia and Percy Liang. 2017 · 2031
Closest in time.
Provable Robustness of ReLU networks via Maximization of Linear Regions. In AISTATS . 2057–2066
Francesco Croce, Maksym Andriushchenko, and Matthias Hein. 2019 · 2066
Closest in time.