acceptodds
Under review as a conference paper at ICLR 2027

Temporally Contextualized Supervision for Dynamic Graph Anomaly Detection

Abstract

Dynamic graph anomaly detection aims to identify abnormal behaviors in evolving interaction streams. Existing methods often rely on point-level evidence scores, such as drift scores that capture abnormal temporal deviations in interaction patterns or node representations, and reconstruction scores that measure reconstruction inconsistency with historical graph states. Although such point-level evidence scores can characterize abnormality-related signals, using them as isolated training signals assumes that the evidence for an anomaly is temporally aligned with the observed label at the same interaction. In this work, we show that this assumption does not always hold in dynamic graphs: the evidence associated with an annotated anomaly may emerge before the labeled interaction, persist around it, or extend beyond it, leading to an evidence–label temporal mismatch. To address this issue, we propose TECOS, a temporally contextualized supervision framework for dynamic graph anomaly detection. Instead of applying supervision to isolated point-level evidence, TECOS uses short-range source-wise history together with source- and destination-side representations to learn a bounded correction to a reconstruction–drift base score, better aligning supervision with temporally misaligned anomaly evidence. We further provide empirical and theoretical analyses to characterize when point-level learning remains sufficient and when temporal context becomes beneficial. Experiments on seven temporal interaction datasets show that TECOS achieves the best overall performance across AUC and AP, demonstrating the effectiveness of temporally contextualized supervision.

Primary area:
learning on graphs and other geometries & topologies
Keywords:
dynamic graph anomaly detection, temporal graph learning, temporal contextualization

Reviews

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

This paper aims to address the limitation of point-level evidence scores, namely drift scores and reconstruction scores, which are often temporally misaligned with anomaly labels. The paper proposes a two-stage approach consisting of a base prediction and a bounded correction residual. Experiments on various temporal interaction datasets validate the effectiveness of the proposed approach.

Critical strengths
  1. The issue of evidence-label mismatch in dynamic graph anomaly detection is well identified, and the paper provides theoretical claims and proofs to support this observation. This helps clarify the limitation of point-level evidence scores and provides a solid motivation for the proposed method.

  2. The paper is well organized and easy to read, with a clear logical structure that makes both the motivation and the technical details accessible to readers.

Critical weaknesses
  1. Figure 1 does not explicitly show the evidence-label mismatch. Instead, this part appears on the far right, making the sentence "As illustrated in Figure 1,..." difficult to follow. Since this mismatch is the central motivation of the paper, separating it into a new figure would help readers understand the problem more directly and better appreciate the need for the proposed approach.

  2. The architectures of the dynamic graph encoders used for drift scores and reconstruction scores are not clearly stated, which makes it difficult to understand how these two types of scores are computed. In addition, the reason for describing the encoder as memory-based is unclear. The underlying rationale for the base prediction should be elaborated, for example, what is stored in the memory, how it evolves, and how it contributes to the prediction.

  3. For the bounded correction, the features are simply concatenated, with insufficient explanation of why this is reasonable. It would be helpful to discuss the role of each feature and to justify why concatenation is adopted rather than other fusion strategies.

  4. The computation of the stage-1 score bib_i is not provided. The authors should specify how bib_i is computed from the two point-level evidence scores.

Questions for authors
  1. Could the authors clarify whether the model is trained in an end-to-end manner?

  2. In the problem setup, the meaning of the source-side label yiy_i is unclear. Could the authors clarify whether it is the anomaly label?

  3. For a new dataset, how is the number of preceding events HH determined? The sensitivity experiments indicate that anomaly-related temporal patterns occur at different local scales across datasets, so it would be helpful to explain how HH is chosen in practice.

8 comments

We have separated the motivation from the framework and added quantitative analysis across seven datasets. The revised Figure 1 is a standalone motivation figure in the Introduction, while Figure 2 presents the framework. Figure 1(a) illustrates the three evidence–label mismatch patterns.

Figure 1(b) analyzes base-score peak locations within the current event and its two preceding same-source events, using the original observed labels without imposed delays. Historical peaks account for 36.07%–65.25% of eligible positively labeled test events, averaged over three seeds. This quantifies how observed positive labels can occur at positions other than the local maximum of anomaly evidence.

AuthorsOpenReview ↗

