Sign inGet started
Paper · arXiv

Online Test-Time Adaptation for Generalizable Dynamic Graph Anomaly Detection

Generalizable dynamic graph anomaly detection (DGAD) enables pretrained detectors to identify anomalies in unseen target domains without costly retraining. However, existing methods often fail for two reasons. First, they mainly rely on domain-agnostic patterns and miss domain-specific patterns that keep evolving. Second, they assume access to the full target domain data, whereas in more practical online test-time adaptation settings, target data arrive sequentially in unlabeled chunks. To address these limitations, we formulate online test-time adaptation for generalizable DGAD and propose OTTA-DGAD. OTTA-DGAD first extracts dynamic prototypes, i.e., evolving representations of normal an...

AuthorsJialun Zheng, Hanchen Yang, Jiannong Cao et al.
Primary categorycs.LG
Published20 August 2026
Last updated at source20 August 2026
cs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/d48a1a0d-e8eb-447f-9839-f526b6162cbd" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.