- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper presents UHAL-GAD, an unsupervised graph anomaly detection method that maps node representations into Lorentz space. It combines neighborhood affinity learning with a global center-affinity constraint and derives anomaly scores from both relationships. Experiments on eight datasets report improvements over several existing detectors.
Critical strengths
-
Combining local structural affinity and global center deviation within one geometric framework is a reasonable approach to unsupervised anomaly detection.
-
The reported AUPRC results are strong across several datasets. The ablation results also indicate that both structural affinity and center constraints contribute to performance.
Critical weaknesses
-
The need for hyperbolic geometry is not sufficiently established. The method uses standard Lorentz mappings and geodesic distances, followed by neighborhood and center-affinity objectives. Although a Euclidean ablation is provided, the paper does not establish whether the advantage comes from representing hierarchical structure or simply from a different affinity function and distance scale. More tightly matched geometric controls are needed.
-
The global center constraint may suppress the anomalies it is intended to detect. Eq. (12) minimizes the center deviation of all nodes, including anomalous ones. The paper does not explain why this objective preserves abnormal representations rather than pulling them toward the normal center. This is especially important for clustered anomalies and multimodal normal distributions.
Questions for authors
-
Can the authors isolate the effect of hyperbolic geometry from the affinity function and its scaling?
-
Under what conditions does minimizing the global center loss preserve anomaly separation rather than causing representation collapse?