Pith. sign in

REVIEW 2 cited by

Robustness Inspired Graph Backdoor Defense

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 2406.09836 v2 pith:3H7SCJXF submitted 2024-06-14 cs.LG cs.CR

Robustness Inspired Graph Backdoor Defense

classification cs.LG cs.CR
keywords backdoorgraphattacksnodespoisonedclassificationcleandefending
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Graph Neural Networks (GNNs) have achieved promising results in tasks such as node classification and graph classification. However, recent studies reveal that GNNs are vulnerable to backdoor attacks, posing a significant threat to their real-world adoption. Despite initial efforts to defend against specific graph backdoor attacks, there is no work on defending against various types of backdoor attacks where generated triggers have different properties. Hence, we first empirically verify that prediction variance under edge dropping is a crucial indicator for identifying poisoned nodes. With this observation, we propose using random edge dropping to detect backdoors and theoretically show that it can efficiently distinguish poisoned nodes from clean ones. Furthermore, we introduce a novel robust training strategy to efficiently counteract the impact of the triggers. Extensive experiments on real-world datasets show that our framework can effectively identify poisoned nodes, significantly degrade the attack success rate, and maintain clean accuracy when defending against various types of graph backdoor attacks with different properties.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

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

  1. Rethinking Molecular Graph Backdoors under Chemistry-aware Admission

    cs.LG 2026-06 unverdicted novelty 7.0

    Chemistry-aware admission defeats many molecular graph backdoors, yet ChemBack demonstrates that chemically valid, target-aligned backdoors remain effective across benchmarks and defenses.

  2. Cross-Paradigm Graph Backdoor Attacks with Promptable Subgraph Triggers

    cs.CR 2025-10 unverdicted novelty 7.0

    CP-GBA distills a queryable repository of promptable subgraph triggers via graph prompt learning to achieve transferable backdoor attacks on GNNs with state-of-the-art success rates across paradigms and defenses.