- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This work studies latent causal representation learning on non‑stationary time‑series. It targets the joint identification of instantaneous and lagged causal relations from purely observed data, where underlying latent states are unobservable. The paper develops identifiability results for latent states and causal graphs, and introduces the auxiliary‑variable‑driven contrastive‑learning framework iCReN for latent representation learning and causal‑structure inference. Empirical results verify its causal‑structure recovery performance on synthetic datasets and demonstrate its practical value in real‑world prediction tasks.
Critical strengths
- By integrating instantaneous causal relations, lagged causal relations, and nonstationarity into a unified framework, the study addresses the practical needs of complex dynamical systems more comprehensively than approaches that investigate only one type of causal relation.
- Building on the TCL/GCL contrastive losses under the IIA framework, the authors develop a complete pipeline and provide two variants—iCReN-T and iCReN-G—for discrete and continuous auxiliary variables, respectively, and present a complete inference procedure for extracting causal graphs from Jacobian matrices.
Critical weaknesses
-
The method relies on relatively strong assumptions that are difficult to verify in real-world applications. It rules out unobserved instantaneous confounding and sampling aliasing through its modeling assumptions, and relies on the full-rank condition for instantaneous variability and the separation condition for neighboring components to resolve directional ambiguities. Importantly, the paper itself shows that linear models with instantaneous edges and additive-separable inverse transition functions violate the full-rank condition for instantaneous variability, leaving instantaneous causal structure without theoretical identifiability guarantees. The synthetic experiments also show a substantial drop in instantaneous-structure F1 scores in linear settings. However, this critical limitation is mentioned only in an appendix remark and is not adequately qualified in the abstract or introduction, potentially leading readers to overestimate the method's applicability.
-
The theoretical analysis defines causal edges in terms of whether partial derivatives are identically zero or nonzero at the function level, whereas neural networks yield only numerically estimated Jacobian values subject to approximation and numerical errors. More importantly, the synthetic experiments employ an oracle strategy for graph extraction: the true number of parents of each target node is provided, and the top-(k) edges with the highest Jacobian scores are selected as predictions. This strategy relies on ground-truth information unavailable in practical applications, where the number of true parents is unknown. Consequently, the reported structural recovery performance may not reflect the method's practical ability to infer causal graphs.
Questions for authors
- Identifiability conditions are sufficient but not necessary. From a practical perspective, how can users assess whether real-world datasets approximately satisfy the key assumptions, particularly sufficient variation induced by the auxiliary variable and the separation condition for neighboring latent components? Can the authors provide computable diagnostic metrics to assess the plausibility of these assumptions in practice?
- The theoretical analysis relies on the assumption that the transformations are diffeomorphisms, whereas the implementation uses Leaky-ReLU activations, which are only piecewise smooth and do not satisfy the assumption. How do the authors reconcile this discrepancy between the theoretical assumptions and the practical implementation?
4 comments
Response to Reviewer 1KFU — Part 2/2
Part 2/2 — Weakness 2 and Question 2
Continued from Part 1/2.
2. Numerical graph extraction and parent-count-based evaluation (Weakness 2)
More importantly, the synthetic experiments employ an oracle strategy for graph extraction: the true number of parents of each target node is provided, and the top-(k) edges with the highest Jacobian scores are selected as predictions.
We thank the reviewer for highlighting the gap between function-level identification and numerical graph extraction, as well as the use of ground-truth parent counts. As the reviewer notes, while the theoretical result characterizes causal edges through derivatives that are not identically zero as functions, graph extraction from a learned model relies on numerical scores and is subject to estimation error and threshold choice.
To address this concern empirically, we evaluated how accurately graphs could be recovered without ground-truth parent counts in the default setting with both latent and observation dimensions set to 5. We normalized the average absolute Jacobian scores and applied a prespecified threshold of 0.05 instead of selecting edges according to the true parent counts. Although F1 scores decreased relative to top-k selection, fixed-threshold selection achieved mean instantaneous and lagged F1 scores of 0.890 and 0.937, respectively, over 10 seeds without using ground-truth parent counts. We have added the normalization and thresholding procedure to Appendix C.7, along with a comparison of fixed-threshold and top-k results. We have also added a brief discussion of these results to Sections 6.1 and 7.
3. Smoothness assumptions and Leaky-ReLU implementations (Question 2)
The theoretical analysis relies on the assumption that the transformations are diffeomorphisms, whereas the implementation uses Leaky-ReLU activations, which are only piecewise smooth and do not satisfy the assumption. How do the authors reconcile this discrepancy between the theoretical assumptions and the practical implementation?
As the reviewer notes, our implementation does not strictly satisfy the diffeomorphism assumptions in our theory. Replacing Leaky-ReLU with smooth activations alone would not resolve this discrepancy, since smoothness does not guarantee invertibility of the learned mappings. Given the high recovery performance obtained with standard neural networks, we retain this implementation. We also conducted an experiment replacing only the activations in the true structural and observation functions with Smooth Leaky-ReLU, while leaving the estimator unchanged. Combined with the existing orthogonal observation matrices and additive-noise DAG structure, this replacement yields diffeomorphic observation and augmented transition mappings. The mean latent MCC and instantaneous and lagged graph F1 scores over 10 seeds were 0.951, 0.925, and 0.910, respectively. These results suggest that this discrepancy may not have a substantial impact on recovery performance in the evaluated setting. We have added this experiment to Appendix C.6, reported the results in Table 12, and clarified the relationship between theory and implementation in Appendix C.1.2.
Thank you for the authors' responses! I have no questions.
Thank you again for carefully considering our response and revised manuscript. We appreciate your constructive feedback and continued support.
Response to Reviewer 1KFU — Part 1/2
Part 1/2 — Weakness 1 and Question 1
We thank the reviewer for the detailed comments on the assumptions and graph evaluation, which helped us clarify the relationship between theory and implementation and add empirical checks.
1. Scope and practical assessment of the sufficient conditions (Weakness 1; Question 1)
We agree that assessing the plausibility of identification conditions, such as sufficient variability and separation, is important in practice. However, it is difficult to assess the plausibility of these conditions in advance because they involve unknown latent distributions and structures. We are therefore unable to provide computable diagnostic metrics for this purpose in this work. In practice, domain knowledge may help assess the relevance of the auxiliary variable to nonstationarity and the plausibility of the learned representations and inferred causal relations. We have revised Section 7 to note the difficulty of assessing the theoretical assumptions in real-world data.
We thank the reviewer for highlighting the need to clarify the scope of our identification guarantees. These guarantees apply to the stated discrete-time model without unmodeled common causes and under the identification conditions. As the reviewer points out, sampling can introduce aliasing, but analyzing the effects of time discretization and sampling intervals on causal structure is outside the scope of this work. As also noted in the review, when instantaneous causal relations are present, the sufficient-variability condition in Theorem 1 fails if the inverse transition function is additively separable in the current and past states; linear transition models are a special case, as discussed in Remark 1. We have clarified in the Introduction that Section 4 discusses the scope and limitations of our guarantees in detail, including the exclusion of linear transition models with instantaneous causal relations.
Continued in Part 2/2.