Causal Temporal Representation Learning with Nonstationary Sparse Transition

Causal Temporal Representation Learning (Ctrl) methods aim to identify the temporal causal dynamics of complex nonstationary temporal sequences. Despite the success of existing Ctrl methods, they require either directly observing the domain variables or assuming a Markov prior on them. Such requirements limit the application of these methods in real-world scenarios when we do not have such prior knowledge of the domain variables. To address this problem, this work adopts a sparse transition assumption, aligned with intuitive human understanding, and presents identifiability results from a theoretical perspective. In particular, we explore under what conditions on the significance of the variability of the transitions we can build a model to identify the distribution shifts. Based on the theoretical result, we introduce a novel framework, Causal Temporal Representation Learning with Nonstationary Sparse Transition (CtrlNS), designed to leverage the constraints on transition sparsity and conditional independence to reliably identify both distribution shifts and latent factors. Our experimental evaluations on synthetic and real-world datasets demonstrate significant improvements over existing baselines, highlighting the effectiveness of our approach.

Paper

References (73)

Scroll for more · 38 remaining

Similar papers

Peer review

Reviewer 6hAo6/10 · confidence 2/52024-06-20

Summary

Most existing causal temporal representation learning models either assume the domain variables to be observable, or have a Markov prior over them. This paper first comes up an identifiability theory for sequential data affected by non-stationary latent causal processes under unknown distributional shifts. In particular, a novel causal temporal representation learning method is developed to identify the latent causal variables with time-delayed causal relations. Moreover, without relying on prior knowledge on distributional shifts, the domain variables can be inferred from sequential observations. The final experiments on both synthetic and real-world action segmentation data, demonstrate the superior performance of the novel method in estimating domain variables and latent causal processes.

Strengths

Originality: It is the first attempt to develop causal temporal representational learning to identify both the domain variables and the latent causal processes from sequential observations, without relying on distributional or structural knowledge. Quality: The theorectical aspects of the paper look very sound, and absolutely pass the acceptance bar of the NeurIPS. Clarity: Overall, the paper is well written. Both the target problems and the main techniques are well presented! Significance: The developed identifiability theory for domain variables and latent causal processes from sequential observations under unknown distributional or structural prior knowledge, may have impacts for advancing the relevant causal representation learning methods.

Weaknesses

Throughout the paper, I did not find the details about how to set up the parameters of the neural nets for the novel CTRL framework, which could be crucial for the others to pick up the work.

Questions

Except the action segmentation tasks, can the authors provide more real applications including healthcare and finance, as mentioned in the boarder impacts.

Rating

6

Confidence

2

Soundness

3

Presentation

3

Contribution

3

Limitations

Yes, the paper discusses the potential negative societal impact of the work.

Authorsrebuttal2024-08-13

Dear Reviewer 6hAo We sincerely appreciate the time and effort you dedicated to reviewing our submission and providing such insightful comments. Your feedback is invaluable to us. If there are any unresolved concerns or additional thoughts, we would be more than happy to address them. Thank you again for your thoughtful contributions. Best regards, Authors of submission 4804

Reviewer 1QG35/10 · confidence 4/52024-07-05

Summary

The paper focuses on causal temporal representation learning for non-stationary time series. It adopts a sparse transition assumption, aligned with intuitive human understanding, and presents identifiability results from a theoretical perspective. Based on the theoretical result, the authors introduce a novel framework, Causal Temporal Representation Learning with Nonstationary Sparse Transition (CtrlNS), designed to leverage the constraints on transition sparsity and conditional independence to reliably identify both distribution shifts and latent factors. Experiments on synthetic and real-world datasets demonstrate the effectiveness of the proposed method in recovering latent variables and domain indices.

Strengths

1.The paper focuses on the issue of causal discovery in nonstationary time series, which is a fascinating and significant area of research. 2.The authors claim to have proposed a method that establishes identifiability of nonstationary nonlinear ICA for general sequence data without prior knowledge of domain variables, which is an extremely challenging problem. 3.The authors have conducted experiments on both synthetic and real-world datasets, validating the effectiveness of the model, and have appropriately discussed the limitations of the model.

