Reliable Representations Make A Stronger Defender: Unsupervised Structure Refinement for Robust GNN

Benefiting from the message passing mechanism, Graph Neural Networks (GNNs) have been successful on flourish tasks over graph data. However, recent studies have shown that attackers can catastrophically degrade the performance of GNNs by maliciously modifying the graph structure. A straightforward s...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2023-04
Hauptverfasser: Li, Kuan, Liu, Yang, Ao, Xiang, Chi, Jianfeng, Feng, Jinghua, Yang, Hao, He, Qing
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Li, Kuan
Liu, Yang
Ao, Xiang
Chi, Jianfeng
Feng, Jinghua
Yang, Hao
He, Qing
description Benefiting from the message passing mechanism, Graph Neural Networks (GNNs) have been successful on flourish tasks over graph data. However, recent studies have shown that attackers can catastrophically degrade the performance of GNNs by maliciously modifying the graph structure. A straightforward solution to remedy this issue is to model the edge weights by learning a metric function between pairwise representations of two end nodes, which attempts to assign low weights to adversarial edges. The existing methods use either raw features or representations learned by supervised GNNs to model the edge weights. However, both strategies are faced with some immediate problems: raw features cannot represent various properties of nodes (e.g., structure information), and representations learned by supervised GNN may suffer from the poor performance of the classifier on the poisoned graph. We need representations that carry both feature information and as mush correct structure information as possible and are insensitive to structural perturbations. To this end, we propose an unsupervised pipeline, named STABLE, to optimize the graph structure. Finally, we input the well-refined graph into a downstream classifier. For this part, we design an advanced GCN that significantly enhances the robustness of vanilla GCN without increasing the time complexity. Extensive experiments on four real-world graph benchmarks demonstrate that STABLE outperforms the state-of-the-art methods and successfully defends against various attacks.
doi_str_mv 10.48550/arxiv.2207.00012
format Article
fullrecord <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_2207_00012</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2684299250</sourcerecordid><originalsourceid>FETCH-LOGICAL-a520-ef9945cf728c05279ae5be08835cfd877bc86e53deb7c1bebb345be042a590193</originalsourceid><addsrcrecordid>eNotkFFLwzAUhYMgOOZ-gE8GfO5Mb5ol8W1MncKcUOdzSdpb6dzSmrRj_nvbzacL534cDh8hNzGbJkoIdm_8sTpMAZicMsZiuCAj4DyOVAJwRSYhbPsYZhKE4COSp7irjN0hTbHxGNC1pq1qF-ib-UY6px-tr90XevqIJboC_QP9dKFr0B-qgMXw7_K280NBWTnc9w20rD1Na9uFli7X62tyWZpdwMn_HZPN89Nm8RKt3pevi_kqMgJYhKXWichLCSpnAqQ2KCwypXgfFkpKm6sZCl6glXls0VqeDEACRmgWaz4mt-fak4Gs8dXe-N9sMJGdTPTE3ZlofP3TYWizbd1512_KYNb70RoE43-s-GHi</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2684299250</pqid></control><display><type>article</type><title>Reliable Representations Make A Stronger Defender: Unsupervised Structure Refinement for Robust GNN</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Li, Kuan ; Liu, Yang ; Ao, Xiang ; Chi, Jianfeng ; Feng, Jinghua ; Yang, Hao ; He, Qing</creator><creatorcontrib>Li, Kuan ; Liu, Yang ; Ao, Xiang ; Chi, Jianfeng ; Feng, Jinghua ; Yang, Hao ; He, Qing</creatorcontrib><description>Benefiting from the message passing mechanism, Graph Neural Networks (GNNs) have been successful on flourish tasks over graph data. However, recent studies have shown that attackers can catastrophically degrade the performance of GNNs by maliciously modifying the graph structure. A straightforward solution to remedy this issue is to model the edge weights by learning a metric function between pairwise representations of two end nodes, which attempts to assign low weights to adversarial edges. The existing methods use either raw features or representations learned by supervised GNNs to model the edge weights. However, both strategies are faced with some immediate problems: raw features cannot represent various properties of nodes (e.g., structure information), and representations learned by supervised GNN may suffer from the poor performance of the classifier on the poisoned graph. We need representations that carry both feature information and as mush correct structure information as possible and are insensitive to structural perturbations. To this end, we propose an unsupervised pipeline, named STABLE, to optimize the graph structure. Finally, we input the well-refined graph into a downstream classifier. For this part, we design an advanced GCN that significantly enhances the robustness of vanilla GCN without increasing the time complexity. Extensive experiments on four real-world graph benchmarks demonstrate that STABLE outperforms the state-of-the-art methods and successfully defends against various attacks.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.2207.00012</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Classifiers ; Computer Science - Cryptography and Security ; Computer Science - Learning ; Graph neural networks ; Graphical representations ; Message passing ; Nodes ; Performance degradation ; Perturbation</subject><ispartof>arXiv.org, 2023-04</ispartof><rights>2023. This work is published under http://creativecommons.org/licenses/by-nc-sa/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>http://creativecommons.org/licenses/by-nc-sa/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,780,881,27902</link.rule.ids><backlink>$$Uhttps://doi.org/10.48550/arXiv.2207.00012$$DView paper in arXiv$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.1145/3534678.3539484$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink></links><search><creatorcontrib>Li, Kuan</creatorcontrib><creatorcontrib>Liu, Yang</creatorcontrib><creatorcontrib>Ao, Xiang</creatorcontrib><creatorcontrib>Chi, Jianfeng</creatorcontrib><creatorcontrib>Feng, Jinghua</creatorcontrib><creatorcontrib>Yang, Hao</creatorcontrib><creatorcontrib>He, Qing</creatorcontrib><title>Reliable Representations Make A Stronger Defender: Unsupervised Structure Refinement for Robust GNN</title><title>arXiv.org</title><description>Benefiting from the message passing mechanism, Graph Neural Networks (GNNs) have been successful on flourish tasks over graph data. However, recent studies have shown that attackers can catastrophically degrade the performance of GNNs by maliciously modifying the graph structure. A straightforward solution to remedy this issue is to model the edge weights by learning a metric function between pairwise representations of two end nodes, which attempts to assign low weights to adversarial edges. The existing methods use either raw features or representations learned by supervised GNNs to model the edge weights. However, both strategies are faced with some immediate problems: raw features cannot represent various properties of nodes (e.g., structure information), and representations learned by supervised GNN may suffer from the poor performance of the classifier on the poisoned graph. We need representations that carry both feature information and as mush correct structure information as possible and are insensitive to structural perturbations. To this end, we propose an unsupervised pipeline, named STABLE, to optimize the graph structure. Finally, we input the well-refined graph into a downstream classifier. For this part, we design an advanced GCN that significantly enhances the robustness of vanilla GCN without increasing the time complexity. Extensive experiments on four real-world graph benchmarks demonstrate that STABLE outperforms the state-of-the-art methods and successfully defends against various attacks.</description><subject>Classifiers</subject><subject>Computer Science - Cryptography and Security</subject><subject>Computer Science - Learning</subject><subject>Graph neural networks</subject><subject>Graphical representations</subject><subject>Message passing</subject><subject>Nodes</subject><subject>Performance degradation</subject><subject>Perturbation</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><sourceid>GOX</sourceid><recordid>eNotkFFLwzAUhYMgOOZ-gE8GfO5Mb5ol8W1MncKcUOdzSdpb6dzSmrRj_nvbzacL534cDh8hNzGbJkoIdm_8sTpMAZicMsZiuCAj4DyOVAJwRSYhbPsYZhKE4COSp7irjN0hTbHxGNC1pq1qF-ib-UY6px-tr90XevqIJboC_QP9dKFr0B-qgMXw7_K280NBWTnc9w20rD1Na9uFli7X62tyWZpdwMn_HZPN89Nm8RKt3pevi_kqMgJYhKXWichLCSpnAqQ2KCwypXgfFkpKm6sZCl6glXls0VqeDEACRmgWaz4mt-fak4Gs8dXe-N9sMJGdTPTE3ZlofP3TYWizbd1512_KYNb70RoE43-s-GHi</recordid><startdate>20230421</startdate><enddate>20230421</enddate><creator>Li, Kuan</creator><creator>Liu, Yang</creator><creator>Ao, Xiang</creator><creator>Chi, Jianfeng</creator><creator>Feng, Jinghua</creator><creator>Yang, Hao</creator><creator>He, Qing</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20230421</creationdate><title>Reliable Representations Make A Stronger Defender: Unsupervised Structure Refinement for Robust GNN</title><author>Li, Kuan ; Liu, Yang ; Ao, Xiang ; Chi, Jianfeng ; Feng, Jinghua ; Yang, Hao ; He, Qing</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a520-ef9945cf728c05279ae5be08835cfd877bc86e53deb7c1bebb345be042a590193</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Classifiers</topic><topic>Computer Science - Cryptography and Security</topic><topic>Computer Science - Learning</topic><topic>Graph neural networks</topic><topic>Graphical representations</topic><topic>Message passing</topic><topic>Nodes</topic><topic>Performance degradation</topic><topic>Perturbation</topic><toplevel>online_resources</toplevel><creatorcontrib>Li, Kuan</creatorcontrib><creatorcontrib>Liu, Yang</creatorcontrib><creatorcontrib>Ao, Xiang</creatorcontrib><creatorcontrib>Chi, Jianfeng</creatorcontrib><creatorcontrib>Feng, Jinghua</creatorcontrib><creatorcontrib>Yang, Hao</creatorcontrib><creatorcontrib>He, Qing</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>arXiv Computer Science</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Li, Kuan</au><au>Liu, Yang</au><au>Ao, Xiang</au><au>Chi, Jianfeng</au><au>Feng, Jinghua</au><au>Yang, Hao</au><au>He, Qing</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Reliable Representations Make A Stronger Defender: Unsupervised Structure Refinement for Robust GNN</atitle><jtitle>arXiv.org</jtitle><date>2023-04-21</date><risdate>2023</risdate><eissn>2331-8422</eissn><abstract>Benefiting from the message passing mechanism, Graph Neural Networks (GNNs) have been successful on flourish tasks over graph data. However, recent studies have shown that attackers can catastrophically degrade the performance of GNNs by maliciously modifying the graph structure. A straightforward solution to remedy this issue is to model the edge weights by learning a metric function between pairwise representations of two end nodes, which attempts to assign low weights to adversarial edges. The existing methods use either raw features or representations learned by supervised GNNs to model the edge weights. However, both strategies are faced with some immediate problems: raw features cannot represent various properties of nodes (e.g., structure information), and representations learned by supervised GNN may suffer from the poor performance of the classifier on the poisoned graph. We need representations that carry both feature information and as mush correct structure information as possible and are insensitive to structural perturbations. To this end, we propose an unsupervised pipeline, named STABLE, to optimize the graph structure. Finally, we input the well-refined graph into a downstream classifier. For this part, we design an advanced GCN that significantly enhances the robustness of vanilla GCN without increasing the time complexity. Extensive experiments on four real-world graph benchmarks demonstrate that STABLE outperforms the state-of-the-art methods and successfully defends against various attacks.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.2207.00012</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2023-04
issn 2331-8422
language eng
recordid cdi_arxiv_primary_2207_00012
source arXiv.org; Free E- Journals
subjects Classifiers
Computer Science - Cryptography and Security
Computer Science - Learning
Graph neural networks
Graphical representations
Message passing
Nodes
Performance degradation
Perturbation
title Reliable Representations Make A Stronger Defender: Unsupervised Structure Refinement for Robust GNN
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-30T05%3A54%3A54IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Reliable%20Representations%20Make%20A%20Stronger%20Defender:%20Unsupervised%20Structure%20Refinement%20for%20Robust%20GNN&rft.jtitle=arXiv.org&rft.au=Li,%20Kuan&rft.date=2023-04-21&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.2207.00012&rft_dat=%3Cproquest_arxiv%3E2684299250%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2684299250&rft_id=info:pmid/&rfr_iscdi=true