- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
The paper develops a general-purpose framework for exact causal inference using probabilistic circuits (PCs), addressing limitations of existing methods that primarily support discrete variables and backdoor adjustment. It identifies two key shortcomings in prior approaches of Wang & Kwiatkowska (2023), and introduces T-ID, a tractability-aware extension of the ID algorithm, and proves its soundness and completeness for determining causal query identifiability and tractability. The paper validates the theoretical results through experiments on synthetic continuous and mixed structural causal models, reporting results consistent with the theoretical predictions.
Critical strengths
The paper appears to make a significant technical advance over the existing work of Wang and Kwiatkowska (2023).
Critical weaknesses
-The paper is very difficult to follow because many concepts are introduced through abstract definitions without sufficient intuition or illustrative examples. The presentation appears to assume substantial familiarity with probabilistic circuits and the prior work of Wang and Kwiatkowska (2023). Concrete examples demonstrating the key concepts would significantly improve the paper. This difficulty also prevented me from confidently assessing the technical soundness of the work.
-The claim that causal effects are mostly computed approximately is not accurate. The paper does not acknowledge the extensive literature on estimating backdoor estimands, including inverse probability weighting (IPW), propensity score matching, double/debiased machine learning (DML), and many more. Recent work has also investigated the estimation of general causal expressions produced by the ID algorithm, including Graph-based Complexity for Causal Effect Evaluation by Plug-in (AISTATS 2025), Estimating Causal Effects from Learned Causal Networks (ECAI 2024), and Estimating Identifiable Causal Effects through Double Machine Learning (AAAI 2021). The paper needs to clarify the specific advantages of probabilistic circuits. In particular, I'd expect a comparison of computational complexity and scalability.
Questions for authors
The paper states a complexity bound of O(C^K) for T-ID, where C denotes circuit size and K is associated with the complexity of composition. How do these quantities relate to the size of the underlying structural causal model (SCM) or causal DAG or causal estimand? How do they scale with the graph structure or the complexity of the query, and under what conditions does the bound remain practically tractable as the problem size increases?
How does the proposed approach compare with well-known estimators such as IPW and DML, as well as recent methods for estimating general expressions produced by the ID algorithm? What are the main advantages and limitations of the proposed approach in terms of computational complexity, scalability, and the range of causal queries it can handle?