- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper addresses multi-granularity graph anomaly detection with a single unified model. The proposed GaHIGAD applies an Information Bottleneck loss to every intermediate encoder layer, and adds a consistency loss aligning representations both across granularities and between fused and per-granularity representations, estimated via InfoNCE and MINE. Experiments on 14 datasets, including zero-shot transfer and robustness tests, report consistent gains over recent unified GAD baselines.
Critical strengths
- The empirical validation is relatively comprehensive: it covers 14 public datasets across both single-graph and multi-graph settings, including cross-granularity zero-shot transfer, noise robustness, and component-level ablations, showing consistent advantages over recent baselines.
- The granularity-aware gated fusion and the explicit separation of per-granularity encoders are simple and interpretable.
Critical weaknesses
- The paper's main novelty is applying the IB loss to all intermediate layers, but no ablation compares this with applying the IB loss to the final layer only. In addition, with β=0.001 this term becomes too small; although experiments were conducted, the analysis is lacking.
- Section 4.3 claims that three different strategies are used to estimate the mutual information, but only two are actually described.
- No code is released.
Questions for authors
- Could you describe the training procedure in detail, which terms are maximized and which are minimized? 2.. Could you provide a more detailed analysis of the estimators, in particular a lower-bound/upper-bound analysis for each mutual information term?
- In edge-level and graph-level tasks, how are the samples indexed and aligned? Such as, y is indexed by edges/graphs while h is indexed by nodes, which pairs (y,h ) enter the mutual information terms?
- Will you release the code?
I thank the authors for their clarifications and additional experiments. These revisions address my main concerns, and I have raised my score. For the final version, please check for a possible typo in Eq. (10), where the same representation appears in both arguments of the mutual-information term, and briefly clarify how the conditional model used in CLUB is obtained or fitted.