Weaknesses

1.The authors lack discussion of some existing work, for example, the paper [1] also demonstrates identifiability by clustering nonstationary spatiotemporal data into different domains without prior knowledge. It is essential for authors to further discuss the similarities and differences between the two papers and alleviate my concerns about the novelty of this work. 2.In lines 259-261 of this paper, the authors mention ensuring the invertibility of the modeled mixing function through reconstruction loss, which is insufficient. Invertible Neural Networks (INNs) should be employed to ensure invertibility, as there will inevitably be errors in the reconstruction process. [1] Zhao, Yu, et al. "Generative Causal Interpretation Model for Spatio-Temporal Representation Learning." Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. 2023.

Questions

Please see the Weaknesses.

Rating

5

Confidence

4

Soundness

3

Presentation

3

Contribution

2

Limitations

The authors have appropriately discussed the limitations and societal impacts of the model.

Authorsrebuttal2024-08-13

Dear Reviewer 1QG3 We sincerely appreciate the time and effort you dedicated to reviewing our submission and providing such insightful comments. Your feedback is invaluable to us. If there are any unresolved concerns or additional thoughts, we would be more than happy to address them. Thank you again for your thoughtful contributions. Best regards, Authors of submission 4804

Reviewer Zo2n4/10 · confidence 2/52024-07-11

Summary

The paper focuses on temporally causal representation learning, where the goal is to recover a latent causal process from nonstationary observation sequences. Existing works represent the source of the nonstationarity by either known domain variables or (autocorrelated) unknown domain variables with Markov structure. The paper proposes a sparsity based constraint on the latent transitions to achieve the identifiability of the domain variables. Coupled with the identified domain variable, they make use of the sufficient variability assumption to identify the latent causal process. Based on this theoretical framework, they introduce a sequential VAE based model, which encourages the independent noise variables and the sparse transitions. They evaluate (i) the performance on the latent process identifiability on a synthetic dataset following their model definition, and (ii) the usefulness of their model on a weakly-supervised video action segmentation task on real-world datasets of daily actions and cooking.

Strengths

* Compared to the existing work, the paper tackles the identifiability of the domain variables from a new perspective: the domain variable's effect on the transition functions. This perspective is in line with seeing distribution shifts as interventions to the underlying system, and could be valuable in some related tasks such as learning causal relations by taking actions. * I appreciate the effort for the real-world experiment, though it only evaluates the prediction of the domain variable.

Weaknesses

* As is common in identifiability literature, the assumptions of the theoretical framework do not seem to be testable on a real-world setup. * Definition 6 (Weakly diverse lossy transitions) seems unrealistic and is not clear from the text: (i) The motivation for the “Lossy” is not clear to me, how is there a causal link between two variables, while changing the causal parent does not affect the effect variable? (ii) On the clarity of the definition: perhaps, some graphical model examples could help here. In addition, the assumption is not discussed in the main text, except stating in lines 227-228 that it is “a mild and realistic condition in the real-world scenarios, allowing for identical future latent states with differing past states”. Why is it mild and realistic? * It is not clear to me why having domain variables without a Markov structure is a better model of the real-world environments than domain variables with Markov structure. I don’t see why environments in the real-world would swap at random multiple times along a sequence of time points. For example, in the provided real-world experiment, ground-truth actions in the video in Figure S5 occur in blocks and they are autocorrelated. The weak-supervision of the action order used in this experiment also supports their autocorrelation. * According to the point above, the synthetic experimental setup seems unrealistic as it has randomly sampled domain variables. * I think the first contribution statement in Lines 59-61 is ambiguous: "this is the first identifiability result that handles nonstationary time-delayed causally related latent temporal processes without prior knowledge of the domain variables". What is meant by "without the prior knowledge of domain variables" is a bit vague, while the difference with the existing work [Song+23] seems to be the assumptions on the temporal dependence of the domain variables. [Song+23] assumes temporally-dependent domain variables and predicts the unknown domain variables with an HMM, while this work assumes temporally independent domain variables and predicts them from sequential observations. [Song+23]. Xiangchen Song, Weiran Yao, Yewen Fan, Xinshuai Dong, Guangyi Chen, Juan Carlos Niebles, Eric Xing, and Kun Zhang. "Temporally disentangled representation learning under unknown nonstationarity" Neurips, 2023.

