- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper investigates causal discovery among unobserved latent variables. Existing methods for recovering causal structures among latent variables may fail to identify the true causal graph uniquely, and some approaches also suffer from high computational cost. Under the strong assumption of a pure latent model, this paper first reconstructs the latent covariance and precision matrices from the observed data. It then estimates the causal structure among the latent variables using a peeling procedure that sequentially removes terminal vertices based on the diagonal entries of the precision matrix.
The paper further introduces an identifiability condition requiring, at every peeling step, the precision diagonal of each terminal vertex to be smaller than those of all non-terminal vertices, together with a minimum signal strength condition. Under these conditions, the authors theoretically show that the method can recover the fully directed true latent DAG itself, rather than only its Markov equivalence class. The paper also derives the sample complexity required when CLIME or Graphical Lasso is used to estimate the precision matrix. Experiments on synthetic data demonstrate that the empirical recovery performance is broadly consistent with the theoretical predictions.
Critical strengths
The critical strength of this paper is that it proposes a new method for causal structure learning among latent variables by combining latent covariance/precision matrix reconstruction from observed data with a peeling procedure that sequentially removes terminal vertices based on the diagonal entries of the precision matrix. This results in a computationally efficient framework with theoretical guarantees for latent causal discovery.
Regarding the theoretical guarantees, the paper combines the theoretical properties of the individual components with identifiability and minimum signal strength conditions, and shows that the overall method can recover the fully directed true latent DAG itself, rather than only its Markov equivalence class.
Another strength is that the paper derives explicit sample complexity results when CLIME or Graphical Lasso is used for precision matrix estimation.
Critical weaknesses
The paper is generally well organized, clearly written, and theoretically sound. However, its most significant drawback is the lack of any discussion on how to determine the number of latent variables. The paper provides neither a practical criterion for selecting the latent dimension nor an analysis of how the estimated causal graph may change depending on this choice. This issue could become a major obstacle to the practical use of the proposed method. A discussion of this problem, together with some principled criterion for selecting the number of latent variables, could substantially broaden the applicability of the proposed framework.
In addition, the paper does not sufficiently discuss how likely the diagonal-entry condition required by the peeling procedure is to hold in real-world data. Even for observed variables, this condition is not particularly intuitive to assess in practice, and for latent variables it is even less obvious how a user could determine whether the condition is plausibly satisfied. Discussing how restrictive this assumption is in realistic settings, how often it may be expected to hold, or whether there are simple sufficient or diagnostic criteria for assessing it would further improve the practical applicability of the proposed method.
Questions for authors
- Could you discuss how the number of latent variables should be determined, or how the choice of the latent dimension affects the recovered causal structure?
- Could you discuss how likely the precision-matrix diagonal condition required for the peeling procedure is to hold in real-world data, or whether there is a simple practical criterion for assessing whether this condition is satisfied?
2 comments
Thank you for your thorough response. I understand that the diagonal-entry condition has been empirically examined in prior work. Regarding the number of latent variables, I understand that the authors primarily rely on prior domain knowledge in practical settings, while estimating the number of latent variables is considered an important direction for future work. Overall, I believe my concerns have been addressed to a reasonable extent. Since my original evaluation was already in favor of acceptance, I will keep my rating unchanged.
We sincerely thank the reviewer for their very kind and encouraging assessment of our manuscript, as well as for raising two thoughtful questions regarding practical senario. We appreciate these constructive suggestions. We address both questions in detail and outline how we will incorporate these discussions into the revised manuscript.
1. Real-World Plausibility of the Identifiability Condition
We thank the reviewer for raising this important practical question about how likely Assumption 1 is to hold in real-world data.
Our diagonal-gap identifiability condition is directly adapted from the foundational precision-matrix DAG learning framework of Ghoshal & Honorio (2018) ("Learning linear structural equation models in polynomial time and sample complexity", AISTATS 2018). Notably, in their work, Ghoshal & Honorio specifically examined the applicability of this exact condition on 7 real-world gene-expression datasets, demonstrating that precision-matrix diagonal ordering serves as an effective and reliable structural criterion in real-world biological networks. In Addtion we do have a real world example experiment included in the appenddix.
In the revised manuscript, we will explicitly cite Ghoshal & Honorio's real-world empirical findings alongside this variance-ratio intuition in Section 3.3 so practitioners have clear context on when Assumption 1 is expected to hold.
2. Determining the Number of Latent Variables (p)
We agree with the reviewer that understanding how the latent dimension p is chosen and how its choice impacts recovery is a very important aspect of applying latent variable models in practice.
To the best of our knowledge, our work is the first to establish provable, finite-sample guarantees for exact, fully-directed DAG recovery in pure latent high-dimensional SEMs (including Gaussian and sub-Gaussian regimes). Prior methods either recover only Markov equivalence classes/CPDAGs (e.g., Silva et al., 2006), require strict non-Gaussianity and higher-order cumulants without finite-sample O(logp) guarantees (e.g., GIN / Cai et al., 2025), or assume all variables are directly observed (e.g., Ghoshal & Honorio, 2018). Because no existing baseline solves this exact problem with comparable theoretical guarantees, we made our best effort in the experiments to construct reasonable comparison baselines (such as two-stage combinations of latent covariance/cluster estimation with observed-data DAG/CPDAG solvers, as well as oracle baselines) and focused our theoretical analysis on establishing exact recovery given p.
In many applied settings, p is determined a priori by domain structure (for example, in our fMRI experiment, voxel measurements are naturally partitioned into p anatomical Regions of Interest). When p is not known in advance, practitioners can estimate it in a preliminary step using existing pure-cluster/tetrad tests (e.g., BPC or FOFC) or spectral eigenvalue thresholding on ΣXX.
We fully agree with the reviewer that estimating the unknown number of latent variables p alongside exact finite-sample latent DAG recovery is a very valuable and natural extension of our framework.