- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes G-SNLS, a supervised node-level graph anomaly detector based on damped Schrödinger-type spectral propagators. Each spectral head learns damping, dispersion, and time-scale parameters, and the representations are coupled. The model also uses deterministic graph-context features and two decoders trained with focal loss and a smooth average-precision objective. Experiments show improvements on given datasets compared to given baselines.
Critical strengths
- Experiments show improvements on given datasets compared to given baselines.
- Theoretical statements are clear.
Critical weaknesses
- It is unclear that the contribution is Schrödinger-specific. At matched polynomial order, the unconstrained response reaches almost the same accuracy. Thus, the Schrödinger constraint itself does not appear to provide the predictive gains.
- The theoretical stability is stronger in claim than experiments. Proposition 2 proves closure and contraction for the linear spectral propagator. However, the framework uses a learned complex channel map, nonlinear modulation, real projection, and radial clipping between propagation steps.
- The hyperparameter tuning cost is high for G-SNLS.
- The compared baselines and datasets are not comprehensive enough. They should include more recent baselines, such as XGBGraph [1], CONSISGAD [2], and SpaceGNN [3], and more real-world datasets, such as T-Social [1] and DGraph-Fin [1].
Reference
[1] Jianheng Tang, Fengrui Hua, Ziqi Gao, Peilin Zhao, Jia Li. GADBench: Revisiting and Benchmarking Supervised Graph Anomaly Detection. NeurIPS 2023.
[2] Nan Chen, Zemin Liu, Bryan Hooi, Bingsheng He, Rizal Fathony, Jun Hu, Jia Chen. Consistency Training with Learnable Data Augmentation for Graph Anomaly Detection with Limited Supervision. ICLR 2024.
[3] Xiangyu Dong, Xingyi Zhang, Lei Chen, Mingxuan Yuan, Sibo Wang. SpaceGNN: Multi-Space Graph Neural Network for Node Anomaly Detection with Extremely Limited Labels. ICLR 2025.
Questions for authors
- Can the authors report AUPRC after removing the ranking decoder and train the strongest baselines with the same focal + smooth-AP objective?
- How do results change under equal hyperparameter-search budgets?
4 comments
W3 and Q2. Hyperparameter cost and equal search budgets.
G-SNLS screens forty-eight sampled configurations where a baseline screens eighteen plus its published default, because its space contains discrete architectural choices. Table 22 (Appendix K) answers the question directly with two reruns on the ten splits. Under the baseline budget, the same two-stage search with eighteen sampled configurations screened with the full training length, G-SNLS reaches 85.56, 75.25, 98.07, 97.03, 99.19, 95.09, 97.42 and 95.78% AUROC on Tolokers, Questions, Amazon, T-Finance, Elliptic, inj-Amazon, Minesweeper and inj-Flickr, which keeps the average ranks of 1.12 (AUROC) and 1.00 (AUPRC) of the submitted selection and exceeds it on Minesweeper and inj-Amazon, where screening for the full training length found settings that the shorter screening of the larger search had missed; the main tables keep the submitted selection. Under one shared configuration for every dataset and no search at all, it reaches 85.34, 72.90, 97.57, 97.12, 99.03, 91.50, 94.89 and 94.44, within one point of the validated selection on six datasets, 3.9% below on Questions and 1.3% above on inj-Amazon, and ranks 2.12 on AUROC and 1.50 on AUPRC among the nine baselines. The per-epoch cost of the method is in Appendix M: it is the slowest of the five methods sharing its stack on the sparse graphs and the fastest on Amazon, with less memory than GCN, GraphSAGE and AMNet on the two dense graphs.
W4. More recent baselines and larger datasets.
Baselines. We added XGBGraph (and RF-Graph), ConsisGAD and SpaceGNN, together with PMP, MagNet, UniConv and fLode, on the same ten splits (Appendix G, Table 11). ConsisGAD and SpaceGNN run their released code and configurations; both were designed for the regime of very few labels, so we note that the 40% training split is outside their intended setting. ConsisGAD reaches 77.09, 75.18, 97.82, 93.28, 96.90, 89.45, 88.05 and 90.68% AUROC and SpaceGNN 81.00, 77.14, 97.86, 96.49, 98.88, 95.13, 90.27 and 93.72% on Tolokers, Questions, Amazon, T-Finance, Elliptic, inj-Amazon, Minesweeper and inj-Flickr, against 85.11, 76.78, 98.01, 97.01, 99.23, 90.18, 95.55 and 95.08% for G-SNLS. SpaceGNN passes G-SNLS on Questions (+0.36%) and inj-Amazon (+4.95%) and trails elsewhere by 0.15 to 5.3%; ConsisGAD trails everywhere. XGBGraph is the strongest addition: it leads on Amazon, T-Finance and Elliptic by 0.30 to 0.40% and on inj-Amazon by 8.7%, while G-SNLS keeps the best AUROC on Tolokers and Minesweeper, resolved against all eight additions, and the best AUPRC on Tolokers, Questions, Minesweeper and inj-Flickr.
Datasets. We added T-Social, the social graph released with T-Finance (5.78 million nodes, 73 million edges), on its ten stored GADBench trials, with every method at the configuration it validated on T-Finance and no further search (Table 15, Appendix G). G-SNLS reaches 99.68% AUROC, 97.85% AUPRC and 97.07% macro F1, against 99.73 / 97.88 / 96.82 for RF-Graph, 99.40 / 94.62 / 94.79 for XGBGraph, 96.29 / 70.28 / 83.08 for BWGNN and 84.06 / 22.78 / 60.57 for GPR-GNN, 96.74 / 73.88 / 84.49 for GHRN, 96.23 / 71.83 / 83.21 for GCN and 65.96 / 4.61 / 49.82 for GraphSAGE, whose T-Finance configuration collapses to the all-negative predictor on this graph. The picture of the eight benchmark graphs carries over to a graph with over a hundred times the nodes of T-Finance: the tree ensembles and G-SNLS are the only methods near the ceiling, separated by at most 0.05% AUROC, and G-SNLS holds the best macro F1. For scale, GADBench reports on this graph, with its own search per method, 95.7 to 97.1% AUROC and 75 to 87% AUPRC for GraphSAGE, GCN, BWGNN and GHRN, 97.6 and 97.3% AUPRC for RF-Graph and XGB-Graph, and 99.9% AUROC with 99.1% AUPRC for BGNN, a gradient-boosting hybrid we do not run; our full-batch convolutions at their T-Finance configuration fall below those tuned values, and G-SNLS reaches its scores without any search on this graph. One G-SNLS trial on this graph takes between two and four hours on one GPU at width 64, with the Chebyshev realization and a constant-memory backward pass. DGraph-Fin is distributed only through a registration-gated download at dgraph.xinye.com (site is currently down), which we could not complete within the response period; we will add it as soon as the files are available to us.
Q1. AUPRC without the ranking decoder, and the strongest baselines under the same focal plus smooth-AP objective.
Without the ranking decoder. Table 9 (Appendix F) scores that ablation on test AUPRC at the epoch of best validation AUROC on the six ablation datasets. Removing the ranking decoder changes AUPRC by % on Minesweeper, % on Tolokers, % on Questions, % on Amazon, % on Elliptic and % on inj-Flickr; the paired test resolves only the inj-Flickr change, and in the direction of removal. The AUPRC margins over the strongest baseline (12.6% on Minesweeper, 7.4% on inj-Flickr, 6.1% on Tolokers) therefore do not come from the decoder that targets the metric. What the decoder contributes is the 0.41% of AUROC on Questions that the extended ablation reports (Table 10).
Baselines under our objective. Table 14 (Appendix G) retrains GraphSAGE, BWGNN, GHRN and SAGAD with their final linear layer replaced by our two decoders, one under the focal loss and the other under the smooth average-precision surrogate with the same constants, every other validated setting unchanged. On AUROC the objective changes a backbone by less than 0.7% in 22 of the 32 backbone-dataset pairs and lowers it by 1 to 5.5% in the other ten, nine of them on Questions and the two injected datasets; the largest gain is +0.62%. On AUPRC it lifts every backbone on T-Finance by 1.7 to 2.8% and GHRN on inj-Amazon by 7.6%, and lowers GraphSAGE and SAGAD on inj-Amazon by more than 10%. The retrained backbones stay below G-SNLS on every dataset except T-Finance, where BWGNN under our objective reaches 97.17% against our 97.01%. The objective is part of the method, but it accounts for a small part of the margin; the components the ablations measure account for the rest.
Dear Reviewer (3A4j), We would like to sincerely thank you for your valuable feedback and thoughtful consideration. If you feel that your concerns have been satisfactorily addressed, we would be truly grateful if you could kindly consider revising the score upward, as it would greatly improve the chances of our paper being accepted.
We thank the reviewer for the precise summary and for the questions, which we answer with new experiments.
W1. Is the contribution Schrödinger-specific, given that an unconstrained response of matched order reaches almost the same accuracy?
This is the finding of Section 4.4, and we state it as such: at matched order the free filter changes AUROC by a mean of −0.09% and the cross-dataset test returns p=0.69. The paper does not claim that the constraint raises accuracy over a free filter of matched degree; the ablations attribute the accuracy to the dissipative coupling and the channel map, and the contribution we claim for the Schrödinger parameterization is what the same control shows it to supply at no cost in accuracy:
The new experiments add two facts to this picture. The unitary propagator of Kiani et al. inside our architecture, which keeps the complex map and drops the damping, loses 1.31% on Minesweeper, 1.24% on Tolokers, 6.13% on Questions, 0.42% on Elliptic and 1.01% on inj-Flickr with the ReLU of Kiani et al. in place of the modulation, and 3.70%, 2.21%, 6.71%, 0.46%, 1.43% and 2.15% (Amazon included) without any modulation, so the damping is a working part of the parameterization and not a label; and the standard-alternative rows of Table 5 show which forms matter: a real linear channel map stays within ±0.83% of the complex one on every dataset, whereas a ReLU in place of the dissipative modulation costs up to 7.63%.
W2. The stability claim is stronger than the experiments, since the framework also has a channel map, a modulation, a real projection and a clip.
Theorem 3 is the result for exactly that composition. Its proof applies the propagator, the channel map, the modulation, the real projection and the radial clip in the order the layer uses them and gives ∥ψT∥F≤min{BNd,[m(1+ε)]T∥ψ0∥F} with m=∥M∥2, so the one factor that can expand the state is the channel map, and Proposition 6 bounds what the modulation emits for any input. Proposition 2 is a statement about the propagator alone, and we now say so where it is stated (Section 3.3, blue). We also added Appendix L, which trains the validated configuration of every dataset and reads the state norm after every layer: the state stays within a factor 1.7 of the encoded state on six datasets, within 3.4 on inj-Flickr and grows to 42 over eight layers on inj-Amazon, against bounds between 81 and 5×107; the radial clip touches no entry and the largest entry leaving a modulation equals the ceiling of Proposition 6 to three decimals on every dataset (Table 23). The bound is loose, as the reviewer suspects, but the composition it covers is the complete layer, and the trained models stay far inside it without the clip ever acting.