- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper proposes an end-to-end framework for high-dimensional causal mediation analysis that automatically discovers candidate mediation paths, selects adjustment sets, and estimates natural direct and indirect effects from observational data. The proposed method has three stages. First, it performs causal discovery on strongly corrected pairs of variables. Then, it identifies the common adjustment set of all sampled possible causal graphs. The final step is to estimate the mediation effects using a channel-additive model. Experiments demonstrate scalability to thousands of variables and promising estimation accuracy, including an application to the Human Phenotype Project.
Critical strengths
-
Scalable automated mediation analysis with high-dimensional observational data is an important problem in practice, especially for large biological datasets. The proposed method scales linearly with the number of variables and can estimate the mediation effect end-to-end.
-
Extensive experiments validate the soundness of the method. The paper separately evaluates causal discovery, effect estimation, and the complete end-to-end pipeline. The experiments cover up to 10,000 variables, compare against several established methods, investigate missing data and adjustment-set disagreements, and include a real-data application to the Human Phenotype Project.
Critical weaknesses
-
The framework generates candidate DAGs by randomly sampling consistent extensions of a learned partially directed graph and subsequently applying heuristic score-based refinements. However, the resulting distribution over DAGs is neither a posterior distribution nor a statistically calibrated confidence set. It is totally possible that one adjustment set is valid across all sampled DAGs but still fails in the true causal graph. I wonder if you observe such failure in your experiments.
-
The end-to-end experiments assume a complete five-tier ordering of variables and restrict the adjustment sets to at most two variables. Furthermore, the synthetic generator is designed with a valid two-variable adjustment set, matching the algorithm's imposed restriction . Could the authors evaluate the framework on DGPs requiring larger adjustment sets (e.g., three or more variables), while varying (K) accordingly? It would also be interesting to investigate how performance changes when the complete tier ordering is unavailable or only partially specified.
Questions for authors
Please see the weakness section.