- Rating
- 4(+1)
- Confidence
- 2
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
The authors propose a method for the identification of systems driven by stochastic delayed differential equations. They analyze identifiability conditions and compare their method against various competing baselines on two benchmarks.
Critical strengths
I found the paper very well written. It is relatively easy to follow despite the complex topic. The required assumptions are clearly stated, and the paper discusses how realistic they are. Overall, this appears to be a significant contribution that should interest many people in the community.
Critical weaknesses
-
The results in Table 1, especially the upper part (SHD), don't seem that impressive. Several methods outperform the proposed identification method. I think this requires more attention in the results discussion. Given that the AUROC/AUPRC results are quite clear, the method still seems to perform well overall. However, explaining why it doesn't perform as clearly in terms of SHD could be insightful; the authors could also explain why it seems superior in some systems and less so in others.
-
Some of the assumptions are relatively strong. This may be necessary, but the authors also clearly criticize the causality community for being able to derive guarantees only under restrictive assumptions. This could be phrased more weakly.
Questions for authors
-
How would one find a good in practice?
-
How restrictive is the invertibility assumption on the diffusion matrix? I can easily imagine a system where only some states are affected by noise. Then the matrix would be rank deficient.
-
Could you explain your choice of baselines?
5 comments
Thank you for the replies; those mostly address my concerns. It would be great if the upgraded ergodicity result could be included before the rebuttal ends. However, also without it, I remain positive about the paper.
Dear reviewer 7egF, thank you very much for being positive about the paper.
We've worked on the upgraded ergodicity result, and have updated the pdf accordingly. We haven't proved the finite-sample identifiability theorem under degenerate noise yet, so we just added a section in the appendix (Section A.9, in blue in the pdf) where we show ergodicity under degenerate noise. The details of the results and proofs can be found there.
Response to reviewer 7egF
Thank you for noting that the paper is very well written and relatively easy to follow despite the complex topic, and that it is a significant contribution that should interest many people in the community.
We would like to respond here to the weaknesses and questions that you raised.
W1. Our method does not significantly outperform all other methods on all evaluated datasets, but consistently ranks best and outperforms other methods on a large number of datasets and metrics. One reason why it appears to perform much better on AUROC and AUPRC than on SHD is that the selected hyperparameters often lead to too dense graphs in the "Coupled" datasets, meaning that AUROC (ranking among edges) can be very high while SHD performance is low because no edge is removed. This is because we follow the procedure of the CausalDynamics benchmark and use a single set of hyperparameters for all systems, although different hyperparameters would probably perform best on different systems, such as a simplified 10-dimensional coupled ocean-atmosphere model or the 3-dimensional Lorenz system.
W2. We agree that the comparison with prior causal-discovery work should be more balanced. Our goal is to establish identifiability for SDDEs with potential instantaneous and lagged drift dependencies, including cyclic interactions. We do not want to claim that our assumptions are uniformly weaker than those used in existing causal-discovery methods; rather, we argue that they may be more physically plausible. In particular, we had in mind the assumption that instantaneous connections must form a Directed Acyclic Graph (DAG), which is made by several methods (e.g., DYNOTEARS, VARLiNGAM, PCMCI+, GRaSP) but does not fit many physical systems.
We propose the following revisions:
Q1. In practice, when modelling a system, one could set the parameters of the model to reflect prior knowledge of the system. Depending on the system, one might have some prior knowledge of the true sparsity, which would allow setting λ accordingly. In that case, we also provide a Cooper [3] implementation of our method, which uses a constraint instead of a penalty, so that one can set the desired level of sparsity directly rather than setting λ. Also, depending on the task, one may want to sparsify more (to retain only the main drivers) or less (make sure there are no false negatives).
Q2. Invertibility of the noise is assumed throughout the paper for simplicity, but we believe it can be relaxed to a rank-deficient Σ. The condition on the noise is only used twice: for full support of the joint occupation measure (Lemma 1) and for the ergodicity result (Lemma 5, used for Theorem 3).
We will include the extension of Lemma 1 in the revision, and upgrade the ergodicity result once we confirm that a proof can hold without complicating the existing one too much.
Q3. For the CausalDynamics benchmark and driver identification, we report results for the main causal discovery methods. For both CausalDynamics and Dysts, we compare our method to the Neural ODE variants that use a sparsity penalty for regularization or performing driver selection. Among all baselines, only AGL provides an identifiability result for SDEs (not for delayed systems). Since regular NODE does not perform driver selection, we do not include it in the CausalDynamics benchmark.
[3] Cooper: A Library for Constrained Optimization in Deep Learning, Jose Gallego-Posada et al., NeurIPS 2025
[4] Ergodicity for SDEs and approximations: Locally Lipschitz vector fields and degenerate noise, J. Mattingly et al., 2002