Adversarial Attacks on Node Embeddings via Graph Poisoning

By Aleksandar Bojchevski, Stephan Günnemann. 2018

350 citations recorded by the source corpus.

The goal of network representation learning is to learn low-dimensional node embeddings that capture the graph structure and are useful for solving downstream tasks. However, despite the proliferation of such methods, there is currently no study of their robustness to adversarial attacks. We provide the first adversarial vulnerability analysis on the widely used family of methods based on random walks. We derive efficient adversarial perturbations that poison the network structure and have a negative effect on both the quality of the embeddings and the downstream tasks. We further show that our attacks are transferable since they generalize to many models and are successful even when the attacker is restricted.

Subfields: Artificial Intelligence, Computer Networks and Communications

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Neil Zhenqiang Gong
  2. Binghui Wang
  3. Marinka Zitnik
  4. Lichao Sun
  5. Philip S. Yu
  6. Stephan Günnemann
  7. Daniel Zügner
  8. Yingtong Dou

In Computer Networks and Communications

  1. Binghui Wang
  2. Neil Zhenqiang Gong
  3. Daniel Zügner
  4. Marinka Zitnik
  5. Wei Yang
  6. Anki Chauhan
  7. Mirazul Haque
  8. Cong Liu

Citations in the corpus