- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper studies causal structure learning for latent-tree structural causal models from observational data. The authors propose a differentiable framework that combines two main components. First, they formulate latent-tree skeleton recovery as a differentiable triplet branch-point (TBP) completion problem, where simplex-valued assignments are used to jointly infer unknown branch-point identities and latent-related distances. Second, they introduce a three-terminal independence (TTI) condition for identifying the unique latent root under linear non-Gaussian assumptions, after which all edges can be oriented away from the recovered root. The paper also provides population-level identifiability results and evaluates the proposed method on a broad collection of synthetic latent-tree structures, the White Wine Quality dataset, and a VAE-based proof-of-concept experiment.
Critical strengths
- The paper presents a novel differentiable formulation for latent-tree causal discovery. The proposed TBP objective provides an interesting way to jointly recover latent-tree structure and latent branch-point information.
- The TTI criterion provides a principled mechanism for causal orientation. Under the linear non-Gaussian latent-tree assumptions, the paper establishes a root-identification result that enables recovery of the directed tree.
Critical weaknesses
- There is a gap between the theoretical guarantees and the practical algorithm. The main recovery results assume that the learned distance matrix is already a tree metric, while the proposed optimization does not explicitly enforce this condition.
- The empirical validation of some key claims is still limited. In particular, the paper does not directly evaluate root-identification accuracy for TTI.
- The applicability of the method is limited by its strong reliance on a linear non-Gaussian latent-tree model with a unique latent root.
Questions for authors
See weaknesses.
3 comments
Thank you for the detailed response and additional experiments, which have addressed my concerns. I appreciate the authors' clarifications and will maintain my current positive rating.
Thank you very much for your positive assessment and constructive suggestions. Following your suggestion, we have added an evaluation of TTI's root-identification performance using ground-truth skeletons to Section 6.2 and the corresponding appendix of the revised manuscript.
Response to Reviewer Lj2M
We thank the reviewer for recognizing our proposed differentiable latent-tree learning framework and the theoretical contribution of TTI to root identification, as well as for raising important questions and suggesting additional experiments. We address each point below.
W1: Gap Between the Optimization Objective and the Tree-Metric Guarantee
Theorem 5.1 establishes that a tree metric with zero TBP loss admits an additive-tree realization. In practice, we implement this process in two stages: we first use the differentiable TBP objective to learn information distances involving latent nodes, and then apply MST to extract an explicit tree skeleton from the learned distances. Ideally, when the learned distances satisfy the tree-metric condition and the TBP loss is sufficiently small (ideally zero), the MST-derived skeleton provides the additive-tree realization characterized by Theorem 5.1. We also explored incorporating explicit tree-structure constraints directly into the optimization, but found them less effective in practice. Empirically, we observe that TBP optimization typically produces information-distance matrices that are already close to those induced by the ground-truth tree, allowing the subsequent MST step to recover the skeleton effectively. The strong structural recovery results reported in the main paper further support this two-stage design.
W2: Empirical Evaluation of TTI's Root Identification Capability
We thank the reviewer for the suggestion on additional experiments: To independently evaluate the root-identification capability of TTI while excluding the influence of skeleton recovery errors, we conduct additional oracle-skeleton experiments. Specifically, we directly provide TTI with the ground-truth undirected latent-tree skeleton, bypassing the skeleton recovery stage, and consider all latent nodes as candidate roots.
We conduct experiments on three structures corresponding to Figures 6(a), 3, and 7 in the paper. Figures 6(a) and 3 contain six observed nodes and three and four latent nodes, respectively, while Figure 7 contains 30 observed nodes and four latent nodes. For each structure, we use 50 datasets, each containing 5,000 samples with exponential noise. The root recovery rate is 100% across all three experimental settings. That is, the root selected by TTI agrees with the task-specified ground-truth root mapping in every run. By bypassing the skeleton recovery stage, these experiments directly evaluate the root-selection performance of TTI given the correct skeleton. We will further evaluate this experiment across all structures considered in the paper and include the corresponding results in the revised manuscript.
W3: Model Applicability and Methodological Novelty
We agree with the reviewer's observation that the model class studied in this paper is relatively restrictive, particularly in terms of the tree-structure assumption and the general SCM assumptions. At the same time, we view the tree structure as a deliberate structural inductive bias that captures sparse, hierarchical, and interpretable latent causal relationships. Furthermore, the novelty of our work lies not simply in imposing a tree-structure constraint, but in translating theoretical properties of latent-tree models into differentiable structure-learning criteria and further enabling complete causal structure recovery. By integrating information-distance learning, skeleton recovery, root identification, and causal orientation into a unified framework, our work establishes a connection between theoretical identifiability and practical differentiable learning.
We sincerely thank the reviewer again for their patience and valuable suggestions.