Questions

* Some assumptions are motivated in lines 219-224 as being aligned with human intuition: “separability states that if human observers cannot distinguish between two domains, it is unlikely that automated systems can achieve this distinction either. Secondly, variability requires that the transitions across domains are significant enough to be noticeable by humans, implying that there must be at least one altered edge in the causal graph across the domains.” I find it hard to follow this reasoning. Why are these the cases? * For both experiments, architectural details are missing. Besides, some information on the synthetic experimental setups is missing: what are the functions $\mathbf{m}$ and $\mathbf{g}$ used?, What is the train/val/test split?, What parts of the experiment change with the changing seed? * It is not clear to me what the model predicts on the action segmentation task. I think it predicts the action class per frame given the video frames and the action order. If so, why do you report MoF, IoU and IoD, instead of accuracy? How do you provide the weak-supervision information to the model? Why is the baseline NCTRL excluded from this task? Its generative model seems to fit the task well. * It is not clear what the sparsity loss is. In line 266, it is said to be the L2 norm of the parameter in the transition estimation functions. Which parameter is this?

Rating

4

Confidence

2

Soundness

2

Presentation

2

Contribution

1

Limitations

* The main limitation, the assumptions being untestable for a real-world setup, is not discussed in the main text.

Reviewer Zo2n2024-08-12

Dear authors, Thank you for taking time to answer my concerns, however, the following points are still unclear for me: * For W2, * As far as I understand, the example provided, $B = Relu(A) + \epsilon_B$, does not satisfy the lossy assumption as clearly $\frac{\partial m_B}{\partial A} \neq 0$ everywhere. It is just $\frac{\partial m_B}{\partial A} = 0$ for $A \in (- \inf, 0)$. When $\frac{\partial m_B}{\partial A} = 0$ for all values of $A$, I still do not see how it can be a causal parent. * For W3, your real-world dataset shows that *a sequence generated from a temporally independent distribution* is unrealistic. A realistic setup would be to test your model on only state sequences generated from a Markov chain. * For Q2, * architecture details are still missing, * it would be better to see the datasets generated from different seeds, * the details on ground-truth transition and mixing function details are still missing, * For Q4, the sparsity loss is wrong. L1 norm is commonly used to encourage sparsity. As this is the only architectural novelty, I am not sure how much the second contribution, (2) the CtrlNS framework, makes sense.

Authorsrebuttal2024-08-13

