- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes CHRONOS, an answer set programming method for reconstructing latent graphs from observed lagged relations. It formalizes forward marginalization and searches for compatible unit-lag graphs, minimizing latent nodes and then edges while enumerating all optimal solutions. A relaxed formulation accommodates errors in the input relations. Validation includes synthetic experiments and an application to METR-LA traffic data using estimated lagged graphs.
Critical strengths
The ASP formulation explicitly accommodates multiple optimal latent structures and distinguishes proving optimality from completing their enumeration. The synthetic experiments systematically examine how graph size, density, and latent fraction affect runtime and solution ambiguity. This provides useful evidence about when exhaustive reconstruction is computationally feasible and how much ambiguity remains even under the minimality criterion.
Critical weaknesses
The paper does not establish the scientific value of recovering a minimal latent graph. Figure 1 shows that minimality can exclude the true structure, yet neither the theory nor the experiments explain what useful causal knowledge the resulting graph provides beyond the input lagged graph. Consequently, the paper demonstrates a graph optimization procedure without establishing its value for latent causal recovery, leaving the significance of its central contribution unsupported.
Questions for authors
What scientifically meaningful conclusions about the underlying causal system can be drawn from the minimal latent graphs returned by CHRONOS?
7 comments
Thank you for the clarification. I understand the intended role of minimal latent structures, but my central concern about their scientific significance remains unresolved. As the authors acknowledge, reliable causal recovery and downstream practical benefits have not been independently validated. The response therefore does not establish how these outputs provide useful insights into the underlying causal system, and I maintain my original rating.
Thank you for your follow-up. We would like to address the remaining concern directly, since we believe the paper does provide evidence of the kind you are asking for.
Recovery against known ground truth: In our synthetic experiments, the true latent structure is known, so recovery can be checked directly. Across 3,624 cases, the number of latent variables recovered by CHRONOS equaled the true number in 86% of cases and never exceeded it, consistent with its role as a lower bound; 84% of cases had a single minimal explanation. We will state these results explicitly in the revision as validation of recovery, rather than only as properties of the search.
What the outputs tell us about the system: Recovery of latent structure from lagged relations is not identifiable in general (Figure 1). In such settings, as with the equivalence classes returned by PC or FCI, the scientifically meaningful conclusions are those shared by all admissible explanations. CHRONOS provides three: (i) a lower bound on how many hidden variables the system must have; (ii) the structural features common to all minimal explanations, which are established within the model class; and (iii) the features on which they differ, which identify exactly what additional measurements would be needed to distinguish them.
Scope of the claims: CHRONOS is designed for the setting the paper proves to be non-identifiable: it determines exactly what lagged observations imply about hidden structure, which is the strongest conclusion such data can support. We will make this framing, and the validation above, more prominent in the revision.
We thank the reviewer for asking what scientific conclusions the reconstruction supports. CHRONOS makes explicit constraints on latent complexity and candidate mechanisms implied by the observed lag relations. We will clarify which conclusions follow from those relations and which additionally depend on the minimality criterion.
CHRONOS addresses a concrete question: what is the least hidden dynamical structure needed to explain the observed lag relations under the stated model? This differs from identifying the particular generating mechanism, and Figure 1 illustrates why the distinction matters.
With exact input, the optimal latent count establishes a lower bound on the number of latent variables required in our unit-lag representation. Any model in this class with fewer latent variables is incompatible with the observed relations. This is a constraint on possible explanations of the system, even when its actual structure remains unidentified. The bound concerns latent variables in the unit-lag representation, rather than necessarily distinct physical entities.
The returned graphs additionally provide explicit realizations of the joint lag constraints. They show how hidden mediators, shared latent influences, and latent feedback can collectively account for the observations. Their value is to turn an implicit space of possible explanations into concrete models that can be inspected and assessed against domain knowledge or additional measurements. These are candidate mechanisms; minimality alone does not establish that any particular one generated the data.
Enumeration makes the dependence on parsimony transparent. Features shared by all returned graphs are necessary within the optimal class, whereas features that vary expose alternatives unresolved by that criterion. A singleton class establishes uniqueness under the objective, not unconditional identification of the true system.
We will add a subsection distinguishing these three outputs: a lower bound on latent complexity, explicit minimal candidate mechanisms, and structural features conditional on minimality. The METR-LA application demonstrates construction of such hypotheses; it does not independently validate their physical interpretation.