mlsanityData to 7 Oct 2026

CurvGAD: Leveraging Curvature for Enhanced Graph Anomaly Detection

arXiv 2502.08605 ↗First posted 12 Feb 2025cs.LG cs.AIcited by 4

Not on the map. Why?

Abstract (arXiv)

Does the intrinsic curvature of complex networks hold the key to unveiling graph anomalies that conventional approaches overlook? Reconstruction-based graph anomaly detection (GAD) methods overlook such geometric outliers, focusing only on structural and attribute-level anomalies. To this end, we propose CurvGAD - a mixed-curvature graph autoencoder that introduces the notion of curvature-based geometric anomalies. CurvGAD introduces two parallel pipelines for enhanced anomaly interpretability: (1) Curvature-equivariant geometry reconstruction, which focuses exclusively on reconstructing the edge curvatures using a mixed-curvature, Riemannian encoder and Gaussian kernel-based decoder; and (2) Curvature-invariant structure and attribute reconstruction, which decouples structural and attribute anomalies from geometric irregularities by regularizing graph curvature under discrete Ollivier-Ricci flow, thereby isolating the non-geometric anomalies. By leveraging curvature, CurvGAD refines the existing anomaly classifications and identifies new curvature-driven anomalies. Extensive experimentation over 10 real-world datasets (both homophilic and heterophilic) demonstrates an improvement of up to 6.5% over state-of-the-art GAD methods. The code is available at: https://github.com/karish-grover/curvgad.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 27 of its 56 references that are in the map. First posted on arXiv 12 Feb 2025.

Builds on

27 of 56 references.

References · 27

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  2. 2017Graph Attention Networkscited by 8,854
  3. 2017Inductive Representation Learning on Large Graphscited by 6,284
  4. 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,085
  5. 2017SphereFace: Deep Hypersphere Embedding for Face Recognitioncited by 733
  6. 2021Understanding over-squashing and bottlenecks on graphs via curvaturecited by 471
  7. 2019Predicting Dynamic Embedding Trajectory in Temporal Interaction Networkscited by 443
  8. 2019Hyperbolic Graph Convolutional Neural Networkscited by 400
  9. 2023A critical look at the evaluation of GNNs under heterophily: Are we really making progress?cited by 332
  10. 2020Enhancing Graph Neural Network-based Fraud Detectors against Camouflaged Fraudsterscited by 248
  11. 2022ADBench: Anomaly Detection Benchmarkcited by 230
  12. 2018Representation Tradeoffs for Hyperbolic Embeddingscited by 204
15 more
  1. 2021BernNet: Learning Arbitrary Graph Spectral Filters via Bernstein Approximationcited by 195
  2. 2022Rethinking Graph Neural Networks for Anomaly Detectioncited by 185
  3. 2019Anti-Money Laundering in Bitcoin: Experimenting with Graph Convolutional Networks for Financial Forensicscited by 158
  4. 2013From Amateurs to Connoisseurs: Modeling the Evolution of User Expertise through Online Reviewscited by 107
  5. 2019Constant Curvature Graph Convolutional Networkscited by 106
  6. 2020AnomalyDAE: Dual autoencoder for anomaly detection on attributed networkscited by 81
  7. 2022BOND: Benchmarking Unsupervised Outlier Node Detection on Static Attributed Graphscited by 80
  8. 2022DGraph: A Large-Scale Financial Dataset for Graph Anomaly Detectioncited by 63
  9. 2023GAD-NR: Graph Anomaly Detection via Neighborhood Reconstructioncited by 44
  10. 2021Pseudo-Riemannian Graph Convolutional Networkscited by 30
  11. 2023ADA-GAD: Anomaly-Denoised Autoencoders for Graph Anomaly Detectioncited by 23
  12. 2018Network Alignment by Discrete Ollivier-Ricci Flowcited by 14
  13. 2023Curvature-based Clustering on Graphscited by 14
  14. 2013On properties of the Generalized Wasserstein distancecited by 11
  15. 2020Graph Convolutional Networks for traffic anomalycited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 4.

4 papers.