- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies target-centric -hop causal subgraph recovery and proposes TCSL, combining correlation-based screening, stochastic node gating, higher-order structural mixing, conditional affine flows, and an acyclicity constraint. The method achieves a favorable accuracy–cost trade-off in some settings. However, gaps remain between the problem motivation, the causal interpretation of the method, and the experimental evidence.
Critical strengths
- The problem has practical relevance. Recovering intermediate-scale structures around a target could combine the efficiency of local discovery with the structural coverage of global methods.
- The task and inference pipeline are clearly specified. The inputs, query radius, and output subgraph are defined explicitly. Neighborhood extraction operates on the predicted graph without requiring ground-truth neighborhood information.
- Some empirical results are promising. In several synthetic settings, TCSL reports better structural recovery than local baselines, while its runtime is lower than the full-graph training cost of the compared global methods.
Critical weaknesses
-
The problem definition is not fully aligned with the motivation. The introduction emphasizes multi-step causal influence, whereas the task defines neighborhoods using undirected skeleton distance. Such neighborhoods can contain nodes with no directed causal path to or from the target. The authors should clarify whether the objective is structural neighborhood recovery or causal mechanism recovery, and connect each motivating challenge to a corresponding methodological design.
-
The substantive contribution of the combination remains unclear. The paper does not establish why this particular combination is necessary or what property it provides beyond a straightforward integration of existing components. Controlled comparisons, particularly existing structure learners operating on the same candidate sets, are missing. Consequently, the contributions of screening, gating, and higher-order mixing remain difficult to separate.
-
The method’s correspondence to direct causal edges is insufficiently justified. Higher-order mixing in Eqs. (10)–(12) allows non-parent ancestors to enter a node’s conditional model, yet A is interpreted as the adjacency matrix of direct causal relations. Acyclicity and valid density evaluation alone do not establish this interpretation. Moreover, screening may exclude common causes, so causal sufficiency of the full variable set need not hold within the candidate set.
-
The evidence does not adequately cover the multi-hop claims or their boundaries. The main ablations and real-world evaluation are restricted to k=1. Reported error bars capture variation across targets rather than independent graphs or random seeds, and edge-level metrics do not directly establish pathway recovery.
Questions for authors
-
What is the precise recovery objective? Please distinguish structural neighborhoods from directed causal pathways and explain how the chosen definition addresses the mechanism-analysis needs stated in the introduction.
-
What unique property does the combination provide? Which component distinguishes indirect causality from spurious association, and why would screening followed by an existing method be insufficient?
-
How is the causal interpretation of the output justified? When higher-order mixing introduces non-parent ancestor information and screening may omit common causes, why can A still represent direct causal structure?
-
Can the experiments directly test the central claims? Please consider comparisons using identical candidate sets, ablations at k=2,3, and separate metrics for candidate coverage, node-set recovery, and directed-path recovery.