acceptodds
Withdrawn from ICLR 2027

AELAD: Adaptive Evidential Learning for Anomaly Detection in Dynamic Graphs

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

Abstract

Dynamic graphs are pervasive in real-world scenarios such as financial transactions and social networks, making the detection of anomalous nodes a problem of significant practical importance. However, existing methods predominantly adopt a point estimation paradigm. They lack uncertainty awareness and cannot quantify the reliability of anomaly predictions under sparse histories or highly variable node behaviors. Furthermore, feature-based anomalies and structure-based anomalies are inherently heterogeneous signals whose naive fusion degrades detection performance due to inconsistent scales. To address these challenges, we propose AELAD, a framework for anomaly detection in dynamic graphs based on adaptive evidential learning. Specifically, AELAD employs an evidential learning mechanism that enables the model to output distributional parameters rather than point estimates. Moreover, a Normal-Inverse Gamma (NIG) distribution and a Beta distribution independently model feature and topological uncertainty, and the resulting scores are adaptively fused via learnable weights. Extensive experiments on six benchmark datasets demonstrate that AELAD achieves superior anomaly detection performance compared to state-of-the-art baselines.

Primary area:
learning on graphs and other geometries & topologies
Keywords:
Dynamic Graphs, Anomaly Detection, Evidential Learning, Uncertainty Quantification, Adaptive Fusion

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_ZYLYOpenReview ↗
Rating
2
Confidence
3
Informativeness
2
Presentation
2
Soundness
2
Read review
Paper summary

This paper presents AELAD for node anomaly detection in dynamic graphs. The method combines a temporal graph encoder with two evidential learning branches. One uses a Normal-Inverse-Gamma model to capture drift between node embeddings and memory representations; the other uses a Beta model to estimate edge existence. Learnable scalar weights combine the uncertainty scores from these branches with contrastive deviation scores. The evaluation includes four real-world datasets and two semi-synthetic datasets, with eleven baselines and results averaged over ten runs. AELAD achieves the highest mean ROC-AUC on all six datasets. The paper also includes component ablations, robustness tests under training-data perturbations, and an efficiency analysis.

Critical strengths
  1. The motivation is practically relevant, and the modeling approach is sound. Distinguishing behavioral deviation from uncertainty matters in dynamic graph analysis, especially for nodes with sparse histories or highly variable normal behavior. Using separate evidential branches for continuous drift and binary connectivity is a reasonable way to account for their different statistical properties.

  2. The method shows consistent gains across benchmarks, supported by repeated-run evaluation. AELAD achieves the highest mean ROC-AUC on all six datasets, with means and standard deviations reported over ten runs. Some gains are substantial: it outperforms the strongest listed baselines by 2.92 percentage points on Wikipedia and 4.88 percentage points on Bitcoin-alpha. The ablation and perturbation experiments provide further evidence that the evidential components contribute to the reported performance.

Critical weaknesses
  1. The methodological contribution is incremental, and its broader significance is not sufficiently established. The framework combines temporal memory and attention, contrastive learning, established evidential distributions, and scalar score fusion. The paper discusses prior work on graph evidential learning, particularly GEL. Still, it does not clearly identify what new capabilities or insights the proposed dynamic-graph formulation offers beyond adapting existing evidential components. The ablations remove individual branches or evidential learning modules. They do not compare the proposed fusion with fixed-weight or normalized score fusion, or show an advantage over simpler uncertainty heads using the same temporal backbone. The results support the effectiveness of this combination more clearly than a substantial methodological advance.

  2. The evaluation does not directly verify the central claim of improved prediction reliability. The main motivation is to distinguish genuinely anomalous nodes from uncertain but normal nodes, such as cold-start nodes or those with highly variable behavior. The evaluation focuses on aggregate ROC-AUC, including under training-data perturbations. It does not directly assess the quality of uncertainty estimates or report false-positive rates for these challenging groups of normal nodes. Since uncertainty scores are added to the final anomaly score, any reduction in these false alarms needs explicit verification; it does not follow from introducing uncertainty estimation alone. With anomaly rates of just 0.14% on Wikipedia and 0.05% on Reddit, precision–recall metrics or metrics at a fixed alert budget would better demonstrate the practical value of the gains.

Questions for authors
  1. What accounts for the performance gains beyond combining existing components? Can you compare the method with simpler uncertainty heads and fixed-weight or normalized score fusion using the same backbone? Please clarify how the fusion weights in Eq. (21) are learned. They enter the anomaly score, but their connection to the training objective in Eq. (23) is unclear from the equations. These comparisons and implementation details would directly affect my assessment of the adaptive fusion contribution.

  2. Does AELAD reduce false alarms on normal nodes with high uncertainty? Can you report false-positive rates separately for cold-start normal nodes and normal nodes with highly variable behavior at matched recall, along with PR-AUC or precision at a fixed alert budget? An analysis of whether the uncertainty scores identify unreliable predictions would help verify the reliability gains beyond aggregate ROC-AUC.

Reviewer_RFvzOpenReview ↗
Rating
2
Confidence
3
Informativeness
2
Presentation
1
Soundness
1
Read review
Paper summary

This paper proposes AELAD for node anomaly detection in dynamic interaction graphs. A temporal memory and attention backbone produces node embeddings, which are used by two evidential branches. The feature branch predicts Normal-Inverse-Gamma parameters for a scalar embedding–memory residual, while the topology branch predicts Beta parameters using observed and negatively sampled edges. Four uncertainty components are combined with recovery and drift contrastive scores to obtain the final anomaly score.

Critical strengths

Distinguishing behavioral deviation from uncertainty about that deviation is meaningful for dynamic anomaly detection, particularly for nodes with sparse histories or highly variable behavior. Modeling continuous residuals and discrete connectivity separately is a reasonable starting point.

