A defense framework detects both subgraph and feature-based graph backdoors by exploiting their lower node-neighborhood feature homophily via neighbor-aware reconstruction loss and robust training.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.CR 2years
2026 2representative citing papers
citing papers explorer
-
Universal Graph Backdoor Defense: A Feature-based Homophily Perspective
A defense framework detects both subgraph and feature-based graph backdoors by exploiting their lower node-neighborhood feature homophily via neighbor-aware reconstruction loss and robust training.
- Follow My Eyes: Backdoor Attacks on Goal-Directed Scanpath Prediction