Pith. sign in

REVIEW 1 cited by

XGBD: Explanation-Guided Graph Backdoor Detection

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2308.04406 v1 pith:XG5ZEQBY submitted 2023-08-08 cs.CR cs.LGcs.SI

classification cs.CRcs.LGcs.SI
keywords backdoorsamplesdetectiongraphmodelcleanwhenattacks
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Backdoor attacks pose a significant security risk to graph learning models. Backdoors can be embedded into the target model by inserting backdoor triggers into the training dataset, causing the model to make incorrect predictions when the trigger is present. To counter backdoor attacks, backdoor detection has been proposed. An emerging detection strategy in the vision and NLP domains is based on an intriguing phenomenon: when training models on a mixture of backdoor and clean samples, the loss on backdoor samples drops significantly faster than on clean samples, allowing backdoor samples to be easily detected by selecting samples with the lowest loss values. However, the ignorance of topological feature information on graph data limits its detection effectiveness when applied directly to the graph domain. To this end, we propose an explanation-guided backdoor detection method to take advantage of the topological information. Specifically, we train a helper model on the graph dataset, feed graph samples into the model, and then adopt explanation methods to attribute model prediction to an important subgraph. We observe that backdoor samples have distinct attribution distribution than clean samples, so the explanatory subgraph could serve as more discriminative features for detecting backdoor samples. Comprehensive experiments on multiple popular datasets and attack methods demonstrate the effectiveness and explainability of our method. Our code is available: https://github.com/GuanZihan/GNN_backdoor_detection.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Fine-tuning is Not Fine: Mitigating Backdoor Attacks in GNNs with Limited Clean Data

    cs.LG 2025-01 conditional novelty 6.0 of 10

    GraphNAD uses degree-weighted graph attention transfer plus layer-relation congruence to distill backdoored GNNs on 3% clean data and lower attack success rate below 5%.

Pith tools