acceptodds
Withdrawn from ICLR 2027

DDGAD: DISAGREEMENT-DRIVEN GRAPH ANOMALY DETECTION VIA ADAPT-THEN-COMBINE

Withdrawn from ICLR 2027, so left out of the paper lists and the map.

Abstract

Graph anomaly detection (GAD) commonly relies on message passing to jointly encode node attributes and neighborhood context. However, once the two are mixed, an abnormal post-encoding state may reflect either an intrinsic node deviation or incompatible contextual influence, making its source ambiguous. We propose Disagreement-Driven Graph Anomaly Detection (DDGAD), which treats persistent incompatibility between node-wise and contextual estimates as anomaly evidence. Inspired by Adapt-Then-Combine (ATC), DDGAD reverses its consensus objective: Adapt produces a node-wise estimate without new same-step neighbor aggregation, while Combine forms a neighborhood-dependent contextual estimate, and their pre-consensus disagreement is accumulated across ATC steps for detection. We further characterize this signal from graph-spectral and source-response perspectives and derive sufficient conditions for anomaly–normal separation under contextual mixing. Experiments on six benchmarks show the highest average AUROC among the evaluated methods, while controlled interventions and Adapt-operator controls further support persistent disagreement as an effective detection signal.

Primary area:
unsupervised, self-supervised, semi-supervised, and supervised representation learning
Keywords:
Graph Anomaly Detection, Adapt-Then-Combine, Node-Context Disagreement, Diffusion Models

Reviews

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

This paper proposes DDGAD, an unsupervised graph anomaly detection framework that explicitly models disagreement between node-wise estimates and neighborhood contextual estimates. The authors argue that conventional GNN-based methods jointly encode node attributes and neighborhood information, potentially obscuring node–context incompatibility as an anomaly signal. Inspired by the Adapt-Then-Combine (ATC) paradigm, DDGAD first obtains graph-conditioned node representations using a GCN autoencoder. A diffusion-based Adapt operator then produces node-wise estimates, while a uniform Combine operator aggregates neighboring estimates to construct contextual references. The discrepancy between these two estimates is accumulated over multiple ATC iterations to produce anomaly scores. The paper provides theoretical analyses of the disagreement signal, including its graph-spectral interpretation, sufficient conditions for anomaly–normal separation, and stochastic concentration properties. Experiments on six graph anomaly detection benchmarks show the highest average AUROC among the evaluated methods. Additional ablation studies and controlled context-source interventions investigate the effectiveness of disagreement-based scoring and the role of different Adapt operators.

Critical strengths

Explicit and interpretable disagreement-based anomaly scoring

The paper provides a clear and interpretable perspective on graph anomaly detection by explicitly measuring disagreement between node-wise and neighborhood contextual estimates. Rather than relying solely on reconstruction errors or jointly encoded representations, DDGAD directly uses node–context incompatibility as anomaly evidence. This formulation offers an intuitive interpretation of the detection signal and is supported by theoretical analyses of its spectral and structural properties.

Controlled intervention experiments provide useful mechanism-level evidence

The controlled context-source intervention experiments are a valuable aspect of the paper. By fixing node-side representations and matching the number of added edges, the authors isolate the effect of anomalous versus normal contextual sources on disagreement scores. The consistently positive source-specific responses provide meaningful evidence that the proposed signal captures contextual incompatibility rather than merely reflecting changes in node degree

Critical weaknesses

Limited methodological novelty and insufficient justification of the full ATC framework

The methodological novelty appears somewhat limited. The core disagreement score is essentially the difference between a node representation and the average representation of its neighbors, which is closely related to existing neighborhood-consistency and graph-smoothness measures. Although the paper introduces an iterative Adapt-Then-Combine interpretation, it remains unclear whether the full framework provides substantial benefits beyond simpler disagreement-based detectors. In particular, the current ablations do not adequately isolate the contribution of Fuse and iterative state evolution from repeated stochastic averaging. The strong performance of Identity and Linear Adapt operators further raises questions about whether the computationally expensive diffusion-based Adapt is essential to the proposed method. This concern is important because the paper's primary contribution rests on the proposed disagreement-driven ATC mechanism, whose added value over simpler formulations has not been sufficiently established.

Inconsistent benchmark performance and limited empirical justification for computational complexity

Despite achieving the highest average AUROC across six benchmarks, DDGAD does not demonstrate consistently superior performance. It ranks first on only two datasets and substantially underperforms simpler baselines on both Amazon benchmarks. The absolute AUROC on Reddit is also relatively modest. Moreover, the diffusion-based Adapt operator incurs significantly higher inference costs than the simpler alternatives. The reported Adapt-operator comparisons are limited to Disney, leaving unclear whether the additional computational overhead consistently translates into meaningful improvements across datasets. Consequently, the empirical results do not yet provide sufficiently strong evidence that the proposed framework offers a compelling performance–complexity trade-off over existing graph anomaly detection approaches.

Questions for authors
  1. What is the additional benefit of iterative ATC over simple disagreement scoring?
  2. How consistently does diffusion-based Adapt outperform simpler alternatives across benchmarks?
  3. How does the method behave when anomalies are context-compatible?
Reviewer_WTKwOpenReview ↗
Rating
2
Confidence
3
Informativeness
2
Presentation
3
Soundness
2
Read review
Paper summary

