- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
The paper proposes PRCD-MAP, a penalized structural VAR (SVAR) structure learner that uses an external edge-probability matrix as a soft prior. The prior modulates an edge-wise weight on instantaneous edges and a prior-weighted ridge penalty. Its influence is controlled by temperature (trust) parameters on the prior's logits, either one per quantile bin of the prior (grouped trust) or one per edge from a small MLP (contextual trust). The temperatures are learned with an empirical-Bayes-inspired surrogate based on agreement between the calibrated prior and the current coefficient magnitudes. Experiments cover synthetic ER graphs with corrupted priors, the CausalTime benchmarks, a BA-graph study, and ablations.
Critical strengths
- The paper addresses a practically relevant problem with a simple mechanism.
Domain knowledge is often partial and unevenly reliable, and the proposed method offers a lightweight way to use such knowledge inside a standard SVAR learner. The ablation also suggests that using priors softly is considerably more robust than using them as hard constraints (Table 5).
- The learned trust tends to distinguish reliable from unreliable prior assertions.
The learned temperatures tend to increase with prior accuracy (App. M.1) and separate correct from incorrect prior assertions reasonably well (AUROC 0.796, Sec. 4.6).
Critical weaknesses
- Limited theoretical support and unclear novelty relative to prior-aware causal discovery.
Proposition 1 bounds a local perturbation from a neutral-prior solution under fixed support, order, and coefficient signs. Theorem 5 requires additional curvature and estimation conditions. Neither result establishes that the learned trust update attenuates an inaccurate prior or improves causal graph recovery. The paper’s central contribution is learning how much to trust a prior, but its theoretical results do not address the performance of that learning step.
Th Soft prior modulation and data-dependent reliability estimation have also been studied previously. The paper omits Hwang et al. (2026), Chen et al. (2025), and Amirkhani et al. (2017), and discusses Constantinou et al. (2023) only in connection with hard constraints. It does not establish what new principle the trust update contributes beyond this work or compare against an applicable prior-aware method using the same prior.
- Empirical evidence does not establish the benefit of learned trust with external priors.
The experiments are extensive, but they do not directly test the setting that motivates the paper. The controlled priors are generated by corrupting reference graphs, while the CausalTime priors are computed from correlations in the evaluated data. Thus, the results do not establish whether the method can learn the reliability of independently obtained external knowledge. Improvements over prior-agnostic baselines cannot by themselves isolate the benefit of learning trust.
The comparisons within PRCD-MAP also leave that benefit uncertain. Fixed trust outperforms learned trust at prior accuracy 0.9 for every sample size in Table 1 and in the structured-error suite. Low trust outperforms learned trust at prior accuracy 0.4 for every sample size in Table 29. These findings do not imply that learned trust is never useful, but the paper has not established when it offers an advantage over simpler trust choices.
Finally, Tables 1 and 15 report different results under the same stated setting, and several results used in the main text are marked as provisional because their per-run records were not recovered. This makes the empirical support for the central claim harder to assess.
Questions for authors
-
For any tested identifiable SVAR setting, do the assumptions of Proposition 1 or Theorem 5 hold for the computed solutions? If so, what do they guarantee about graph recovery with learned trust?
-
Why does agreement with coefficients fitted using the same prior reveal that prior’s reliability rather than reinforce its errors? What is the new principle beyond applying soft priors to an SVAR?
-
With a prior obtained independently of the data and reference graph, how does learned trust compare with fixed and low trust under otherwise identical settings? Please report results by prior quality.
-
What explains the different results in Tables 1 and 15 under the same stated setting? Can the provisional experiments be rerun with per-run records saved?