- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes Abductive Quantitative Argumentation for Causal Discovery (AQACD) to mitigate structural errors in causal graphs caused by erroneous conditional independence (CI) tests under finite-sample settings. The method integrates statistical evidence, graph-structural constraints, and orientation preferences, dynamically adding or deleting edges through non-monotonic graph revision. Experiments on five discrete Bayesian network benchmarks show improvements in skeleton recovery, orientation accuracy, and some intervention-related metrics.
Critical strengths
- The research problem is meaningful. Allowing the algorithm to recover erroneously deleted edges provides a promising approach to mitigating error propagation in conventional constraint-based causal discovery.
- The method is reasonably comprehensive. It combines quantitative argumentation, abductive reasoning, and global structural constraints, supported by ablation studies and theoretical analysis.
- The paper conducts repeated experiments, statistical significance tests, and component ablations across multiple benchmarks. It also evaluates orientation accuracy and intervention-related performance.
Critical weaknesses
- Potential inconsistency in the theoretical assumptions and default parameters. The asymptotic consistency theorem requires the regularization parameters to satisfy [ \lambda \max(w_{\mathrm{sparse}}, w_{\mathrm{coll}}) < \gamma, ] where the faithfulness separation margin (\gamma) is bounded by the range of the dependence evidence, implying (\gamma \leq 1). However, the default settings reported in the paper are (\lambda = 1) and (w_{\mathrm{coll}} = 1.5). These values imply [ \lambda \max(w_{\mathrm{sparse}}, w_{\mathrm{coll}}) \geq 1.5 > 1 \geq \gamma, ] which contradicts the stated condition. This raises concerns about whether the theoretical guarantee applies to the default configuration used in the experiments. The authors should clarify or correct this discrepancy. Moreover, the asymptotic analysis assumes a sample-size-dependent significance threshold, whereas the experiments use a fixed threshold, and the relationship between these settings should be explained.
- The independent contribution of the dynamic revision mechanism is not fully established. Ablation results suggest that its benefits vary across datasets and evaluation metrics. A more direct analysis of the trade-off between correctly recovered edges and incorrectly added edges is needed.
- The experimental scope is limited. The evaluation focuses primarily on five discrete Bayesian networks, and some baselines fail to run on certain datasets. Therefore, the current results are insufficient to establish the method's general effectiveness across a broader range of data settings.
Questions for authors
Could the authors clarify the potential conflict between the parameter constraints in the asymptotic consistency theorem and the default parameter settings? Under what conditions can the actual greedy algorithm be guaranteed to be consistent?