Daily Arxiv

This is a page that curates AI-related papers published worldwide.
All content here is summarized using Google Gemini and operated on a non-profit basis.
Copyright for each paper belongs to the authors and their institutions; please make sure to credit the source when sharing.

FreeGAD: A Training-Free yet Effective Approach for Graph Anomaly Detection

Created by
  • Haebom

Author

Yunfeng Zhao, Yixin Liu, Shiyuan Li, Qingfeng Chen, Yu Zheng, Shirui Pan

Outline

This paper proposes FreeGAD, a novel, training-free method for Graph Anomaly Detection (GAD) to address the high deployment cost and scalability issues of deep learning-based approaches. FreeGAD uses a residual encoder with an affinity gate to generate representations that recognize outliers and uses anchor nodes as guides to compute outlier scores. Unlike existing deep learning-based GAD methods, FreeGAD demonstrates superior performance, efficiency, and scalability on various benchmark datasets without training or iterative optimization. Its development was motivated by empirical findings that the training step in existing deep learning-based GAD methods contributed less to performance than expected.

Takeaways, Limitations

Takeaways:
By demonstrating the utility of a GAD method that does not require learning, we demonstrate the potential to address the high resource consumption problem of deep learning-based GAD.
FreeGAD offers superior performance, efficiency, and scalability over existing methods.
Urging a reconsideration of the importance of the learning phase of deep learning-based GAD.
Limitations:
Further verification of the generalization performance of the proposed method is needed.
Robustness evaluation for various graph structures and data characteristics is needed.
Need to improve anchor node selection strategy.
👍