- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
The paper proposes in-context branching (ICB). During an SCIP solve, observed directional branching outcomes (per-unit bound gains attributed to the branched variable and direction) are stored in a rolling memory of 256 events. A frozen network uses this memory to predict directional gains for the current candidates. Its parts are:
- a learned feature-based prior with learned pseudo-counts;
- shrinkage toward exact-identity evidence, plus an optional similarity channel;
- a cross-attention residual;
- a fixed min/max score readout.
Training distills strong-branching decisions on exploration-diversified trajectories. Pseudocost features are masked from the inputs. The paper evaluates on the four Gasse et al. (2019) families and on a reconstructed class-disjoint MILP-Evolve cohort of 340 instances. It compares against reruns of RPB, GCNN, and Mamba-Branching, and runs interventions on the memory of a fixed checkpoint (context-off, exact-only, similarity-only, shuffles).
Critical strengths
- A clean interface and careful interventions. The causal event definition (Eq. 3) is clear. Fixed-checkpoint interventions (context-off, exact-only, shuffled similarity, similarity-only; Table 3) are a good way to ask whether a frozen policy actually uses the information stream.
- A meaningful effect within the paper's own setup. On combinatorial auctions, removing memory raises the medium-scale node aggregate from 1,205 to 3,204. On the class-disjoint MILP-Evolve cohort, memory raises completion from 55.6% to 69.1% (Table 4).
- Unusually candid reporting. The paper reports negative results (facility location, multiple knapsack, independent-set big), variation across training seeds (Table 10), and exposure of test cells during development (Appendix C). It also states which claims it does not make.
Critical weaknesses
-
The main ablation is close to tautological. The event memory holds per-variable, per-direction unit gains, which is exactly what pseudocosts are. The model masks the pseudocost features (columns 8–14) from its inputs. "Context-off" therefore removes all pseudocost-type information from a model trained to rely on it through the memory. A large drop is expected and says little about whether an explicit, identity-linked memory beats the standard way of giving a learned brancher this information. The informative comparison is a separately trained state-only model that sees the pseudocost and history features (as GCNN-style and hybrid branchers do), with the same data and training budget. The paper acknowledges this is missing (Section 5), but without it the central question in the introduction is not answered. The single 40-run screen of an unmasked variant (4 runs solved) is too small to settle it.
-
No practical improvement over the classical rule. RPB solves at least as many instances as ICB in every Gasse cell except facility-location big (93% vs 96%), and often many more (45% vs 26% on independent-set big, 65% vs 35% on set-cover big). It also solves more of the MILP-Evolve cohort (79.1% vs 69.1%). Wall time is worse in most cells: 508.1 s vs 124.6 s on independent-set medium even though ICB builds fewer nodes there, and 40.0 s vs 8.4 s on independent-set easy. Given the conditional nature of the tree-size ratios (computed only on jointly solved runs), the evidence does not show that ICB is a better brancher than the pseudocost rule it imitates in memory.
-
The reproduced baselines look weak and incomplete.
- GCNN solves only 47% of independent-set medium runs and 1% of big. This is well below what the original learn2branch study reported for this generator and scale.
- Mamba solves 7% of independent-set big.
- GCNN is missing entirely for set-cover easy and medium and independent-set easy.
- The released MILP-Evolve GCN reproduction "does not recover the published completion rate" (Appendix F).
When the learned comparators underperform their published numbers, "ICB beats Mamba/GCNN" in some cells is hard to interpret. Please investigate these gaps, or use the authors' released checkpoints and settings where available.
-
Timing is not reliable. Reported time is external wall time on a shared host, "including contention"; per-run internal CPU times "were not retained" (Appendix B.2). GCNN inference uses a GPU while ICB and Mamba use the CPU. Speed is the main reason to learn a brancher, so the time columns should be re-measured on an isolated machine with solver-clock times, or removed from the comparison.
-
Test-set exposure and variance. Recipe choices for independent set and set cover were informed by results on the canonical evaluation cells (Appendix C). Three training seeds yield 1,383, 3,759, and 1,401 nodes on the independent-set medium (Table 10), a spread larger than many reported between-method differences. Main tables use a single checkpoint per family, and no class-clustered intervals are given for MILP-Evolve. A clean protocol is needed: recipes chosen only on validation, several training seeds, and intervals for every headline comparison.
-
The experimental platform is dated. All main experiments use SCIP 6.0.1 (2018) with root-only cuts and no restarts. This matches the learn2branch protocol, but it makes it hard to judge relevance to current solvers. One cell repeated on a recent SCIP release would help.
-
Presentation. The paper is heavily hedged. Many sentences state what a result does not show, and Section 3 introduces notation not needed in the main text. Table 1 is dense, and its time columns are not comparable across methods (Weakness 4). A clearer statement of the positive claim, plus a matched-data comparison, would make the contribution easier to assess.
Questions for authors
- Can you train a state-only model with pseudocost and history features unmasked, on the same data and budget, and compare it with full-context ICB? This is the comparison that would show the value of an explicit memory.
- Why do the GCNN and Mamba reruns underperform their published results (e.g., GCNN at 47% on independent-set medium)? Were the original checkpoints, features, and SCIP settings used?
- Can the time comparisons be re-run on an isolated machine using SCIP's internal clock, with every policy on the same device?
- How do the main conclusions hold across at least three training seeds for every family, with recipes chosen on validation only?
- Does ICB improve on RPB when RPB's reliability parameters are tuned on the same training data? Can the learned prior be used to initialize pseudocosts within RPB rather than replace it?
- What are the class-clustered confidence intervals for the MILP-Evolve completion and PDI differences?