- Rating
- 2(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
Kode is a knowledge-informed pretrained model for causal discovery. It encodes plausible, impossible, and unknown relations in a structural-prior matrix and combines this knowledge with observational data through a dual-source encoder and graph decoder. Curriculum learning and ground-truth anchors are used to improve the use of structural knowledge.
Critical strengths
1.Supporting incomplete structural knowledge through a soft input is practically useful. The dual-source architecture gives a coherent way to combine knowledge and observational data.
2.The study includes synthetic mechanisms, different graph sizes, industrial datasets, and ablations of the training strategy. Appendix D.4 also includes prior-aware PC, GES, and NOTEARS controls.
Critical weaknesses
1.The comparisons do not cleanly isolate knowledge integration. Kode and the pretrained baselines use different training distributions and graph sizes. The prior-aware controls in Appendix D.4 help, but cover one synthetic setting and use different forms of knowledge. The gains cannot yet be attributed cleanly to the proposed knowledge interface.
2.The meaning of the structural prior needs clarification. Section 3.3 defines entries through possible direct or indirect influence, while ground-truth anchors use adjacency information. An absent direct edge is not an absent causal path. How these meanings are distinguished affects what the model is actually learning from the prior.
3.Robustness to imperfect knowledge is not sufficiently established. Masked ground-truth priors and fully random priors are useful controls, but leave a gap between correct knowledge and realistic mixtures of correct, incorrect, and contradictory expert statements.
Questions for authors
1.What remains of the gain when a matched pretrained backbone receives the same training distribution, and conventional baselines receive the same usable forbidden relations?
2.How are adjacency-based anchors distinguished from reachability-based priors, and how does performance change under partial corruption of otherwise informative knowledge?
6 comments
3.Robustness to imperfect knowledge is not sufficiently established. Masked ground-truth priors and fully random priors are useful controls, but leave a gap between correct knowledge and realistic mixtures of correct, incorrect, and contradictory expert statements.
We thank the reviewer for the comment. We agree that masked ground-truth priors and fully random priors do not adequately capture the mix of correct, incorrect, and contradictory statements that can occur in expert knowledge. We use coarse-grained relations to make prior knowledge easier to obtain and to reduce errors introduced by overly specific judgments. For example, suppose the true causal structure is A -> B -> C. Even without knowing the direct connections, an expert can provide the coarse-grained statement “A may influence C” to guide learning. This statement leaves open whether there is a direct causal edge from A to C. Similarly, the topology of a production line or the order of its operations may allow an expert to conclude that “C cannot influence A” and encode C -> A as a forbidden edge without knowing the complete causal structure. Experts can often make such coarse-grained judgments with greater confidence. In practice, users can also select high-confidence statements for inclusion.
When expert statements are encoded using , explicit contradictions can be identified, for example, when one statement affirms a relation and another denies that same relation. Such conflicts can be referred to experts for review. If a conflict remains unresolved, the relation can be marked as unknown -1 to limit the amount of unreliable information supplied to the model.
To address this gap in our experiments, we have added robustness tests that mix correct and incorrect prior entries in controlled proportions, as detailed in Appendix D.5. The results show that the model can still make effective use of prior knowledge over a range of the error rates tested. We will limit our robustness claims to the conditions supported by these experiments and investigate more complex contradictions and systematic biases in expert knowledge in future work.
Q1:What remains of the gain when a matched pretrained backbone receives the same training distribution, and conventional baselines receive the same usable forbidden relations?
We thank the reviewer for the question. The ablation results in Figures 9 and 10 show that the pretrained backbone (BCNP), when given prior knowledge without Kode's accompanying architecture and training strategy, still performs worse than the full Kode model. This indicates that the gains cannot be attributed solely to the knowledge input. Figure 5 also shows that Kode adapts better to graphs with different numbers of variables. This ability reflects the combined effects of the training strategy, padding with a very small value, and knowledge integration, and is one of the contributions of this work.
For the traditional baselines, Appendix D.4 and the two rightmost panels of Figure 11 compare performance when the methods are given the same usable forbidden relations.
Besides, Kode outperforms these baselines even in the “0% knowledge” setting, where Kode itself receives no prior knowledge. This result highlights Kode's performance and indicates that its training also contributes to its advantage.
Q2:How are adjacency-based anchors distinguished from reachability-based priors, and how does performance change under partial corruption of otherwise informative knowledge?
We thank the reviewer for the question. The main purpose of introducing adjacency-based anchors is to diversify the priors seen during pretraining. Kode uses no separate type label to distinguish adjacency from reachability. It treats both as relational information and processes them jointly with the observational data. Because the reachability matrix can be derived from the adjacency matrix, large-scale pretraining with supervision from ground-truth causal graphs helps the model distinguish, to some extent, between direct connections and indirect effects. As a knowledge-informed model, Kode combines prior knowledge with data to predict the graph. A shared encoding therefore does not require it to interpret every positive entry as a direct edge or simply reproduce the prior as its output. How the model interprets each type of prior internally and how it avoids confusion arising from their different meanings remain open questions.
When an initially informative prior is partially corrupted, we distinguish between missing and incorrect information. For missing information, the experiments at different retention rates show that retaining only part of the correct knowledge can still improve performance over the no-knowledge baseline under the settings tested. For incorrect information, the fully random prior serves as a noise control. The experiments in Appendix D.5 address partial corruption more directly by mixing correct and incorrect entries in controlled proportions. The results show that the model can still benefit from the prior over a range of the error rates tested.
We address the weaknesses identified by the reviewers and respond to their questions below.
1.
The comparisons do not cleanly isolate knowledge integration. Kode and the pretrained baselines use different training distributions and graph sizes. The prior-aware controls in Appendix D.4 help, but cover one synthetic setting and use different forms of knowledge. The gains cannot yet be attributed cleanly to the proposed knowledge interface.We first clarify that Kode and all baselines, whether pretrained or not, were evaluated on data from the same distributions and at the same graph sizes. For methods that require pretraining, the training data were also drawn from the same distributions and covered the same graph sizes. Kode additionally receives prior knowledge as input. We therefore attribute its overall advantage to the combination of coarse-grained prior knowledge, the architecture, and the training strategy designed to use it. We have revised the wording in the appendix that gave rise to this misunderstanding.
We agree that Appendix D.4 alone does not isolate the contribution of the proposed knowledge interface. The “0% knowledge” results in Figures 4, 6, and 13--16, Table 1, and Appendix D.4 show that Kode retains an advantage even when no prior knowledge is supplied. These results indicate that the architecture and training strategy also contribute to its performance.
The baselines in Appendix D.4 can use only fine-grained knowledge of direct causal edges, which limits their applicability when such knowledge is unavailable. The purpose of this comparison is to assess whether Kode can also use precise prior knowledge of direct edges. The results show an advantage for Kode, with an important qualification. When the entire ground-truth graph is supplied as hard constraints, those constraints fully determine the output of PC, NOTEARS, and GES, so their advantage in this setting is expected. Kode takes a knowledge-informed approach and uses both data and prior knowledge to predict the graph. Its predictions are not required to reproduce the prior, so providing the complete ground-truth graph does not guarantee exact recovery.
Our central contribution is the use of coarse-grained prior knowledge together with an architecture and training strategy designed to exploit it. In the revised manuscript, we make clear that the reported gains reflect their combined contribution. The current experiments do not establish an independent advantage of the knowledge interface alone.
2.
The meaning of the structural prior needs clarification. Section 3.3 defines entries through possible direct or indirect influence, while ground-truth anchors use adjacency information. An absent direct edge is not an absent causal path. How these meanings are distinguished affects what the model is actually learning from the prior.We thank the reviewer for suggesting this clarification. First, we use a common encoding for both types of prior. We assign 1 to a direct edge in an anchor adjacency matrix or to a direct or indirect relation in a reachability matrix. In either case, we assign 0 to the entry for the reverse direction. We also assign 0 to absent relations and diagonal entries, and −1 to all remaining entries whose status is unknown. Thus, 0 means “no direct edge” in an adjacency prior and “no directed path” in a reachability prior.
Second, adjacency and reachability have different meanings. Kode does not use a separate type label to distinguish the two priors. It treats both as relational information and processes them jointly with the observational data. Since reachability can be derived from adjacency, the data and supervision provided during large-scale pretraining allow Kode to learn from both sources of information. At inference time, this helps the model distinguish, to some extent, between direct connections and indirect effects and predict the causal structure more accurately. As a knowledge-informed model, Kode combines the prior with the data when predicting the graph. The shared encoding therefore does not require the model to interpret every positive entry as a direct edge or to reproduce the prior as its output.