W2: Encoder architecture, the role of memory, and the base score

Reconstruction and drift share one memory-based encoder following SLADE [1]. They measure two forms of consistency within the same architecture.

1. A persistent memory summarizes each node’s interaction history

Each node maintains a memory vector that summarizes its interaction partners and timing. Interactions are processed chronologically: an MLP constructs messages from the other endpoint’s memory and elapsed-time encoding, and a GRU combines these messages with the node’s previous memory. Both endpoints are updated through this procedure.

The encoder is memory-based because these node states persist across interactions and accumulate historical information. Temporal attention additionally reconstructs a node’s memory from historical neighbor memories and relative-time encodings.

2. Reconstruction and drift compare different aspects of consistency

ScoreCompared representationsMeaning of low compatibility
ReconstructionMaintained memory mim_i and reconstructed memory m^i\hat m_iAccumulated behavior agrees poorly with recent neighborhood context
DriftCurrent memory mim_i and reference memory mi′m'_i (the node’s memory before the current update)The updated state agrees poorly with its pre-update state

The scores are

=\widehat I(\hat m_i,m_i;\mathcal N^-), \qquad c_i^{\mathrm{drift}} =\widehat I(m_i,m'_i;\mathcal N^-).$$ The compatibility measure $\widehat I$ in Section 4.1 contrasts the paired vectors’ cosine similarity with similarities to negative node memories. Stage-1 training encourages agreement in both comparisons without anomaly labels. **Low compatibility therefore provides evidence of departure from the learned behavioral pattern.** **3. Memory contributes through base scoring and temporal correction** **Base scoring.** The two compatibility scores determine the base anomaly score: $$b_i=1-\operatorname{clip}_{[0,1]}\left(\frac{c_i^{\mathrm{rec}}+c_i^{\mathrm{drift}}}{M_{\mathrm{rec}}+M_{\mathrm{drift}}}\right).$$ Each scale $M_q$ uses the training-set 95th percentile of its corresponding score, with a lower bound of $10^{-8}$. These scales stay fixed during validation and testing. **Low compatibility produces a high base anomaly score.** **Temporal correction.** The maintained and reconstructed memories of both endpoints enter Stage 2 alongside the two compatibility scores. The correction module uses these features from the current event and preceding same-source events to learn a bounded adjustment to the base prediction. [1] Lee et al. *SLADE: Detecting Dynamic Anomalies in Edge Streams without Labels via Self-Supervised Learning.* KDD 2024. https://arxiv.org/abs/2402.11933
AuthorsOpenReview ↗

W3: Feature roles and the rationale for concatenation

1. What the features represent and how they are fused

The correction module combines two types of information: the reconstruction and drift MI scores, which summarize reconstruction compatibility and temporal consistency, respectively; and the current and reconstructed endpoint memory representations, which retain richer information about the interacting nodes.

Concatenation followed by a learned projection provides learnable linear fusion. Specifically, we compute

hi=W[ei;pi]+b=Weei+Wppi+b,\mathbf{h}_i = W[\mathbf{e}_i;\mathbf{p}_i] + \mathbf{b} = W_e\mathbf{e}_i + W_p\mathbf{p}_i + \mathbf{b},

where ei\mathbf{e}_i contains the two standardized MI scores and pi\mathbf{p}_i contains the standardized endpoint representations. Concatenation makes both available to a shared 64-dimensional projection, with WeW_e and WpW_p learning their respective contributions.

This provides a simple way to retain the two precomputed evidence summaries alongside the endpoint representations. Including the MI scores requires only two additional input coordinates, and the projection can reduce their contribution when the endpoint representations already provide sufficient information. The resulting event representations are then processed by the temporal Conv1D.

2. Feature ablations and alternative fusion

We evaluated feature contributions through two input ablations. Evidence-only supplies only the MI scores to the correction module, while Memory-only supplies only the endpoint representations. Both variants retain the MI-derived base score bib_i. We also evaluated evidence-guided cross-attention as an alternative fusion strategy, using the MI scores to attend to the endpoint representations. The temporal Conv1D and bounded correction mechanism remain unchanged.

All variants share frozen Stage-1 features, the temporal window, and training budget. We use the same configurations as in the main experiments, select checkpoints based on validation performance, and report test mean ± standard deviation over three seeds.

Test AP (%):

DatasetEvidence-onlyMemory-onlyConcat (TECOS)Cross-attention
Wikipedia1.41 ± 0.161.64 ± 0.171.70 ± 0.211.61 ± 0.28
Reddit0.26 ± 0.040.31 ± 0.060.31 ± 0.080.33 ± 0.06
BitcoinAlpha15.28 ± 0.3315.52 ± 0.4215.69 ± 0.2414.93 ± 0.57
BitcoinOTC19.99 ± 0.0522.38 ± 0.8022.34 ± 0.8322.67 ± 0.69
MOOC2.38 ± 0.042.80 ± 0.022.79 ± 0.012.66 ± 0.03
EU-Core22.34 ± 2.3855.06 ± 4.4453.08 ± 3.9755.12 ± 4.04
Email-DNC48.47 ± 0.6887.20 ± 0.2787.13 ± 0.2182.04 ± 2.25

Test AUC (%):

DatasetEvidence-onlyMemory-onlyConcat (TECOS)Cross-attention
Wikipedia86.61 ± 0.4287.67 ± 0.9987.66 ± 0.9387.36 ± 0.82
Reddit73.14 ± 1.0172.42 ± 1.3873.22 ± 1.3673.85 ± 1.45
BitcoinAlpha76.28 ± 0.2278.16 ± 0.0778.24 ± 0.0376.93 ± 0.84
BitcoinOTC75.84 ± 0.1076.73 ± 0.3276.72 ± 0.3476.47 ± 0.56
MOOC62.43 ± 0.3770.43 ± 0.2970.69 ± 0.5569.58 ± 0.59
EU-Core74.97 ± 4.0492.41 ± 0.3792.27 ± 0.2292.29 ± 0.25
Email-DNC92.30 ± 0.2698.31 ± 0.0598.31 ± 0.0497.69 ± 0.29

3. What the results show

The endpoint representations provide effective features for temporal correction, while MI scores also contribute through the base prediction. Adding endpoint representations to Evidence-only improves both mean AP and mean AUC on all seven datasets. Memory-only performs close to the full input, indicating that the endpoint representations retain substantial information useful to the correction module.

Memory-only still uses the MI-derived base score bib_i. The MI scores therefore continue to influence the final prediction even when they are omitted from the correction inputs. Removing the base score lowers AP on six of seven datasets (Table 4), supporting its contribution. The full-input design additionally exposes the two MI summaries directly to the correction module, where their weights are learned jointly with those of the endpoint representations.

Concatenation followed by a learned projection is competitive with the cross-attention alternative. It achieves higher mean AP on four of seven datasets and higher mean AUC on five of seven datasets. On Email-DNC, its mean AP is 5.09 percentage points higher (87.13% versus 82.04%).

These results support our choice of concatenation followed by projection: it combines both feature families through learned weights without an additional attention module, while cross-attention provides no consistent performance advantage under the matched experimental configuration.

Reviewer_CbH5OpenReview ↗
Rating
2
Confidence
2
Informativeness
2
Presentation
2
Soundness
2
Read review
Paper summary

This paper investigates the problem of evidence–label temporal mismatch in dynamic graph anomaly detection (DGAD). The authors argue that anomaly-related evidence may emerge before an observed anomaly label, persist around it, or remain after the labeled interaction. To address this issue, the paper proposes TECOS, a two-stage framework. In the first stage, a memory-based dynamic graph encoder extracts reconstruction and temporal drift evidence and produces a base anomaly score. In the second stage, the model incorporates the current interaction and recent interactions of the same source node, together with source- and destination-side memory representations. A lightweight Conv1D network is then used to predict a bounded residual correction to the base anomaly score, trained using weighted binary cross-entropy on observed event labels. The paper provides theoretical analyses of delayed-label supervision and the potential benefits of temporal context. Experiments on seven temporal interaction datasets, including controlled label-delay experiments and ablation studies, show improvements over several representative baselines in terms of AUC and AP.

Critical strengths

The paper addresses an interesting and practically relevant issue in dynamic graph anomaly detection: the temporal mismatch between anomaly evidence and observed labels. TECOS proposes a simple and lightweight framework that combines reconstruction–drift evidence with temporal residual correction using historical interactions. Experiments on seven datasets, including comparisons with representative baselines, label-delay experiments, and ablation studies, demonstrate encouraging improvements in AUC and AP, suggesting the practical value of temporal contextualization for anomaly detection.

Critical weaknesses
  1. Unclear connection between motivation and learning objective. Although the paper aims to address temporal mismatch between latent anomaly states and observed labels, TECOS is still trained using BCE on observed labels. Proposition 3.2 only establishes improved prediction of delayed labels, not better identification of the underlying anomaly states. Therefore, it remains unclear whether TECOS truly mitigates temporal misalignment or simply predicts observed labels more accurately.
  2. Insufficient evidence for the effectiveness of temporal alignment. The improvements may result from additional historical features rather than explicitly addressing temporal misalignment. For example, on Email-DNC, TECOS improves AP from 84.21% (Current-only) to 87.13%, suggesting that explicit temporal contextualization contributes only part of the overall gain. Moreover, the label-delay experiments discard many positive samples (e.g., Email-DNC drops from 589 to 34 test positives at delay 3), substantially changing the evaluation distribution. These issues weaken the evidence that the improvements specifically come from mitigating temporal mismatch.
Questions for authors
  1. Clarification of the prediction objective. The paper motivates TECOS by introducing a distinction between the latent anomaly state and the observed event label. However, Stage 2 remains supervised by the observed labels. Could the authors clarify whether the intended objective is to improve the prediction of observed, potentially delayed labels or to better identify the underlying anomalous behavior at its actual occurrence time? What evidence supports the latter interpretation, if intended?
  2. Evidence for the temporal-misalignment mechanism. Can the authors provide a more systematic analysis of the evidence–label mismatch patterns shown in Figure 1? In particular, how frequently do such patterns occur in the evaluated datasets, and is there evidence that the improvement from temporal contextualization is correlated with the degree of temporal mismatch? This would help distinguish the proposed mechanism from the general benefit of additional historical information.
7 comments
AuthorsOpenReview ↗

W1 & Q1: Connection between temporal mismatch and the learning objective

TECOS is trained and evaluated to predict observed event labels at their recorded positions. BCE is therefore consistent with the task objective. Temporal mismatch can make current-event evidence insufficient when the evidence relevant to an observed label occurs at an earlier interaction. TECOS addresses this mismatch by learning how current and preceding same-source evidence supports the current observed target, without requiring recovery of the latent anomaly timestamp. The position-masking experiment below tests whether the learned positional reliance follows the imposed label delay.

Under the delayed-label model A~t=At−Δ\widetilde A_t=A_{t-\Delta}, predicting the observed label corresponds to estimating a historical anomaly state. Proposition 3.2 gives the reduction in optimal BCE risk as I(A~t;Nt(k)∣zt)I(\widetilde A_t; N_t^{(k)}\mid z_t), which under this model equals

H(At−Δ∣zt)−H(At−Δ∣zt−k:t).H(A_{t-\Delta}\mid z_t)-H(A_{t-\Delta}\mid z_{t-k:t}).

When the relevant offset lies within the window, the predictor can access evidence associated with that historical state. We report the prediction at the observed position tt. Appendix E.4 illustrates this evidence-selection mechanism in a simplified linear model.

Does the trained model track the imposed offset? We test this positional dependence on EU-Core and Email-DNC, where known anomaly-injection positions allow us to introduce controlled label delays. We shift positive labels forward by d=0,1,2d=0,1,2 same-source interactions and train a separate TECOS model for each delay with H=2H=2.

During evaluation, we zero one projected event vector at a time in the correction module. We keep the base-score branch unchanged and do not retrain the model. Within each delay condition, we compare full and masked inputs on identical test events and labels.

The table reports full-input AP (%) and AP decreases after masking, in percentage points, averaged over three training seeds. Larger decreases indicate greater reliance on the masked position.

DatasetDelay ddFull-input AP (%)Current masked1-step history masked2-step history masked
EU-Core053.0828.016.173.36
EU-Core146.3911.4913.693.82
EU-Core237.856.542.318.81
Email-DNC087.1338.621.09−0.22
Email-DNC115.870.703.34−0.13
Email-DNC26.130.970.433.19

Negative decreases indicate AP improvements. Bold values mark the largest mean AP decrease within each delay condition.

The position of the largest masking effect matches the imposed label delay in all six dataset–delay conditions. On both EU-Core and Email-DNC, the largest mean AP decrease occurs when masking the current event for d=0d=0, the one-step predecessor for d=1d=1, and the two-step predecessor for d=2d=2. On Email-DNC at d=2d=2, masking the two-step predecessor reduces AP by approximately 52% of its full-input value, compared with 16% when masking the current event’s representation in the correction module.

These results provide direct empirical evidence that TECOS learns a delay-dependent correspondence between anomaly evidence and observed supervision. The history window remains fixed at H=2H=2, while models trained under different delays rely most strongly on the position corresponding to the imposed offset. The experiment therefore demonstrates systematic adaptation of positional reliance to the supervision delay, beyond the performance comparison between current-only and contextual inputs.

Revisions. We have stated the prediction target explicitly in Section 2.2. We have revised the discussion following Proposition 3.1 and the takeaway in Appendix E.5 to distinguish observed-label prediction from latent timestamp recovery and to explain how current-event supervision can miss relevant historical evidence. We have also added the position-masking analysis to Section 5.4 and Appendix F.4 of the revised PDF.

AuthorsOpenReview ↗

W2: Benefits beyond additional historical features

1. Explicit contextualization improves an already history-aware model

The Current-only ablation measures the added value of explicit contextualization over an already history-aware model. It retains the history-aware graph encoder, reconstruction–drift evidence, base-score branch, and supervised correction architecture, removing only the neighboring-event inputs to Stage 2. The improvement from 84.21% to 87.13% AP on Email-DNC therefore demonstrates the additional contribution of explicit source-wise contextualization on top of these existing components.

The controlled label-delay experiments further demonstrate consistent advantages: across the 12 nonzero-delay settings, TECOS outperforms Current-only in mean AP in 11 settings and in mean AUC in 11 settings.

Mean pooling tests whether aggregating the same features without preserving their positions is sufficient. On Email-DNC at d=2d=2, H=2H=2, Tables 13–14 report:

MethodAUC (%)AP (%)
Current-only80.603.19
Mean pooling86.044.33
TECOS90.756.13

TECOS improves AP by 2.94 percentage points over Current-only, a 92.2% relative increase, and exceeds Mean pooling by 1.80 percentage points despite using the same historical inputs. Across all 12 nonzero-delay conditions, TECOS also achieves higher mean AP than Mean pooling in 11 conditions. These comparisons demonstrate an advantage from learning how historical evidence is aggregated, beyond making that evidence available.

The position-masking results connect this learned aggregation to the imposed supervision delay. As reported in our W1 response, the largest mean AP decrease occurs when masking the current event for d=0d=0, the one-step predecessor for d=1d=1, and the two-step predecessor for d=2d=2, on both EU-Core and Email-DNC. This correspondence holds across all six dataset–delay conditions. With the history window fixed at H=2H=2, the position of greatest predictive reliance tracks the imposed delay, providing direct empirical evidence of delay-dependent temporal evidence–label correspondence.

AuthorsOpenReview ↗

W2: Benefits beyond additional historical features

2. Gains extend to mixed delays with increased positive-label retention

All competing methods use identical transformed labels and event rows within each delay condition. The observed performance differences therefore cannot be attributed to unequal positive-label retention across methods. All method comparisons are made within the same transformed condition.

The protocol retains all interaction rows; positive labels shifted beyond their source-wise partition boundaries are not retained. We additionally evaluate heterogeneous delays by assigning each positive label an offset of 00, 11, or 22 with probabilities 10%/45%/45%.

On Email-DNC, this mixture retains 163 of the original 589 test positives, compared with 65 under fixed d=2d=2 and 34 under fixed d=3d=3. The mixed-delay setting therefore extends the evaluation to varying supervision offsets while retaining substantially more positive labels than these fixed-delay settings.

The transformation runs separately within the training, validation, and test partitions. All methods share the same transformed labels and event rows. Stage 1 stays frozen, and checkpoint selection uses validation AP on the transformed hard labels.

Test AP (%), mean ± standard deviation over three training seeds:

DatasetCurrent-onlyMean poolingTECOS
BitcoinAlpha5.42 ± 0.494.91 ± 0.086.25 ± 0.32
BitcoinOTC10.00 ± 0.397.72 ± 0.1410.02 ± 0.19
EU-Core30.60 ± 1.0730.39 ± 3.8434.53 ± 0.97
Email-DNC12.48 ± 0.5112.94 ± 0.3113.23 ± 0.12

TECOS outperforms both controls in mean AP and AUC on BitcoinAlpha, EU-Core, and Email-DNC. On BitcoinOTC, its AP is comparable to Current-only at 10.02% versus 10.00% and exceeds Mean pooling at 7.72%. Its AUC is lower at 67.12%, compared with 67.76% for Current-only and 67.45% for Mean pooling.

Channel contributions under the same mixed-delay protocol show a corresponding trend. On Email-DNC, the proportion of history-dominated channels rises from 47.9% under the 60%/20%/20% mixture to 77.6% under 10%/45%/45% and 86.5% under 0%/50%/50%. A channel is history-dominated when its largest mean absolute linear contribution comes from a historical position. As the mixture assigns more probability to delayed labels, a larger share of channels draws its strongest contribution from historical inputs.

3. The controls demonstrate benefits from learned temporal organization

The evidence combines improvements over a history-aware baseline, advantages over pooling of identical historical inputs, and positional reliance that tracks the imposed delay. The mixed-delay and channel analyses further show that TECOS adapts its use of historical evidence when supervision offsets vary across events. Together, these controlled experiments demonstrate benefits from both access to historical information and learning how that information supports the current observed label.

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

This paper identifies a potential issue in dynamic graph anomaly detection: anomaly labels are assigned to individual interactions and may fail to capture the temporal context of anomalous behavior. To address this, the paper incorporate historical interaction information to better capture anomaly patterns and improve anomaly detection.

Critical strengths
  1. Clear motivation. The identified problem makes sense. The authors highlight a potential issue with anomaly labels in dynamic graph anomaly detection, where fixed labels may fail to capture important temporal information.

  2. Comprehensive experiments. The experiments are relatively comprehensive and cover various aspects of the proposed method.

Critical weaknesses

The proposed method reminds me of existing techniques such as Label Propagation, Label Smoothing, and Conditional Random Fields (CRFs). I do not see a fundamental conceptual difference between these approaches and the proposed method. It seems that the authors mainly adapt similar ideas to dynamic graph anomaly detection. Therefore, I feel that the proposed method is more of an engineering trick rather than a novel idea.

Questions for authors

As mentioned in the Critical Weaknesses, could the authors further clarify the similarities and differences between the proposed method and existing techniques such as Label Propagation, Label Smoothing, and Conditional Random Fields (CRFs)?

4 comments

1. TECOS learns temporal evidence–label correspondence while preserving observed targets

The central issue is that an event can contain useful anomaly evidence even when its observed label is negative. Such evidence may support a positive label recorded at a later event. TECOS explicitly learns how current and historical anomaly evidence contributes to the current event’s prediction while preserving the observed event-level targets.

Classical LP propagates label information, LS/TLS modifies supervision targets, and CRFs explicitly model dependencies among output labels. TECOS uses a causal temporal module to learn a bounded correction from current and preceding same-source evidence. For example, an interaction at t−2t-2 may contain strong anomaly evidence while its observed label remains negative, with the corresponding positive label appearing at tt. TECOS can exploit this earlier evidence without modifying either target or coupling the two output labels.

This evidence-to-prediction correspondence is the focus of our contextualized supervision design: historical events can support the current positive prediction even when their own observed labels remain negative.

2. TECOS achieves higher mean AP than LS and TLS in all eight delayed-label settings

To evaluate temporal contextualization against target smoothing, we compare TECOS with a hard-label MLP, an MLP trained with conventional LS, and an MLP trained with adapted TLS. The three MLP variants use the same frozen Stage-1 current-event features and the same classifier architecture.

The hard-label MLP uses the original targets. Ordinary LS uses

qtLS=(1−ϵ)yt+ϵ2,q_t^{\mathrm{LS}}=(1-\epsilon)y_t+\frac{\epsilon}{2},

with ϵ∈0.01,0.05,0.1\epsilon\in\\{0.01,0.05,0.1\\}.

For TLS, we adapt the exponential smoothing function of Yèche et al. [1] to discrete same-source interactions:

q_t^{\mathrm{TLS}}=\max\left\\{y_t,\\,g(1)y_{t+1},\\,g(2)y_{t+2}\right\\},

g(ℓ)=exp⁡(−γℓ)−exp⁡(−3γ)1−exp⁡(−3γ),γ∈0.1,0.5,1.0.g(\ell)=\frac{\exp(-\gamma\ell)-\exp(-3\gamma)}{1-\exp(-3\gamma)},\qquad \gamma\in\\{0.1,0.5,1.0\\}.

Each positive training label supplies decreasing soft supervision to its two predecessors, matching TECOS's history length H=2H=2. Existing positive targets remain one. This adapts TLS from early event prediction to event-level anomaly classification.

Smoothing is restricted to training. Checkpoints and smoothing parameters are selected by validation AP against the unsmoothed hard labels of the same delay condition. All methods use identical hard test labels, without smoothing or shifting predictions.

Test AP (%), mean ± standard deviation over three seeds.

DatasetddMLPMLP + LSMLP + TLSTECOS
BitcoinAlpha15.44 ± 0.125.17 ± 0.205.53 ± 0.249.24 ± 0.26
BitcoinOTC112.52 ± 0.8712.33 ± 1.1313.39 ± 1.0614.78 ± 0.38
EU-Core139.37 ± 2.7338.99 ± 2.2637.92 ± 2.4346.39 ± 3.57
Email-DNC110.40 ± 0.2710.50 ± 0.2910.30 ± 0.2315.87 ± 0.30
BitcoinAlpha22.89 ± 0.172.40 ± 0.032.88 ± 0.194.86 ± 0.66
BitcoinOTC23.13 ± 0.193.26 ± 0.153.41 ± 0.2111.01 ± 1.05
EU-Core230.67 ± 0.9731.38 ± 0.9230.74 ± 1.0137.85 ± 1.79
Email-DNC23.05 ± 0.292.98 ± 0.292.94 ± 0.246.13 ± 0.22

Test AUC:

DatasetddMLPMLP + LSMLP + TLSTECOS
BitcoinAlpha159.99 ± 0.6658.72 ± 0.3562.00 ± 0.7873.22 ± 0.47
BitcoinOTC169.51 ± 0.9569.39 ± 1.2270.07 ± 0.9568.36 ± 0.35
EU-Core185.82 ± 0.1785.58 ± 0.0985.40 ± 0.0791.93 ± 0.27
Email-DNC187.18 ± 0.2387.05 ± 0.2586.97 ± 0.2792.60 ± 0.15
BitcoinAlpha261.08 ± 1.9251.73 ± 2.3761.28 ± 1.8865.60 ± 0.79
BitcoinOTC258.35 ± 2.0858.87 ± 1.9259.64 ± 2.0659.14 ± 0.59
EU-Core283.94 ± 0.1383.47 ± 0.0784.04 ± 0.1090.46 ± 0.25
Email-DNC280.62 ± 1.6080.42 ± 1.8980.43 ± 1.3690.75 ± 0.41

TECOS achieves higher mean AP than both LS and adapted TLS in all eight delayed-label settings, exceeding the stronger smoothing baseline in each setting by 1.39–7.60 percentage points. On BitcoinOTC with d=2d=2, TECOS achieves 11.01% AP, compared with 3.41% for TLS and 3.26% for LS. These results demonstrate a substantial AP advantage for temporally contextualized evidence over target smoothing in the studied settings. TECOS also achieves the highest mean AUC in six settings; on BitcoinOTC, TLS has higher AUC at both delays, while TECOS has higher AP.

The matched Current-only ablation further demonstrates the contribution of explicit historical evidence. It preserves TECOS’s architecture and score composition while masking historical positions. Enabling those positions improves mean AP in all eight corresponding delay settings. Together, these experiments show that making historical evidence available improves observed-label prediction and yields stronger AP than modifying supervision targets through LS or TLS.

3. The contribution combines mismatch analysis, contextualized supervision, and bounded evidence correction

TECOS contributes a characterization of temporal evidence–label correspondence, a contextualized supervision formulation, and a concrete bounded correction mechanism. Proposition 3.1 characterizes the supervision conflict induced by delayed labels, while Proposition 3.2 establishes conditions under which historical evidence reduces the optimal risk of predicting the observed labels.

Guided by this analysis, TECOS retains the observed targets and learns how current and preceding same-source evidence jointly support each prediction. Its temporal module implements this formulation through a causal, bounded residual correction to reconstruction–drift anomaly scores. The theoretical analysis, correction design, and controlled experiments together connect the identified mismatch to an effective method for supervised DGAD.

[1] Yèche et al. Temporal Label Smoothing for Early Event Prediction. ICML 2023. https://proceedings.mlr.press/v202/yeche23a.html

AuthorsOpenReview ↗

Follow-up on our rebuttal

Dear Reviewer oTSW,

Thank you again for your valuable feedback. We have provided point-by-point responses to your comments. We would appreciate it if you could review our responses when convenient. Please let us know if any questions or concerns remain.

AuthorsOpenReview ↗

Follow-up Before the Discussion Deadline

Dear Reviewer oTSW,

With one day remaining in the discussion period, we would like to ask whether you have any further questions or concerns about our responses. We would be happy to provide clarification. Thank you again for your time.

Comments on the paper

1 comment
AuthorsOpenReview ↗

Summary of Responses and Revisions

Dear AC/SAC/PC,

We thank the reviewers and chairs for their time and constructive feedback. Below we summarize the recognized strengths, our responses to the main concerns, and the substantial revisions.

Contributions and Strengths

TECOS addresses temporal evidence–label mismatch in dynamic graph anomaly detection through a causal, bounded correction mechanism that combines current and historical evidence while preserving observed supervision targets.

The initial reviews recognized the following strengths:

  • Motivation. The evidence–label mismatch is clearly identified and practically relevant. [Reviewers oTSW, CbH5, QQzs]
  • Method design. The framework is simple and lightweight, combining reconstruction–drift evidence with temporal residual correction. [Reviewer CbH5]
  • Experimental coverage. The experiments are comprehensive, including seven datasets, baseline comparisons, controlled label delays, and ablations. [Reviewers oTSW, CbH5]
  • Theory and presentation. The theoretical analysis supports the motivation, and the paper has a clear organization and logical structure. [Reviewer QQzs]

Summary of the Discussion

  • Reviewer QQzs assigned an initial Weak acceptance rating, recognizing the well-motivated problem, theoretical support, and clear organization. We responded to their questions by improving the presentation, making existing method details easier to access, and adding feature-fusion and training comparisons to support the design choices. The reviewer has not provided further feedback on these responses.

  • Reviewer oTSW raised concerns about the conceptual distinction from Label Propagation, Label Smoothing, and CRFs. We clarified that TECOS learns temporal evidence–label correspondence while preserving observed targets, rather than propagating labels, smoothing targets, or coupling output labels. Additional comparisons with LS and adapted TLS support the benefit of contextualizing evidence over target smoothing.

  • Reviewer CbH5 raised concerns about the prediction objective, the source of temporal gains, and the delayed-label evaluation. We clarified the observed-label prediction objective and added controlled temporal analyses and mixed-delay experiments with greater positive-label retention. These results show that TECOS’s learned positional reliance follows the imposed supervision delay, supporting benefits beyond simply providing additional historical features.

Reviewers ``oTSW` has not provided further feedback on these responses. We would appreciate the AC’s assessment of whether the clarifications and additional evidence sufficiently address their original concerns.

Summary of Revisions

  • Clearer motivation and task formulation. We separated the motivation figure from the framework and added systematic analysis of score–label correspondence across seven datasets. We also clarified the prediction objective and theoretical scope, distinguishing observed-label prediction from latent anomaly timestamp recovery. [Reviewers CbH5, QQzs]

  • Improved accessibility of existing method details. The relevant details were already provided in the original appendix and referenced in the main text. We brought key details into the main text, including the base-score formula in Section 4.1, to make them easier to locate and follow. [Reviewer QQzs]

  • Additional design validation. We added feature ablations, a comparison with cross-attention, and subsequent end-to-end fine-tuning with a matched Stage-2-only control. These experiments support concatenation followed by projection as a simple, competitive fusion choice and demonstrate the potential benefit of further joint optimization. [Reviewer QQzs]

Thank you again for your time and consideration.

Best regards,
The Authors of Submission 32983

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

Related papers

Loading the map…

Discussion (0)

Sign in to comment.