- Rating
- 3
- Confidence
- 1
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes incidence-structured spatial factors (ISF) for latent causal discovery. ISF constructs spatial loadings from whole membership units, with each unit assigned to at most one latent variable while allowing observed sites to have multiple latent parents. The paper proves that a pairwise hypergraph projection can fail to determine latent coordinates that are identifiable from the full incidence structure. It also establishes identifiability for unsmoothed factors under anchor and bridge conditions. Synthetic experiments evaluate latent recovery and causal discovery against kernel-based and other baselines.
Critical strengths
-
The separation result connects ambiguity in hypergraph projections to ambiguity in latent coordinates, providing a substantive reason to preserve incidence information.
-
The anchor and bridge conditions clarify how membership structure constrains latent representations, including with dependent latents and site-specific nonlinear observation maps.
-
Shared-training comparisons, structure-preserving rewiring, reconstructed memberships, and repeated independent draws help distinguish structural benefits from training effects.
Critical weaknesses
I'm not familiar with the topic of this paper, and I find only one notable weakness: the paper combines two distinct choices: constructing loadings from whole hyperedges and restricting each hyperedge to at most one latent variable. However, Appendix G, Table 32 shows that continuous nonnegative loadings on the same hyperedge dictionary outperform the proposed assignments in both settings, which support the value of the hyperedge dictionary more strongly than the single-parent restriction used in the identifiability theory.
Questions for authors
In Section 2, Identifiability, the authors claim that "pure-measurement conditions identify linear latent causal structure". In fact, some studies [1,2] do not rely on this condition. I recommend the authors to discuss this point.
[1] Learning linear bayesian networks with latent variables. ICML 2013.
[2] Recovery of causal graph involving latent variables via homologous surrogates. ICLR 2025.
3 comments
Thanks for your response. I have no other concern. Because I'm not familiar with the topic of this paper, I'd like to maintain my positive score with a low confidence.
Thank you for your kind reply and for maintaining your positive assessment of our work. We are delighted to hear that all of your concerns have been resolved. Your feedback from a broader perspective has been very helpful in improving the clarity and accessibility of our manuscript.
Response to Reviewer dP8Y
We thank the reviewer for the careful reading of the appendix and for the two references. Below, we address each point. All new experiments use the code from the submission and will be added to the revised paper.
W1 – Hyperedge dictionary and single-parent restriction– We agree. The two choices have different roles, and Theorem 1 now needs the restriction only on anchor-bearing units.Thank you for this observation. It led to a stronger result.
New in this response: the guarantee needs the assignment only on anchor-bearing units. Call a unit anchor-bearing when it contains a site that belongs to no other unit. Beyond the anchors of the true factor, the proof of Theorem 1 uses the assignment of a candidate factor only on these units. Theorem 1 therefore holds, with the same proof, when anchor-bearing units load on at most one mode and all other units carry continuous nonnegative loadings. We will state this as a corollary.
New experiment. We compare three ISF variants on one hyperedge dictionary. Table 32 covers only the committee hypergraphs. The new runs add the anchored structures of Appendix F.4, where Theorem 1 applies, and twin incidences built from Theorem 2.
Table R3: Mean latent MCC of three ISF variants, over ten structures or draws with three model seeds each. Bold marks the best value in each row. The committee rows rerun Table 32 on different hardware.
In the revision, we will present Definition 1 as the factor family and the single-mode restriction as the hypothesis class of the theory. We will also report the three variants side by side in the main text.
Q1 – Identification without pure measurements– Thank you, we agree. We will revise the sentence in Section 2 and cite both works.Both works identify latent structure without pure children.
The revised sentence will say that pure-measurement conditions are one route to identifying linear latent causal structure, and that these works remove the need for pure children.
The same distinction appears in our paper. Theorem 1 uses anchors, a condition of the pure-measurement kind. The fixed-incidence part of Theorem 2 and the cyclic family of Section 5.1 identify the latents in their stated classes without any anchor. Every site belongs to two units in the first, and to three units in the second.
We hope these clarifications and the new results strengthen your positive assessment.
[1] Anandkumar, Hsu, Javanmard and Kakade. Learning Linear Bayesian Networks with Latent Variables. ICML 2013.
[2] Li, Wang and Liu. Recovery of Causal Graph Involving Latent Variables via Homologous Surrogates. ICLR 2025.