acceptodds
Under review as a conference paper at ICLR 2027

Residual-Augmented Latent Flow Matching for Graph Anomaly Detection

Abstract

Unsupervised graph anomaly detection (GAD) aims to identify nodes that deviate from the majority of normal nodes without access to anomaly labels. This task remains challenging due to the scarcity of abnormal nodes and severe class imbalance. Graph neural network-based methods and recent diffusion-based generative models have made substantial progress in modeling complex graph data distributions. However, message passing can make anomalous node representations less distinguishable from their neighborhoods, while diffusion-based generative detectors often require costly multi-step denoising. We propose RALFlow-GAD, a residual-augmented latent flow matching framework for unsupervised graph anomaly detection. RALFlow-GAD augments graph autoencoder embeddings with degree-aware global and local residuals to preserve anomaly-relevant deviations, and learns a prototype-conditioned latent flow matching model to capture the dominant normal pattern. At inference time, RALFlow-GAD computes anomaly scores via one-step latent reconstruction and applies a lightweight score orientation correction. Experiments on five real-world datasets show that RALFlow-GAD achieves the best average performance among the reproduced methods. Compared with DiffGAD, the strongest reproduced baseline, RALFlow-GAD improves average AUROC by 10.3% and AP by 13.4%. Moreover, it obtains consistent speedups, achieving up to 41× over the diffusion-based generative baseline.

Primary area:
learning on graphs and other geometries & topologies
Keywords:
Graph Anomaly Detection, Unsupervised Learning, Latent Flow Matching, Residual Augmentation, Graph Autoencoder, Graph Neural Networks

Reviews

Among:
Shape:
1234this paper, Bottom 27%
Figure 1. Mean review rating of the reviewed papers at ICLR 2027. This paper averages 2.00 over 3 reviews, above 27% of the others.
Reviewer_uuaFOpenReview ↗
Rating
2
Confidence
4
Informativeness
2
Presentation
2
Soundness
1
Read review
Paper summary

This paper presents RALFlow-GAD, an unsupervised node-level graph anomaly detection framework that integrates a graph autoencoder, degree-aware global/local residual augmentation, latent flow matching, prototype-conditioned flow guidance, and a label-free score-orientation mechanism. Experiments show improvements on the given datasets compared to the given baselines.

Critical strengths
  1. Experiments show the improvements on given datasets compared to given baselines.
  2. Strong speed improvement compared to DiffGAD.
Critical weaknesses
  1. Most of the performance gain comes from score orientation rather than the proposed flow architecture, as shown in Table 3. The residual/prototype/flow machinery contributes little to the results.
  2. Prototype-conditioned dual-flow guidance is not consistently useful. The selected guidance weight is 0 n Enron, Reddit, and Weibo.
  3. Not enough comparable datasets. The authors should include larger datasets to show their efficiency, such as Amazon, T-Finance, T-Social, and DGraph-Fin from GADBench [1].
  4. The method requires substantial dataset-specific tuning. Several parameters are selected separately for every dataset through a label-free OFAT procedure.

Reference

[1] Jianheng Tang, Fengrui Hua, Ziqi Gao, Peilin Zhao, Jia Li. GADBench: Revisiting and Benchmarking Supervised Graph Anomaly Detection. NeurIPS 2023.

Questions for authors
  1. How robust is score orientation when the local inconsistency prior is unreliable?
  2. Why is prototype guidance a main contribution when w=0 on three of five datasets? Can the authors provide evidence that this component helps beyond very small graphs?
  3. How much does flow matching itself contribute?
Reviewer_SrNnOpenReview ↗
Rating
2
Confidence
3
Informativeness
2
Presentation
3
Soundness
2
Read review
Paper summary

The paper proposes RALFlow-GAD for unsupervised node anomaly detection. It augments graph autoencoder embeddings with degree-adaptive local and global residuals, learns free and prototype-conditioned velocity fields, and generates latent references through one-step flow inference. The resulting discrepancy scores are smoothed and oriented using a local inconsistency prior. Experiments on five real-world datasets report improved average AUROC and lower runtime compared with DiffGAD.