Dear Reviewer Zo2n, Thank you for providing your feedback. Please see our further response below: > As far as I understand, the example provided, $B=Relu(A) + \epsilon_{B}$, does not satisfy the lossy assumption as clearly $\frac{\partial m_{b}}{\partial A} \neq 0$ everywhere. It is just $\frac{\partial m_{b}}{\partial A} = 0$ for $A\in (-inf,0)$. When $\frac{\partial m_{b}}{\partial A} = 0$ for all values of $A$, I still do not see how it can be a causal parent. We would like to highlight the definition of the lossy assumption in line 136: - Line 136: **There exists** an open set $S_{t,i,j}$ such that changing $z_{t−1,i}$ within this set will not change the value of $m_j$. As we only require **there exists** a subset of $\mathcal{Z}$ where the partial derivative is zero, it indicates that we don't require "$\frac{\partial m_{b}}{\partial A} = 0$ for all values of $A$", hence this should not influence the existence of the causal link. > For W3, your real-world dataset shows that a sequence generated from a temporally independent distribution is unrealistic. A realistic setup would be to test your model on only state sequences generated from a Markov chain. We would like to note that: 1. The state sequence used in our experiment is not purely generated from a temporally independent distribution, and our method doesn't require the state sequence to be generated from a temporally independent distribution. 2. Our method can allow a mixture of independent and dependent settings (i.e., we can handle either dependent, independent, or both). Our synthetic experiment setup specifically explores this mixed case. It is clearly temporally dependent and can not be modeled by a Markov chain. We respectfully disagree with the statement "using only state sequences generated from a Markov chain is a realistic setup" in our synthetic experiment for the following reasons: 1. Synthetic experiments are designed to validate the proposed theory and clearly distinguish it from existing baselines. Since we claim that our method achieves domain variable identifiability even when the data does not originate from a single Markov chain, it is essential that our synthetic experiments directly test this scenario. Specifically, in comparison to NCTRL, we demonstrate that NCTRL is unable to handle the more general case where $u_t$ is not generated from a Markov chain, whereas our method is capable of managing such complexity. 2. Regarding the setting mentioned by the reviewer, "only state sequences generated from a Markov chain," we understand that this is the synthetic experiment setup used in the NCTRL paper. We do not see the necessity for this setup in our synthetic experiments, as both NCTRL and our method are capable of handling this scenario and we are not claiming to outperform NCTRL in this scenario. 3. From the real-world experiments comparing NCTRL and our method, it is evident that our method outperforms NCTRL. This suggests that assuming the state sequence is generated from a Markov chain is not suitable for real-world settings. > For Q2, architecture details are still missing. We kindly ask the reviewer to specify which aspects of the architecture described in Section 4.1 remain unclear. We are more than happy to provide additional details and clarifications as needed. > It would be better to see the datasets generated from different seeds. We thank the reviewer for suggesting this additional experiment setting. We are in the process of expanding the experiments to include more datasets generated from multiple seeds. However, given it is close to the discussion deadline, we will do our utmost to include the results before the discussion concludes. > The details on ground-truth transition and mixing function details are still missing. The transition and mixing functions are implemented as randomly initialized MLPs with hidden dim of 32 with input and output dim 8. All implementation details can be found in our codebase provided in Appendix S3.3. Hope the attached code can make it clear. > For Q4, the sparsity loss is wrong. L1 norm is commonly used to encourage sparsity. As this is the only architectural novelty, I am not sure how much the second contribution, (2) the CtrlNS framework, makes sense. We would like to clarify that the most accurate way to enforce sparsity is through the $L_0$ norm. However, since calculating the gradient for $L_0$ is challenging, $L_p$ norms are commonly used as approximations. As indicated in line 1083 of Appendix S3.4, we tested both $L_1$ and $L_2$ norms and both work well in optimal case (MCC: 0.9690 vs 0.9704), and the setting we employed in the paper was selected for its superior stability. Regarding the contribution, we have already conducted an ablation study in the real-world experiment section. The results show that removing the sparsity loss leads to a performance drop, which supports the effectiveness of our proposed method.

Authorsrebuttal2024-08-13

Additional experiment result on multiple random seeds.

> It would be better to see the datasets generated from different seeds. We include additional experimental results using three different random seeds to generate synthetic datasets. We compare our method with NCTRL and report the mean and standard deviation of the results across those three datasets in the following table. It can be observed that since NCTRL cannot generalize beyond the Markov assumption, its performance is weaker than our method and is also less stable in comparison. | Method | MCC($z_t$)|Acc($u_t$)| |--------|------|------| |NCTRL|50.99$\pm$3.77|57.51$\pm$13.23| |CtrlNS|95.04$\pm$1.39|97.09$\pm$0.89| We sincerely appreciate the time and effort you dedicated to reviewing our submission and providing such insightful comments. If there are any unresolved concerns or additional thoughts, we would be more than happy to address them. Best regards, Authors of submission 4804

Reviewer 3MKp7/10 · confidence 3/52024-07-22

Summary

