- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper studies coordination between node selection and variable branching in MILP branch-and-bound. Node targets obtained under a reference brancher may become misaligned when a learned brancher is deployed. PCJL uses staged cost-supervised learning: it fits and freezes a branching policy using matched replays under a fixed reference continuation, generates node targets under that policy's actions, and then learns descent lengths under the frozen node–branching pair. Cached root graph representations and lightweight predictors reduce inference overhead. Experiments on four synthetic families report runtime, LP work, optimality rates, component ablations, and larger-instance transfer, with gains on several main-test families and mixed transfer outcomes.
Critical strengths
- Identifies a meaningful target-mismatch problem between node selection and the deployed brancher, with a practical correction.
- Multiple solver-level metrics and relevant baselines are evaluated, with substantial target-ablation gains on some tasks.
Critical weaknesses
- The methodological increment is relatively narrow: the main contribution is to regenerate node targets under a frozen branching policy, building on established continuation-cost learning and staged fitting. While the target ablation demonstrates practical value, the algorithmic novelty remains modest.
- The CPU-efficient hybrid approach of Gupta et al. (2020), which motivates the root-caching design, is not directly evaluated, leaving the additional benefit over existing lightweight alternatives unclear.
I am open to raising my rating if the rebuttal clarifies the methodological contribution and the additional practical benefit over existing lightweight branching approaches.
Questions for authors
- Table 2 shows substantial gains from conditioned targets on FCMCNF and MaxSAT but smaller gains on GISP and CA. Can you explain this variation?
- Under matched reference node-selection/plunging settings, what additional gains do PCJL-B and full PCJL achieve over the hybrid-style branching approach of Gupta et al.?
- Why is training limited to a single branching–node-selection pass rather than alternating updates? After learning the node-selection policy, could updating the brancher under that policy and then regenerating node targets yield further improvements?