Critical strengths
  1. The reported accuracy–efficiency trade-off is promising. The method achieves an average AUROC of 0.730, compared with 0.660 for DiffGAD, while substantially reducing runtime. Improving the practicality of generative graph anomaly detection is a worthwhile objective.
  2. The experiments include useful component analyses. In particular, Table 11 separates score orientation from prior fusion, making their different contributions clear. The appendix also acknowledges dataset-dependent benefits and limitations rather than presenting every component as universally effective.
Critical weaknesses
  1. I'm not sure how much the one-step flow itself contributes. With independent noise–data pairing, one Euler step from t = 0 using the ideal continuous free velocity field would simply return the latent mean. Three datasets use w = 0, so a simple control seems important here: decode the empirical latent mean and apply the same preprocessing and score post-processing.
  2. The score-orientation rule needs more justification. It can reverse a ranking even when its correlation with the prior is positive, just because the correlation falls below the threshold. This step matters a lot: orientation alone raises average AUROC from 0.451 to 0.727. But the paper does not report the actual correlations or show how consistent the flip decisions are across seeds.
  3. The most recent baselines are from 2025. I would like to see comparisons with applicable methods from the first half of 2026, or a brief explanation of why they are not included. This would make the claimed performance advantage more convincing.
  4. The distinction from DiffGAD could be clearer. DiffGAD already uses graph autoencoding, an adaptively estimated common feature, and a contrast between conditional and unconditional generative models. I can see what has changed, but I'm less clear on what new modeling insight the residual augmentation and one-step flow provide beyond that framework.
Questions for authors
  1. Could you compare the flow-generated reference with a decoded empirical latent-mean reference, using the same preprocessing, decoder, and score post-processing? A comparison with DiffGAD under matched representation and scoring settings would also help show how much the generative model itself contributes.
  2. Why should a ranking be reversed when its correlation with the prior is positive but below the threshold? I see how the threshold is selected in Appendix A.4, but the reasoning behind the rule itself is less clear to me. Could you report the actual correlations and flip decisions for each dataset and seed?
Reviewer_7SPyOpenReview ↗
Rating
2
Confidence
3
Informativeness
2
Presentation
3
Soundness
2
Read review
Paper summary

This paper proposes RALFlow-GAD for unsupervised graph anomaly detection. It combines graph autoencoder embeddings with global and local residuals, prototype conditioning, and latent flow matching. Anomaly scores use a single Euler step followed by score orientation correction. Experiments on five datasets report higher average AUROC and lower runtime than DiffGAD.

Critical strengths

S1. The paper reports the highest average AUROC, with clear gains on Disney and Enron.

S2. Runtime is consistently lower than DiffGAD on the same GPU.

Critical weaknesses

W1. For the free field, one Euler step returns the latent mean at the ideal optimum. Both flow models use the same regression targets, with one conditioned on a fixed prototype. The benefit over a mean reference or a second free field remains unclear.

W2. Score orientation raises average AUROC from 0.451 to 0.727, close to the full model’s AUROC 0.730. However, equivalent score processing is not evaluated for GAE or DiffGAD. In addition, standardizing each latent dimension should cancel residual scaling, making its reported effect in Figure 2(e) difficult to explain.

Questions for authors

Q1. How does one Euler step compare with decoding the latent mean under the same scoring procedure?

Q2. Does prototype conditioning outperform a second free field trained with the same targets?

Q3. Do the gains over GAE and DiffGAD remain with the same score smoothing and orientation correction?

Q4. How does residual scaling retain its effect after each latent dimension is standardized?

2 comments

Thanks to the authors for the detailed response and additional experiments. Q4 is resolved, and Q1-Q3 are partly addressed, though the gains from the flow and prototype components are still small. The direction is promising, but I will maintain my score for now.

Thank you for your follow-up and for carefully considering our response and additional experiments. Could you please clarify which specific aspects of Q1–Q3 you feel remain unresolved, and what additional evidence or clarification would be most helpful in assessing these components’ contributions? This would help us address your remaining concerns more directly.

From OpenReview, CC BY 4.0. Authors as signed there; shown unedited.

Related papers

Loading the map…

Discussion (0)

Sign in to comment.