Summary
The paper studies causal effect identification and estimation in exchangeable data. The main result here is theorem 1, which shows that causal effects are identifiable in ICM generative processes.
Strengths
- The paper provides a great framework to think about interventions in exchangeable data. Starting from what interventions should be considered (Definition 3) to identifying a procedure for computing the post-interventional distributions.
- The paper presentation, at least in the first part, was simple and intuitive. I always found myself asking a question and then find it being answered in the next paragraph. However, probably due to space constraints, this did change in the latter parts of the paper.
Weaknesses
- The latter parts of the paper is rushed and left me confused. For example, it is unclear how causal de Finetti theorems apply to the Causal Pólya Urn Model, Theorem 2, and the entirety of section 4 is very rushed and I have struggled to understand what theorem 2 say exactly.
- I have felt that the algorithm could have taken more of real-estate in the presentation of the paper. Also, it is unclear how the graph structure is learned in the algorithm
- This is more of a nit pick, but the appendix contains a few typos and is in a worse state in general than the main text. For example, the use of index i in equation 51, 53, ...
Questions
- In the experiments, it seems to me that the model generating the synthetic dataset is different from that described in section 3.2. In particular, in the experiments, X_i is sampled from a Ber(theta) and hence P(X_i = 1) = P(X_2 =1) = ... = theta, whereas if I understood the model in 3.2, then the probability P(X_n =1) will be much greater than P(X_1 =1) if for example all X_m =1 for all m < n. Are they actually different? Or did I misunderstood? And how can the model described in 3.2 be represented by equation 4? (I read F.2 but it seems to me that equation 51 follows the model in Section 5).
- In the experiments, can the authors elaborate on the IID baseline? Do you run the algorithm on the "full" graph G which have nodes X_1 Y_1 X_2 Y_2? I assume this is what's been done as it is the fairest baseline, but I'm not sure. Appendix K seems to imply that and the main paper did not make it clear.
- In the description of ICMs, the author mention the expression:
> Causal mechanisms are independent of each other in the sense that a change in one mechanism P(Xi | PAi) does not inform or influence any of the other mechanisms P(Xj | PAj)
What would be a concrete example where such condition is violated?
Limitations
It has been addressed.