Critical weaknesses

1、My biggest concern is Eq. (14), the definition of Ω\Omega does not match the standard NIG marginal likelihood. If we take the equation as written, the resulting expression does not define a normalizable predictive density. Since this loss is central to the proposed evidential learning framework, the authors need to provide the exact implementation and clarify whether the reported results were obtained using the printed equation or a corrected version.

2、The two KL regularizers in Eq. (16) are named but never fully defined. I am not told which distributions are compared, which reference priors are used, or how the penalties depend on prediction errors.

3、Authors present adaptive fusion as a main contribution, but I cannot find a training signal for its weights. The four fusion weights appear in the anomaly score in Eqs. (21)–(22), while the training objective in Eq. (23) and its constituent losses do not include them. 4、Several central components closely resemble those in GEL[1] and SLADE, so author needs a clearer comparison with a direct combination of these ideas.

5、On Synthetic-Hijack and Synthetic-New, the non-evidential version already outperforms the reported SLADE baseline by 13.83 and 13.51 AUC points, respectively. Adding evidential learning contributes a further 1.04 and 0.89 points (Table 1 and Figure 3). This suggests that much of the overall gain comes from other changes that are not clearly explained.

6、Figure 2 shows a Beta-density loss containing terms such as log⁡y\log y and log⁡(1−y)\log(1-y), while the target is a binary edge-existence label. Substituting y=0y=0 or y=1y=1 introduces log⁡0\log 0, so this expression generally does not produce a finite training loss without additional treatment. However, Eq. (15) uses binary cross-entropy on the predicted Beta mean, corresponding to a Beta–Bernoulli predictive likelihood. These are different objectives, not interchangeable ways of writing the same loss. The authors need to clarify which one was actually implemented and reconcile the diagram with the equations.

[1] Graph Evidential Learning for Anomaly Detection. KDD 2025.

Questions for authors

See weakness

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

The paper proposes AELAD for unsupervised node anomaly detection on continuous-time dynamic graphs. It builds on a memory-based temporal graph encoder with SLADE-style recovery and drift contrastive scores. On top of this it adds a NIG head that regresses the distance between embedding and memory, and a Beta head for edge existence. Four uncertainty terms from these heads are combined with learnable weights and added to the contrastive score. Experiments on six datasets report the best AUC against 11 baselines, together with an ablation, a robustness study and a hyperparameter grid.

Critical strengths

The question of how reliable an anomaly score is for new or highly active nodes is practically relevant. The authors also released code and data, which made it possible to check the results.

Critical weaknesses
  1. The evidential part does not affect the results in the released code. The evidential loss is commented out in TAD_main.py (line 165), so only the contrastive loss is trained. I checked: the evidence heads and the fusion weights do not change at all during training. In evaluation.py the uncertainty term is added with weight 1e-4 after per-batch min-max normalization, while the paper says 0.05. When I ran the released code with the paper's settings on Bitcoin-alpha (single seed), I got about 76 AUC, not 80.62. This is close to SLADE's published 76.32. Adding the uncertainty term lowered AUC in every epoch. Given this, the ablation in Figure 3, where removing evidential learning costs up to 2.9 points, is hard to understand. A few other parts of the code also differ from the method section. The NIG target is the full residual vector rather than its norm. The Beta head is trained only on positive edges. The attention query is a constant time encoding rather than the node memory.

  2. The sensitivity study and model selection are not reliable. In TAD.py the loss weights are hard-coded (0.3, 0.7, 0.99, 0.01), and the zeta and eta arguments are never used. Running with (0, 0) and (1, 1) gives identical results, so the variation in Figure 5 can only be run-to-run noise. Figure 5 also disagrees with the text. On both synthetic datasets, zeta = 0 is the best or close to the best, and the best Synthetic-Hijack cell (96.38) is lower than the Table 1 mean (97.21). There is no validation split. The search script picks the highest test AUC over all epochs, yet the figure calls it validation AUC.

  3. Novelty is limited and the core idea is not consistent. The backbone, the contrastive losses and the score follow SLADE (KDD 2024). The two evidential heads, the four uncertainty terms, their names and the weighted fusion follow GEL (KDD 2025). Neither debt is made clear. Evidential plus contrastive learning on dynamic graphs has also appeared before, e.g. EviSEC (arXiv 2506.07417). Even on paper, the fusion weights cannot be learned, because the uncertainty score does not appear in any loss. More fundamentally, the motivation says new and highly variable nodes are wrongly flagged. These are exactly the nodes that should get high uncertainty, so adding uncertainty to the anomaly score should make that problem worse, not better. The "feature" branch also uses no node features, and its target largely repeats the recovery score.

  4. The strongest baseline is reported well below its own paper. On the same data files, SLADE reports 98.08 and 98.38 AUC on Synthetic-Hijack and Synthetic-New, but this paper gives 82.34 and 78.66. On Bitcoin-alpha and OTC the paper gives 73.68 and 72.74 versus 76.32 and 75.80. With SLADE's published numbers, SLADE beats AELAD on both synthetic datasets, and SLADE-HP beats it on Reddit. Only AUC is reported, although the anomaly ratio is as low as 0.05%.

Questions for authors
  1. Which code produced Table 1 and Figures 3 to 6? In the released code the evidential loss is not trained and the uncertainty weight is 1e-4.
  2. How was Figure 5 produced, given that zeta and eta are not connected to the loss in the code?
  3. How were the SLADE numbers obtained, and why are they far below those in the SLADE paper on the same data?
  4. How were epochs and hyperparameters chosen without a validation set?
  5. Can you show that adding uncertainty reduces false positives on new or highly active nodes, rather than increasing them?

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

Related papers

Discussion (0)

Sign in to comment.