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.