The paper introduces CtrlNS, a causal temporal representation learning framework based on a sparse transition assumption to identify distribution shifts without strong prior knowledge of the domain variables. Theoretical and experimental results show CtrlNS effectively identifies distribution shifts and latent factors, outperforming existing methods.

Strengths

- Causal temporal representation learning under nonstationarity is an important problem. The paper replaces somewhat unrealistic and strong assumptions on the domain variable made by the prior works. - Theoretical analysis provides a rigorous foundation for the proposed framework. While I did not check the proofs in detail, the proof flows are convincing, and the results are intuitive and reasonable. - Another strength of the paper is its evaluation on realistic task setup (i.e., weakly supervised action segmentation). This illustrates the practical applicability of the proposed method. - Finally, the paper is well-written and well-organized.

Weaknesses

The authors argue that the paper derives identifiability results *“without prior knowledge of the domain variables”* (e.g., line 46, 61). However, this is an overstatement since CtrlNS still requires some prior knowledge or assumptions, such as the ground-truth number of different domains $U$. Moreover, while I understand it does not rely on Markov assumption of prior works (e.g., NCTRL), the proposed framework still requires a different set of assumptions such as weakly diverse lossy transition and mechanism sparsity. In fact, I am not sure whether the authors’ assumption can be claimed as “weaker” compared to prior works. Therefore, I feel those statements need to be toned down, and more discussion on the comparisons of those assumptions is suggested.

Questions

- It seems that the framework requires the prior knowledge of the number of environments $U$. This assumption should be made more explicit. Also, what happens under the misspecification of $U$? - For the mathematical rigor, the statements need to take measure-zero sets into account. For example, I think the conditions $p(S_{t, i, j})>0$ (line 136), $p(S_{t, i})>0$ and $p(S_{t, i, j}\setminus S_{t, i})>0$ (line 141) should be included, just to name a few. - The framework requires $U$ different transition networks, which could be a potential weakness, especially in terms of scalability. The discussion on this point would further strengthen the paper. For example, an efficient parameter sharing of networks [3] may alleviate such issues. - The proposed work assumes no contemporaneous causal relationships. (I know this is a common assumption in this line of work) How can this assumption be relaxed? With the interventional data, is it possible for the proposed framework to generalize to the existence of instantaneous effects, maybe similar to iCITIRS [1]? - A number of works in RL setting also consider the identifiability under the non-stationary process [2, 3]. For example, [3] considers the identifiability of both domain variables and causal structures. I suggest the authors include these related works in different areas. - The utilization of mechanism sparsity for identifiability is also explored in [4]. How is it different from the sparse transition assumption in CtrlNS? (minor) - Style file seems to be different from the official NeurIPS template (e.g., fonts). ***References*** [1] Lippe, Phillip, et al. "Causal Representation Learning for Instantaneous and Temporal Effects in Interactive Systems." *The Eleventh International Conference on Learning Representations*. [2] Feng, Fan, et al. "Factored adaptation for non-stationary reinforcement learning." *Advances in Neural Information Processing Systems* 35 (2022): 31957-31971. [3] Hwang, Inwoo, et al. "Fine-Grained Causal Dynamics Learning with Quantization for Improving Robustness in Reinforcement Learning." *International Conference on Machine Learning*. PMLR, 2024. [4] Xu, Danru, et al. "A Sparsity Principle for Partially Observable Causal Representation Learning." *International Conference on Machine Learning*. PMLR, 2024.

Rating

7

Confidence

3

Soundness

3

Presentation

3

Contribution

3

Limitations

.

Authorsrebuttal2024-08-14

Dear Reviewer 3MKp, We would like to express our sincere gratitude for the time and effort you invested in reviewing our submission. We greatly appreciate your acknowledgment of our contribution and the insightful comments you provided. We have carefully considered your feedback and have made the response, which we hope address your concerns. Should you have any further comments or additional suggestions, we would be more than happy to discuss them. Thank you once again for your valuable input. Best regards, Authors of submission 4804

Program Chairsdecision2024-09-25

Decision

Accept (poster)

© 2026 NYSGPT2525 LLC