Towards Robust Graph Structural Learning Beyond Homophily via Preserving Neighbor Similarity
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , , , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866908518591758336 |
|---|---|
| author | Zhu, Yulin Lai, Yuni Ai, Xing LO, Wai Lun Li, Gaolei Li, Jianhua Tang, Di Zhang, Xingxing Yang, Mengpei Zhou, Kai |
| author_facet | Zhu, Yulin Lai, Yuni Ai, Xing LO, Wai Lun Li, Gaolei Li, Jianhua Tang, Di Zhang, Xingxing Yang, Mengpei Zhou, Kai |
| contents | Despite the tremendous success of graph-based learning systems in handling structural data, it has been widely investigated that they are fragile to adversarial attacks on homophilic graph data, where adversaries maliciously modify the semantic and topology information of the raw graph data to degrade the predictive performances. Motivated by this, a series of robust models are crafted to enhance the adversarial robustness of graph-based learning systems on homophilic graphs. However, the security of graph-based learning systems on heterophilic graphs remains a mystery to us. To bridge this gap, in this paper, we start to explore the vulnerability of graph-based learning systems regardless of the homophily degree, and theoretically prove that the update of the negative classification loss is negatively correlated with the pairwise similarities based on the powered aggregated neighbor features. The theoretical finding inspires us to craft a novel robust graph structural learning strategy that serves as a useful graph mining module in a robust model that incorporates a dual-kNN graph constructions pipeline to supervise the neighbor-similarity-preserved propagation, where the graph convolutional layer adaptively smooths or discriminates the features of node pairs according to their affluent local structures. In this way, the proposed methods can mine the ``better" topology of the raw graph data under diverse graph homophily and achieve more reliable data management on homophilic and heterophilic graphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_09754 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Towards Robust Graph Structural Learning Beyond Homophily via Preserving Neighbor Similarity Zhu, Yulin Lai, Yuni Ai, Xing LO, Wai Lun Li, Gaolei Li, Jianhua Tang, Di Zhang, Xingxing Yang, Mengpei Zhou, Kai Machine Learning Cryptography and Security Social and Information Networks Despite the tremendous success of graph-based learning systems in handling structural data, it has been widely investigated that they are fragile to adversarial attacks on homophilic graph data, where adversaries maliciously modify the semantic and topology information of the raw graph data to degrade the predictive performances. Motivated by this, a series of robust models are crafted to enhance the adversarial robustness of graph-based learning systems on homophilic graphs. However, the security of graph-based learning systems on heterophilic graphs remains a mystery to us. To bridge this gap, in this paper, we start to explore the vulnerability of graph-based learning systems regardless of the homophily degree, and theoretically prove that the update of the negative classification loss is negatively correlated with the pairwise similarities based on the powered aggregated neighbor features. The theoretical finding inspires us to craft a novel robust graph structural learning strategy that serves as a useful graph mining module in a robust model that incorporates a dual-kNN graph constructions pipeline to supervise the neighbor-similarity-preserved propagation, where the graph convolutional layer adaptively smooths or discriminates the features of node pairs according to their affluent local structures. In this way, the proposed methods can mine the ``better" topology of the raw graph data under diverse graph homophily and achieve more reliable data management on homophilic and heterophilic graphs. |
| title | Towards Robust Graph Structural Learning Beyond Homophily via Preserving Neighbor Similarity |
| topic | Machine Learning Cryptography and Security Social and Information Networks |
| url | https://arxiv.org/abs/2401.09754 |