Hugging Face Trending Papers

Online Test-Time Adaptation for Generalizable Dynamic Graph Anomaly Detection

Read the original on Hugging Face Trending Papers →

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.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at Hugging Face Trending Papers.

arXiv Machine Learning
Aug 31

Temporal Memory-Aware Online Test-Time Adaptation on Dynamic Graphs

The paper introduces DGOTTA, a framework for temporal memory‑aware online test‑time adaptation on dynamic graphs. DGOTTA comprises three modules: temporal‑aware augmentation to diversify test graphs, memory‑aware model prediction to mitigate catastrophic forgetting, and consistency‑guided online adaptation to enforce temporal alignment and smoothness. Experiments on three real‑world datasets and four DGNN backbones show that DGOTTA improves generalization under diverse distribution shifts and across multiple model architectures.

By Bo Li, Xin Zheng, Ming Jin, Can Wang, Shirui Pan
arXiv Machine Learning
Oct 9

Is Real-World Training Data Necessary for Generalist Graph Anomaly Detection?

The paper investigates whether synthetic data can replace real-world training data for generalist graph anomaly detection (GAD). It introduces AG-FORGE, a framework that automatically generates anomalous graphs, and shows that synthetic data can match real-world performance but does not surpass it due to method limitations. To overcome this, the authors propose TS-GGAD, a model that jointly learns topological and semantic anomaly cues with a curriculum learning strategy, achieving superior results on 14 real-world datasets when trained on AG-FORGE-generated data.

By Yujing Liu, Yixin Liu, Yue Tan, Xiaofeng Cao, Alan Wee-Chung Liew, Heng Tao Shen, Shirui Pan
arXiv Machine Learning
Oct 23

One Pretrained Decision Model Is Enough for Training-Free Generalist Graph Anomaly Detection

The paper introduces Jev-GAD, a training‑free generalist graph anomaly detection framework that combines complementary structural, attribute, and neighborhood evidence with a single frozen pretrained language model for anomaly assessment. It transforms heterogeneous statistics into graph‑relative percentiles and uses a semantic Graph‑to‑State (G2S) transformation to feed evidence into a non‑generative decision readout, fusing the resulting scores with four statistical measures. Experiments on seven benchmark datasets show Jev‑GAD achieving high AUROC (89.18%) and AUPRC (52.40%) scores, demonstrating the effectiveness of pretrained decision readout and semantic evidence grounding.

By Xinyu Zhao, Qingyun Sun, Ziwei Zhang, Tianchen Zhu, Daqing Li, Jianxin Li