- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes DCCAD, a dynamic causal contrastive learning framework for multivariate time-series anomaly detection. The method estimates time-varying causal graphs to guide positive and negative sample augmentation and combines contrastive representation distance, causal prediction error, and graph change scores for anomaly detection. Experiments on five real-world datasets and a synthetic dynamical system demonstrate improved detection performance, supported by ablation and sensitivity analyses.
Critical strengths
-
The paper addresses a relevant problem in multivariate time-series anomaly detection. Using dynamic causal relationships to guide contrastive augmentation is reasonably motivated, since inter-variable dependencies may change across operating conditions.
-
The experiments cover multiple real-world datasets, a synthetic dynamical system, and recent baselines. The ablation studies and entity-level evaluations provide useful evidence for the effectiveness of the proposed approach.
Critical weaknesses
-
The methodological novelty is relatively limited. DCCAD largely extends CAROTS by replacing static causal graphs with dynamic ones, modifying variable selection for contrastive augmentation, and introducing a graph change score. Although these modifications are reasonable, the overall framework remains closely related to existing work.
-
The computational overhead and practical applicability are insufficiently addressed. Dynamic causal graph estimation introduces additional computation, but the efficiency evaluation excludes the offline graph construction stage. Even under this setting, DCCAD requires approximately 2.33 times the runtime of CAROTS, raising concerns about scalability and practical deployment.
Questions for authors
-
Could the authors clarify the methodological contributions beyond CAROTS and identify which proposed modifications are primarily responsible for the performance improvements?
-
Could the authors report the complete end-to-end computational cost, including dynamic causal graph construction, and evaluate scalability with increasing numbers of variables?
3 comments
Thank you for the clarifications and additional experiments. The end-to-end results address my efficiency concern. However, I still view the methodological contribution as primarily an incremental extension of CAROTS, so I will keep my original rating.
Thank you for confirming that our end-to-end results address your efficiency concern. We respectfully disagree that DCCAD is primarily an incremental extension of CAROTS. Two distinctions are central to our assessment.
1. What a positive sample should preserve during normal operation. CAROTS assumes that normal causal relationships are time-invariant (Kim et al., 2025, §3.2). For a given perturbed source, its predictor can produce different values at different times, but its fixed graph selects the same downstream variables to update. DCCAD allows those dependencies to change during normal operation. It estimates a Granger graph at every time step, so perturbing the same source at two normal time steps can call for different downstream updates. For a training window ending at , the graph guides source and downstream target selection for positives, and its out-degree ranking guides perturbation target selection for negatives.
Table 8 tests what these rules add once dynamic graphs are already available. With the same encoder architecture, dynamic graphs in both configurations, and graph-change scoring disabled, replacing CAROTS’s augmentation rules with ours improves AUPRC on six of seven evaluation series. Mean AUPRC rises from 0.3948 to 0.4320, and mean Best-F1 from 0.4686 to 0.5267.
2. How changes in dependencies are measured at test time. CAROTS retains the graph learned during training. DCCAD uses a frozen predictor and a threshold calibrated on normal training data to estimate a graph at each new time step. It can therefore score changes in both estimated influence and topology relative to recent history. On the Lorenz-96 causal-shift anomalies, where the data-generating mechanism is explicitly altered, the full DCCAD model improves AUROC over CAROTS from 0.6863 to 0.7270 and from 0.5818 to 0.6679 at the two difficulty levels (Table 2).
We will make these distinctions clearer in the revision and incorporate the new end-to-end efficiency and scalability measurements. Thank you for the constructive discussion.
Response to Reviewer hedN
We thank the reviewer for the comments. Both concerns are answered below with a component attribution and new end-to-end measurements.
W1/Q1. Contributions beyond CAROTS and attribution of improvements
DCCAD is not CAROTS with a different graph. It identifies a flaw in static-graph contrastive supervision and is the first method to remove it.
The flaw. Causality-preserving augmentation is valid only relative to the dependencies of the window being augmented. A positive built from a mismatched graph updates variables along absent edges and skips present ones (Fig. 1): it is a dependency-violating sample labeled as positive. A static graph injects this label noise whenever dependencies vary across operating states.
Why replacing the graph is not a drop-in change. (i) A graph is needed for every window, and static discovery cannot supply it: CUTS+ takes 5,073 s for one graph. (ii) Time-resolved estimation is difficult: GCAD's dynamic graphs recover the true Lorenz-96 edges at 0.553 AUROC, DCCAD's at 0.894. (iii) Training and test graphs must follow identical criteria without fitting on test data. DCCAD trains one predictor across normal-data blocks, freezes it, and fixes one threshold on normal data. (iv) Dependencies also change in normal operation, so graph change alone is not anomaly evidence. DCCAD learns each normal state under its own graph and scores change against recent history.
Method. The augmentation operator becomes a function of the current window instead of a dataset-level constant. CDA-PA draws sources with nonzero current out-degree and updates their current downstream variables; CDA-NA ranks variables by current out-degree and samples the perturbation coverage. CAROTS draws sources from all variables, including those with no downstream target, and selects negatives by DFS on the fixed graph. GCAD compares its graphs with a fixed normal reference and never uses them in training.
Attribution. Averages over seven benchmarks (Tables 8–9):
Window-specific graphs are the primary source of improvement: +0.030 AUROC, +0.046 AUPRC, and +0.045 F1, the largest step on every metric. Degree-ranked negatives add +0.016 AUROC. Graph-change scoring adds +0.040 AUPRC, most strongly for sparse anomalies (MSL P-15: 0.1969 → 0.3738). DCCAD improves on CAROTS by 5.86 AUROC points.
W2/Q2. End-to-end cost and scalability
End-to-end cost. Table 13 excludes causal discovery for both methods. With discovery included in the same setting:
DCCAD cuts causal-discovery cost by 47.6% and end-to-end cost by 25.8%. Its estimator is also more accurate: edge AUROC on Lorenz-96 is 0.894 ± 0.012, against 0.865 ± 0.013 for CUTS+. Graphs for every time step cost less than CAROTS's single static graph. DCCAD's detector time remains below CrossAD (2,638.50 s) and CARLA (> 4,500 s).
Scalability. Lorenz-96 sequences of identical length (40,000 steps, split equally into training and testing) with increasing dimension N:
A sixfold increase in N raises end-to-end runtime 3.8-fold. From N=40 to N=120, runtime grows 3.2-fold for a threefold increase: scaling is near-linear, as expected from one perturbed forward pass of the frozen predictor per variable. Detector runtime grows 2.2-fold over the full range. At N=120, close to WADI's 123 variables, the complete pipeline finishes in 28.6 minutes.
Online latency. On WADI, sequential test-time processing takes 5.253 ms per step, 0.53% of its 1 s sampling interval. Each observation is scored before the next one arrives.
Storage and deployment. DCCAD computes weighted graphs in a stream and never writes them to disk. It retains bit-packed binary graphs and three one-dimensional series: influence change, topology change, and the fused score. The total footprint across all evaluated datasets, including graph files, detector artifacts, and models, is 0.66 GiB. Training graphs are constructed once offline and reused; test windows are processed sequentially with the frozen predictor, without retraining.
We hope these results resolve both concerns and that the reviewer will consider raising the score.