This paper studies unsupervised graph anomaly detection and proposes a model termed DDGAD. Starting from frozen graph-autoencoder embeddings, it alternates node-wise diffusion adaptation with neighborhood averaging and fusion, and scores nodes by accumulated pre-fusion disagreement. The paper provides conditional theoretical analysis and evaluates detection on six graph benchmarks.

Critical strengths

The motivation is easy to follow, and retaining disagreement gives an interpretable detection signal. The performance and ablations are encouraging. I also appreciate that the source interventions match added degree, which helps distinguish the effect of context composition from simply adding connections.

Critical weaknesses

My main concern is what persistent ATC adds to established local inconsistency scoring. GADAM (ICLR '24, boosting graph anomaly detection with adaptive message passing) already separates local inconsistency modeling from message passing. MI-GAD (AAAI '26, Beyond local patterns: multiscale inconsistency learning for graph anomaly detection), similarly addresses aggregation obscuring anomaly signals, which is not discussed. The ATC construction is different, but the paper needs a better/clearer way for its additional (novelty) value. The experiments do not quite settle this. Table 2 shows that disagreement helps relative to reconstruction and denoising-deviation scores. Fig. 3 includes single-step and multi-step results, but changing K also changes the amount of stochastic sampling. Comparing stateful ATC with independent denoising and score averaging from fixed embeddings would be helpful.

Questions for authors

Please see the weaknesses.

Reviewer_WqVZOpenReview ↗
Rating
1
Confidence
4
Informativeness
1
Presentation
2
Soundness
2
Read review
Paper summary

This paper presents DDGAD, an unsupervised graph anomaly detection framework combining a GCN autoencoder, an EDM-based node-wise Adapt operator, and neighborhood averaging through an Adapt–Then–Combine procedure. Anomaly scores are obtained by accumulating disagreement between adapted node representations and their neighborhood estimates. The paper provides spectral and conditional separation analyses, evaluates six graph benchmarks, and includes signal ablations, Adapt-operator controls, and post-encoding context-source interventions.

Critical strengths

The paper explicitly formulates its disagreement score and acknowledges several limitations, including graph-conditioned initialization, contaminated-population denoiser training, and failure cases involving isolated nodes or coherent anomalous neighborhoods. The degree-matched source intervention is a useful attempt to distinguish source composition from additional connectivity. The five-seed main results also show an improvement in average AUROC over the evaluated baselines.

Critical weaknesses
  1. The methodological novelty is insufficiently established. The central score, (I−W)Ψ(k)(I-W)\Psi^{(k)}, is a graph Laplacian residual; with Identity Adapt, the framework reduces to iterative neighborhood smoothing and residual accumulation. The paper does not convincingly establish a substantive advance beyond combining existing autoencoding, denoising, and graph inconsistency scoring. The theoretical analysis mainly characterizes this residual under favorable assumptions, without establishing why the proposed training procedure produces the geometry required for anomaly separation.

  2. The experiments do not sufficiently validate the proposed framework over simpler alternatives. The signal ablations cover only Books and Disney, while the Adapt-operator comparisons are restricted to a single checkpoint on Disney, a graph containing only 124 nodes and approximately six anomalies. These results do not establish whether diffusion and recurrent ATC provide consistent benefits across datasets, particularly given EDM’s substantially higher computational cost. Furthermore, closely related methods highlighted in Section 2.2—including DualGAD, DC-AES, and GRAM—are absent from the main comparison, leaving the claimed contribution insufficiently evaluated.

Questions for authors
  1. What is the substantive technical contribution beyond iterative Laplacian-residual scoring? Please explain the distinction using the Identity-Adapt reduction, and clarify which capability cannot be obtained through simpler graph filtering and residual aggregation.

  2. Do the benefits of EDM and recurrent ATC persist across datasets and seeds? Please extend the matched Adapt controls beyond Disney and compare single-step scoring, repeated denoising without recurrent Fuse, and the proposed persistent ATC score under the same initialization and evaluation protocol.

  3. How were the baselines configured and selected? Please provide their implementation sources, hyperparameter search spaces, selection criteria, and training budgets, and address the absence of the closely related methods highlighted in Section 2.2.

  4. Are the sufficient conditions in the separation analysis satisfied empirically? Please examine whether the prototype separation and node/context error terms yield informative margins along the actual learned trajectories, and whether additional iterations preserve or reduce these margins.

  5. Does source sensitivity translate into better detection by the complete model? Please complement the frozen-reference intervention with a limited evaluation allowing the modified context to affect the actual inference trajectory, reporting ranking metrics and outcomes for isolated nodes and coherent anomalous neighborhoods.

  6. How do the framework figures correspond to the actual computation? Figure 1 suggests independently evolving Adapt and Combine trajectories, whereas Eqs. (3)–(5) describe estimates coupled through a shared fused state. Figure 2 also connects the score box to the encoded initialization without showing the residual accumulation required by Eq. (10). Could the authors clarify these dependencies and explain how the diagrams map onto the inference algorithm?

  7. Can the experimental figures and ablations adequately support the claimed benefits of the framework? Figure 3 omits Tolokers despite referring to all datasets and provides no variability estimates. Meanwhile, the signal ablations cover only two datasets, and the Adapt-operator comparison is restricted to one checkpoint on Disney. Could the authors provide complete, readable sensitivity plots with uncertainty estimates and broader controlled comparisons establishing the contributions of diffusion, recurrent fusion, and persistent scoring?

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

Related papers

Discussion (0)

Sign in to comment.