- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper studies causal discovery across heterogeneous domains whose causal graphs may differ structurally, including edge reversals and latent confounding, without assuming a common baseline graph or intervention semantics. It introduces cross-domain invariance constraints (inv-constraints), characterizes inv-Markov equivalence using augmented maximal ancestral graphs (MAGs), and proposes Diverse-FCI, which combines within-domain conditional independence tests with cross-domain invariance tests. The algorithm is proven sound under inv-faithfulness but is not complete in general. Synthetic and real-data experiments evaluate its ability to recover domain-specific causal structures.
Critical strengths
Novel and well-motivated setting. The framework accommodates structurally different domain-specific graphs, including reversed causal directions and latent confounding, without requiring a common acyclic causal template. Figure 1 illustrates how cross-domain invariances can identify causal orientations that individual domains cannot.
Potentially significant theoretical contribution. Reducing inv-Markov equivalence to standard MAG equivalence via twin-augmented MAGs (Theorem 4.6), together with the domain-centric representation (Proposition 5.2), is an elegant approach. Diverse-FCI also provides a soundness guarantee under inv-faithfulness, although the equivalence characterization has a correctness issue discussed below.
Relevant comparisons and transparent limitations. The synthetic experiments demonstrate improved orientation recovery under substantial structural heterogeneity. The authors explicitly acknowledge the algorithm's incompleteness under latent confounding (Appendix E.4) and report settings where CD-NOD outperforms Diverse-FCI (Table 3).
Critical weaknesses
A counterexample invalidates Lemma B.5 as stated. Section 3 defines the mechanism-shift set partly through observed distributional invariance. However, Lemma B.5 uses such invariance to infer graphical (F)-separation, which Proposition 4.4 does not justify. A linear-Gaussian counterexample (given in Q1) satisfies the paper's definition of but violates the claimed symmetry of (F)-adjacencies across domain copies. Since Lemma B.4 and the necessity direction of Theorem 4.6 rely on Lemma B.5, the central characterization is not established as written. Defining stability witnesses graphically may repair this issue, but would require revising the formulation. Separately, Lemma B.6 incorrectly asserts that adjacent-pair dependence along an active path implies endpoint conditional dependence; a generic-parameter argument is needed in Lemma B.7.
Questions for authors
Q1. Correctness of Lemma B.5 and Theorem 4.6.
Consider independent standard Gaussian variables and two domains:
- Domain 0: .
- Domain 1: .
The mechanism of is unchanged, and both domains satisfy . Thus, under Section 3's definition, , with witnessing the stability of . Hard intervention on also yields a common bridge model. Nevertheless, in the augmented domain-0 graph, and are separated by , while in domain 1 they are inseparable over the observed variables because of the paths and .
This contradicts Lemma B.5's claimed symmetry of -adjacencies. The invariance results from parameter cancellation: replacing with in the domain-1 equation for gives only when . Thus, the example violates inv-faithfulness and does not contradict Theorem 6.3, which assumes it; however, Theorem 4.6 does not impose this assumption.
Could the authors clarify whether stability witnesses should instead be defined graphically, as suggested by Figure 2, and provide a corrected statement and proof of Theorem 4.6? Alternatively, does the theorem require inv-faithfulness? These remedies are not equivalent, since imposing faithfulness would change the class of distributions being characterized.
7 comments
Part 2/2
On global graphical compatibility and the necessity direction of Theorem 4.6
For , a witness construction must respect mechanism sharing across all domains simultaneously. If a mechanism is shared along a chain of domains, it must also be shared between the endpoints. These ties can imply invariances beyond those recorded by an individual pair's augmentation. Constructing witnesses independently for each pair would therefore be insufficient.
We make this issue explicit through global graphical compatibility (GC). For each observed variable , group domains connected by chains of pairs in which is stable, and let denote the group containing domain . Define
GC requires that replacing the -targets by leaves all paired -separations with a common observed conditioning set unchanged. Thus, pairwise graphical constraints must already reflect the invariances implied by global mechanism sharing. For , , so GC is automatic. Its formal definition is Equation (8) in Appendix B.3. GC does not impose a common causal ordering or a reference domain.
Theorem 4.6 now explicitly assumes GC. We acknowledge that this restricts the graph-shift tuples covered by the characterization.
Replacement of Lemmas B.6–B.7
We agree that dependence between adjacent variables along an active path does not establish conditional dependence between its endpoints. We have replaced that argument with a global Gaussian witness construction:
-
Lemma B.4, using the corrected Lemma B.5, establishes that non-equivalent twin MAGs differ on a testable within-domain CI or paired invariance query.
-
Lemma B.6 constructs one Gaussian parameter family across all domains, tying local mechanisms wherever sharing is forced, including the ties required by latent mechanisms. For every query absent from the graphical signature, the proof constructs a violating parameter point within this same constrained family. For a missing invariance, an auxiliary Gaussian source supplies an intercept perturbation that respects all sharing ties and changes one domain's conditional law while leaving the comparison domain unchanged.
-
Conditional Gaussian parameters are rational functions of the free coordinates. The explicit witnesses show that the relevant equality polynomials are not identically zero after imposing the sharing constraints. Each accidental equality therefore occurs on a null set; there are finitely many queries, so a jointly inv-faithful realization exists. The construction also realizes the prescribed graphical mechanism-shift collection.
Lemma B.7 then separates the two inv-Markov families: a faithful realization for one candidate violates the distinguishing constraint imposed by the other. This proves the necessity direction for general . Faithful distributions serve as witnesses in the proof; the characterized families themselves still include unfaithful distributions.
Effect on learning
Diverse-FCI is unchanged. Its soundness continues to rely on inv-faithfulness, now stated explicitly for all target variables, including those in . This excludes cancellation invariances such as the equality in your example and ensures that invariance tests recover the graphically defined -adjacencies.
Under the causal-model setup of Section 3, inv-faithfulness also implies GC. The forced mechanism sharing yields a common observed bridge after intervention on . If GC failed, that bridge would imply an observed invariance absent from the augmentation using , contradicting inv-faithfulness. Remark B.9 gives this argument. Thus, GC adds no independent assumption to the learning guarantee, although it is an explicit condition of the characterization theorem.
We have updated the statements and proofs of Theorem 4.6 and Proposition 5.2, replaced Lemmas B.6–B.7, and revised the soundness proof of Theorem 6.3 accordingly. We thank the reviewers for identifying these issues. These comments helped us make the formulation and proof obligations precise. We are happy to take any further questions.
Overall, the authors have addressed my main theoretical concerns. Now, I have two more questions:
- For the synthetic experiments with three or more domains, can the authors confirm that the generated graph-shift tuples satisfy GC, and explain whether this condition was explicitly verified?
- Since the mechanism-shift set has been redefined graphically, can the authors provide precision and recall for the recovered (F)-adjacencies against the corresponding theoretical shift sets on synthetic data? This would help establish how reliably the algorithm recovers the distinctive information targeted by the revised framework.
Part 1/2
Thank you for the careful reading and for identifying the issue in Lemma B.5. Your counterexample is correct. The original proof used an observed invariance to infer a graphical separation, which Proposition 4.4 does not justify. We have revised the formulation and replaced the affected arguments.
On graphical stability and Lemma B.5
We adopt graphical stability witnesses, as you suggested. In Section 3, we first identify the genuinely changed mechanisms, including possible changes at latent variables. We then construct an observed mechanism-shift set I(i,j) by graphical closure: an observed variable is added whenever no common observed conditioning set separates it from the auxiliary source F(i,j) in both domain augmentations. The process continues until no further variable is added.
Consequently, an observed variable outside I(i,j) has an unchanged mechanism and admits a common observable separating set:
\quad\text{and}\quad (F^{(i,j)}\perp X^{(j)}\mid W^{(j)}).$$ An unchanged mechanism can still belong to $I^{(i,j)}$ when such a common observed witness is unavailable. This distinction is necessary under latent confounding. Lemma B.5 now follows graphically. Variables in $I^{(i,j)}$ have direct $F$-arrows in both copies; variables outside it have the common separator supplied by the closure. These properties survive latent projection and passage to the twin augmented MAG. Thus, $$F^{(i,j)}\to X^{(i)} \iff F^{(i,j)}\to X^{(j)} \iff X\in I^{(i,j)}.$$ The proof no longer infers separation from a distributional equality. **Your counterexample under the revised definition** In your example, the genuine mechanism change is at $X$. With only $F\to X$, domain 1 has no observed separator between $F$ and $Y$: leaving $X$ unconditioned keeps $F\to X\to Y$ active, while conditioning on $X$ opens $F\to X\leftarrow U\to Y$. The graphical closure therefore gives $I^{(0,1)}=\{X,Y\}$, and the final augmented graphs have symmetric $F$-adjacencies. The equality $P^{(0)}(Y)=P^{(1)}(Y)=\mathcal N(0,3)$ still holds, but is an accidental invariance not implied by the graphical constraints. The distribution tuple satisfies the revised inv-Markov property and is inv-unfaithful. We have included this example in Appendix B to make the distinction explicit. **Scope of the characterization** We agree that defining stability graphically and restricting the characterized distributions to faithful ones are different remedies. We use the graphical formulation. For a fixed graph-shift tuple $(\mathbf G,\mathcal I)$, Definition 4.1 specifies the family of all distribution tuples satisfying its within-domain CI and cross-domain invariance constraints, including unfaithful tuples. Theorem 4.6 does not impose inv-faithfulness on membership in this family. We choose not to introduce inv-faithfulness at the direction because it is only required for learning. Sections 3–4 and Appendix B now state this formulation explicitly. We have also revised the bridge argument to handle changed latent mechanisms through a common observed post-intervention distribution.