- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes LoCo, a lightweight framework for multivariate time-series anomaly detection, root cause analysis, and causal discovery. It introduces a top-k gradient competition mechanism to learn sparse time-lagged dependencies and uses the resulting model for forecasting-based anomaly detection and backward root cause tracing. Experiments across multiple benchmarks demonstrate competitive detection accuracy, computational efficiency, and interpretability.
Critical strengths
-
The paper addresses a meaningful problem by integrating anomaly detection, root cause analysis, and causal discovery into a lightweight framework. The time-lagged root cause tracing provides an interesting perspective on anomaly propagation.
-
The experimental evaluation covers multiple datasets and three related tasks. The results demonstrate competitive accuracy and computational efficiency, supporting the practical potential of the proposed framework.
Critical weaknesses
-
The theoretical justification contains a fundamental inconsistency. Theorem 4.3 relies on nonzero population gradients for true causal parents at the true parameter. However, under the stated SVAR model and exogeneity assumption, the expected gradients should vanish for all historical inputs at the true parameter. This makes Assumption C.5 incompatible with the preceding assumptions and undermines the claimed support recovery guarantee.
-
The central claim of time-lagged root cause tracing lacks direct quantitative validation. The RCA experiments evaluate conventional variable-level root cause identification, while the proposed temporal tracing capability is mainly illustrated through case studies. Consequently, the accuracy of recovered propagation paths and time lags remains unclear.
Questions for authors
-
Could the authors clarify how Assumption C.5 can hold at the true parameter when the expected residual gradients vanish under the stated model assumptions? How does this affect Theorem 4.3 and the finite-sample support selection result?
-
Could the authors provide quantitative evaluations of time-lagged root cause identification, including the accuracy of recovered propagation paths and temporal offsets, rather than relying primarily on variable-level RCA metrics?
Q1 About Theory
We thank the reviewer for pointing out the problems in the original theoretical analysis. After rechecking the assumptions and theorems, we agree with the reviewer’s concerns. The original manuscript tried to explain how Top-k gradient competition recovers the true causal support set by comparing gradient magnitudes between true parents and non-parents. However, this argument is not rigorous.
Specifically, original Assumption C.5 required true parents to have a strictly positive population-gradient lower bound at w∗. But by C.1–C.2, when the model converges to w∗, the population gradient should be zero at all coordinates, including true-parent coordinates. So C.5 indeed contradicts the earlier assumptions. We also realize that the original claim—that early-training Top-k gradient selection can recover the true causal support set. In particular, if the support set is already basically fixed early in training, the original explanation of continuous gradient competition during training is not accurate enough.
Following the reviewer’s suggestions and our further analysis, we reorganized the theory in Section 4 and Appendix C. We no longer use the original support-recovery argument. Instead, we study the predictive dependency information contained in gradients. In the new Phase 1, as requested by Reviewer fX4S, we further link gradients to Granger causality. Through the new Gradient–Residual Identity, we show that, under the relevant conditions, model-parameter gradients relate to the covariance between prediction residuals and historical inputs. Thus, gradients can reflect the information historical variables provide for current prediction, giving a new theoretical basis for understanding the time-lagged dependencies learned by LoCo.
On this basis, we adjusted the role of the later theoretical analysis. The new theory no longer tries to prove that early-training Top-k gradient selection necessarily recovers true direct causal parents, nor does it describe gradient competition as a process that guarantees exact recovery of the true causal structure. Instead, we more cautiously ground LoCo’s theoretical explanation in the incremental predictive information reflected by gradients and its link to Granger causality. Accordingly, we revised the original statements about causal support recovery.
Q2 Time-lagged Evaluation
We agree that traditional variable-level RCA metrics alone cannot directly evaluate time-lagged root-cause tracing. We therefore added time-lagged RCA and CD experiments on synthetic datasets to quantitatively evaluate root-cause localization and recovery of time-lagged causal relations. Settings and results are in Appendix E.4 G.3 G.5 H.11. For the experiments and comparisons with other baselines, see our reply to Reviewer AJfy’s Q4.