- Rating
- 2(+1)
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper investigates structure identifiability in causal representation learning. The authors consider a multi-domain setting, in which in each domain observational and interventional data is available. The data is generated by linear functions of a subset of the latent variables of interest. The goal is to identify the causal relationships among the latent variables within each domain and then combine these relationships to recover a global causal graph over all latent variables. Under strong assumptions, the authors establish a sufficient condition for identifiability. Their proof is constructive and also leads to a finite-sample estimation method.
Critical strengths
The exact setup is to my knowledge not yet studied in the literature. In particular, allowing for bidirected edges between the latent variables only allows to recover parts of the latent structure, which seems interesting to me.
Critical weaknesses
To me, some key concepts in the manuscript are insufficiently discussed and lack clarity. It remains unclear where a new contribution is and which parts are only minor rewritten extensions of the existing literature. In particular, I have the following concerns:
-
The main theoretical tool of the paper is the block RQ decomposition. This appears very similar to the partial order RQ decomposition developed in the paper "Linear Causal Disentanglement via Interventions" by Squires et al. (2023). Indeed, Definition 3 defines a block-level partial order which is the main input to Definition 4. The connection should be clarified. Moreover, the remaining proof techniques also appear to be very similar. This should at least be acknowledged.
-
I have difficulties to follow the reasoning in lines 186 to 188. In particular, why are nodes not the right abstraction level for identification any more? To get intuition, it would be helpful to show in examples why this is the case and why recovering the proposed blocks in Definition 4 is the correct level. That is, why can we not recover relations within the proposed blocks? And what is the intuition on why the blocks are exactly the right object? I would also appreciate examples on how the blocks look like.
-
In Assumption 1 the authors require that "interventions from different clients that target the same global latent node share the same label". I have several comments on this: First, while I can imagine what it should exactly mean, it should be formalized. Second, I think that this is a very strong assumption. In particular, we need to know a priori which interventional data sets corresponding to different clients are obtained from interventions on the same node. This assumption should be properly discussed. What are real-world examples where it could be defended, and where are the limitations, that is, in which scenarios does it not hold? To what extent is the assumption necessary? Third, together with Assumption 3 and the conclusion from Theorem 1, Theorem 2 then appears to be trivial to me. Since coming up with sufficient conditions for a desired results is in some sense always possible, it should be better discussed why these assumptions are necessary.
-
I am slightly concerned about the simulation study in the main part since this is only for three specific sparse graphs with fixed parameters and fixed , and the soft interventions have much higher magnitude than the original parameters. Simulations as in Section N.6 appear more interesting to me, although the description is missing details such as the strength of the interventions. The case study in Section N.7 misses references for the data, the underlying ground true latent graph, and an exact description of the available data. I did not find code for Appendix N.6 and N.7 in the provided repository.
-
Some minor weaknesses: While it is of course okay to study special cases, it should be made clear in the introduction that all relations are assumed to be linear. Moreover, it should be emphasized somewhere that the latent graph is assumed to be acyclic and that it is assumed to be known which one is the observational regime. Also, please give a definition for Hasse edges.
Questions for authors
-
Is the block RQ decomposition a special case of the partial order RQ decomposition by Squires et al. (2023)? If not, why not?
-
As in your setup, consider one client that only has access to a subset of the latent variables but there is interventional data for each of the latent variables. How is this related to assuming that the client has access to all latent variables but only to interventional data obtained from interventions on a subset of the latent variables?
-
Isn't there some scaling ambiguity in the matrix ? In the paper by Chandler et al. they rescale the largest absolute value in each row of to .
-
In Theorem 1, why do we recover and not ? With this we still have the ambiguity of ? Rather, I have the feeling that we could also identify up to permuting the columns by as in Theorem 3 in Squires et al.?
2 comments
I thank the authors for their response. The example in Section 2 is helpful and substantially improves the exposition. I will therefore raise my score by one point. Concrete examples and explanations of the underlying ideas are essential to making theoretical contributions accessible, and the added example is a welcome step in this direction.
As the discussion period approaches its deadline, we would sincerely appreciate hearing your thoughts on our response. We hope that the additional clarifications have addressed your concerns, and we welcome any further questions.
We also invite you to read our discussion with Reviewer 1CbJ, which further addresses the problem setting and the novelty of our model and theoretical results. We hope this discussion helps resolve your remaining concerns. If so, we would be grateful if you would consider revising your score upward.
Thank you again for your time and consideration.