- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
CaPo uses a Pointer Network to generate causal variable orderings. An ordering-induced mask and a screening mask constrain a continuous graph learner, whose graph-level reward updates the ordering policy through REINFORCE. The paper reports results on Bayesian network benchmarks with up to 724 variables.
Critical strengths
1.Coupling ordering search with continuous graph estimation is a reasonable approach to reducing the search space.
2.The evaluation covers a broad range of graph sizes and reports ordering, reward, and runtime comparisons.
Critical weaknesses
1.The main metrics appear inconsistent. For the standard 592-edge PIGS network, the reported recall of 0.5533 implies about 264 missing true edges, already exceeding the reported SHD of 168. Different graph preprocessing or metric definitions could explain this, but neither is specified.
The bnlearn repository lists 592 arcs for the 441-node PIGS network. If Table 1 uses this graph and standard directed-edge recall, recall 0.5533 implies approximately 592 × (1 − 0.5533) = 264.45 missed true edges on average. Standard directed-graph SHD cannot be smaller than that count, even when a reversed edge costs one edit. The reported SHD is 168. A different reference graph, graph preprocessing, or metric convention could invalidate this comparison. The concern is therefore a concrete request to reconcile definitions and results, not a finding of fabrication or evidence about AI authorship.
2.The distinction from CORL is insufficiently established. CORL already uses a pointer-based ordering policy, reinforcement learning, and an episodic graph-score reward. The main possible advance is the coupling to the continuous graph learner, which needs clearer isolation. See Wang et al., IJCAI 2021, Sections 4.1–4.2.
3.The role of the acyclicity penalty is unclear. A strict ordering-induced mask already makes the masked graph acyclic. Figure 1 nevertheless computes a DAG penalty from that graph. The paper needs to specify which matrix is penalized and explain how this term affects learning.
Questions for authors
1.Can the authors provide the exact PIGS reference graph, metric implementation, per-seed predictions, and the numerical traces and plotting procedure behind Figure 4?
2.Which matrix enters each graph-loss term, and what does the continuous graph learner add beyond an otherwise matched CORL-style ordering policy?