- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
The paper proposes SCION, an ASP formulation of the overlapping causal graph integration problem addressed by ION, using the underlying optimizations of the clingo solver for more efficient computation. It further extends the formulation to the time-series setting with Markov order 1 ground-truth processes. Experiments demonstrate improved computational efficiency over ION and the benefits of incorporating time-lag information.
Critical strengths
The simulations demonstrate the computational feasibility of using clingo to scale SCION to sparse graphs of moderate size, and suggest that SCION-TS can also handle time-series instances. This has potential practical value.
Critical weaknesses
The theoretical rigor of the paper is seriously limited. Examples include:
-
The treatment of bidirected edges and edges with circle endpoints in Listing 1.
-
Line 20 of Listing 1 is only a rule for deriving bidirected. When bidirected is supplied as an input fact, this rule does not require the candidate DAG's MAG to realize that bidirected edge, including the inducing path and the non-ancestral relationships at both endpoints in the candidate DAG
-
Listing 1 provides no constraints requiring input facts expressed using causalconn and undirected_causalconn to match relationships induced by the candidate graph. A candidate can therefore satisfy the program without the required connection.
- For example, consider a single input PAG , encoded as an undirected_causalconn fact according to the description in lines 143–146. Listing 1 admits the empty candidate DAG, in which . This contradicts the d-connection preservation claimed in Theorem 1.
-
For , the candidate DAG must realize the corresponding adjacency in the MAG and satisfy . Circle endpoints also cannot be completed independently edge by edge. The resulting MAG must belong to the Markov equivalence class represented by the input PAG. These conditions are neither analyzed nor implicit in the paper's current treatment.
-
-
The paper conflates DAG, MAG, PAG, and latent-projection ADMG.
-
The output graphs are defined as DAGs in lines 104–105, whereas Theorem 2 quantifies over a PAG and concludes that it belongs to the output set.
-
Lines 196–198 directly call the result of marginalizing a known DAG a PAG, using becoming as an example. First, if the graph in this example is intended to be a PAG, the orientation between and should be undetermined. Second, this operation could yield either a latent-projection ADMG or a MAG, and the authors’ current description is unclear.
-
-
The proofs in the appendix lack rigor and clarity. Examples include:
-
Lines 646–649: Line 22, together with the recursive definitions, excludes certain directed paths and common-cause paths whose internal nodes are unobserved in the relevant input. This does not directly exclude general active paths under arbitrary conditioning sets. Moreover, activating a collider by conditioning on its descendant does not imply that directed paths exist from both endpoints to that descendant. The appeal to the recursive directed rules therefore does not establish the claimed contradiction.
-
Lines 651–656: Line 23 only constrains definite directed input edges. The proof does not explain how it covers bidirected edges, edges with circle endpoints, or general connection relations under arbitrary conditioning sets.
-
Lines 664–665: The fact that clingo enumerates all graphs satisfying the encoded constraints does not by itself establish completeness for the original problem.
-
[1] Ancestral graph Markov models. Ann. Statist. Thomas Richardson, Peter Spirtes. 2002.
Questions for authors
Could the authors provide a more rigorous and clearer graph-theoretic discussion (for example addressing the issues raised in the Weaknesses section)?