Universal adversarial attacks on graph neural networks
This project aims to study the robustness of graph-level graph neural networks (GNNs) against universal adversarial attacks in white-box and grey-box scenarios. Graph-level GNNs are widely used in critical domains such as quantum chemistry, drug discovery, while the robustness of them against un...
Saved in:
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Final Year Project |
| 語言: | English |
| 出版: |
Nanyang Technological University
2021
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/149401 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | This project aims to study the robustness of graph-level graph neural networks (GNNs)
against universal adversarial attacks in white-box and grey-box scenarios. Graph-level
GNNs are widely used in critical domains such as quantum chemistry, drug discovery,
while the robustness of them against universal adversarial attacks is unknown. In
particular, there is currently no universal adversarial attack algorithm applicable to
graph-level GNNs. In this project, a data-free universal adversarial attack for graph-level
GNNs is proposed. We conducted several experiments to show that:
1. Graph-level GNNs are not robust against universal adversarial attacks even under
grey-box scenarios.
2. Node features can be used as node embeddings with better performance than
using the difference between graphs as node embedding.
3. Betweenness centrality may better reflect the importance of a node in an
adversarial attack context. |
|---|