- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes ORDO, a framework that formulates mixed-integer programming (MIP) presolve planning as conditional autoregressive generation of executable action sequences. Its action space includes presolver routines, propagator callbacks, constraint-handler callbacks, and round-boundary and termination tokens. A lightweight decoder-only Transformer is trained by behavior cloning on effective-action trajectories collected from SCIP’s default presolve policy. The authors modify SCIP to support sequence injection and execution monitoring. At deployment, generated sequences are evaluated through concurrent racing among custom-sequence, default-fallback, and no-presolve paths. Experiments on seven D-MIPLIB domains investigate order sensitivity, sequence replay, and cross-domain transfer. The results show improvements on several held-out domains, although the contribution of learned generation relative to replay, reduced presolve effort, and racing remains insufficiently isolated.
Critical strengths
- An interesting decision formulation. Treating presolve plans as explicit action sequences provides finer scheduling control than selecting a fixed configuration vector. Including constraint-handler callbacks and round boundaries makes this a useful direction for learned solver control.
- A valuable execution and observation facility. The SCIP modifications support externally specified sequences while reusing native presolve operations. The patched-default comparison and objective-value consistency checks provide useful empirical validation of this infrastructure.
- Useful empirical analysis beyond headline performance. The paper examines sequence diversity, order perturbations, fixed-sequence replay, winner composition, and cross-domain transfer. Reporting unfavorable domains and the additional computational cost of racing helps identify the framework’s practical limitations.
Critical weaknesses
- The learned model may not be necessary. ORDO is trained by imitating presolve trajectories generated by default SCIP. Since the training data do not contain better-than-SCIP solutions, it is unclear why the learned model should systematically outperform SCIP instead of simply reproducing its behavior. This concern is supported by Table 20, where model-generated sequences and direct replay of SCIP sequences perform almost the same on four domains
- The gains may come from the execution strategy rather than learned ordering. For example, the no-presolve path wins on 75% of SC instances and 43% of CFLP instances. This suggests that part of the gain may come from skipping presolve or changing how presolve is executed, rather than from learning a better action order. Simpler baselines such as a fixed sequence, sequence retrieval, or a small sequence library are therefore needed.
- Some theoretical and experimental claims are not fully supported. Proposition 1 assumes independent runtimes but later informally extends the conclusion to weakly correlated candidates without defining this condition. Moreover, the paper claims “4 accelerated, 2 tied and 1 failed,” while MIS has SGM =1.0140 and 𝑝=0.0352, which should be counted as a significant slowdown under the paper’s own rule. The correct summary appears to be 4 accelerated, 1 tied, and 2 failed.
Questions for authors
- Since ORDO is trained only on trajectories generated by default SCIP, why should the learned model be expected to outperform SCIP? Why not directly use SCIP, especially when Table 20 shows that replaying SCIP’s sequence performs similarly to the learned model on several domains?
- How does ORDO compare with much simpler alternatives, such as one fixed sequence learned from the training set, nearest-neighbor sequence retrieval, or selecting from a small library of presolve sequences?
- Can the authors clarify Proposition 1 and correct the reported transfer outcome? In particular, what assumption supports the “weakly correlated” extension, and why is MIS not counted as a failure despite and ?
2 comments
Official comment by reviewer r2SZ
Thank you for the detailed response. The additional results clarify several of my concerns, particularly the comparison with simpler baselines and the correction of the MIS significance result. However, my main concern about the necessity of the learned model remains only partially resolved. The response shows that learned generation is largely comparable to replay on the in-domain tasks, and that a simple model-free sequence portfolio can achieve similar performance in several cases. The main evidence for the learned model therefore appears to come from the single unseen NNV domain. Overall, the rebuttal improves the clarity of the paper, but I still find the evidence for the learned component somewhat limited.
We thank the reviewer. Answered in the order given; ratios are against the same-batch default under solver-internal time, so below 1 is faster.
W1. The learned model may not be necessary.
Response: Thanks. In-domain it is not, and the paper states that as its first result: against direct replay on the same batch, generation reads 1.0077 [0.9867, 1.0292] on SC, 1.0163 [0.9959, 1.0367] on CFLP, 1.0008 on MIS and 0.9979 on MVC (Table 1), so what those domains release is the execution form and a candidate pool (§1, §3.4). The learned component separates on the one corpus-diverse, never-trained domain, NNV, at 0.9308 [0.8909, 0.9712] against replay.
W2. The gains may come from the execution strategy rather than learned ordering.
Response: Thanks. Four arms, same batch and denominator: SC 0.9904 / 0.9822 / 0.7457 / 0.7766 and CFLP 0.9327 / 0.9173 / 0.8760 / 0.7955 for content single-path, replay, np single arm and racing; the np path's share is printed, 75% of SC instances and 43% of CFLP against 1% on MVC. The selection rule costs 5.2 points (0.7251 to 0.7766). Where the model fails the mechanism is explicit: on CA its sequence (1.1761) is indistinguishable from replaying that instance's multiset (1.1730). The two adjustments are independent: a preset changing only plug-in parameters composes with our sequence (1.0001 / 1.0019) and no preset in 24 cells reorders the multiset (B.12.2).
W3. Some theoretical and experimental claims are not fully supported.
Response: Thanks. The assumption that matters is independence of racing candidates; the weakly correlated extension is defined as asymptotic tail independence, Pr(T_j > t | T_i > t) -> 0 as t -> infinity (A.1), and is used only to fix the protocol. On the summary, MIS is a tie after correction (0.0352 to p_adj = 0.070), so the paper reports 4/2/1 and prints the uncorrected 4/1/2 beside it (§3.5); CA's slowdown holds either way (p_adj = 5.2 × 10^-5).
Q1. Since ORDO is trained only on trajectories generated by default SCIP, why should the learned model be expected to outperform SCIP? Why not directly use SCIP, especially when Table 20 shows that replaying SCIP's sequence performs similarly to the learned model on several domains?
Response: Thanks. The claim is not a better order in-domain but what a sequence prior provides when the default schedule is unavailable: the model releases the program without first running the default presolve, and extrapolates to unseen domains (NNV 0.9308 against replay, n = 550). In-domain the paper claims no gain (§4).
Q2. How does ORDO compare with much simpler alternatives, such as one fixed sequence learned from the training set, nearest-neighbor sequence retrieval, or selecting from a small library of presolve sequences?
Response: Thanks. All three are in the paper. Replay: the ratios of W1, a tie on four of five domains. A model-free portfolio of the two most frequent corpus sequences through the same five-path protocol: 0.7745 / 0.7999 / 1.0241 / 0.9563 against our 0.7766 / 0.7955 / 1.0182 / 0.9887, every paired ratio within 1 ± 0.035 (Table 1). Nearest-neighbour retrieval in-domain: 0.9866 with a 65% win rate on SC against 0.773 with 93% (B.9). NNV is the one cell where generation separates from replay, and the only one where any control was run against it.
Q3. Can the authors clarify Proposition 1 and correct the reported transfer outcome? In particular, what assumption supports the "weakly correlated" extension, and why is MIS not counted as a failure despite (SGM > 1) and (p < 0.05)?
Response: Thanks. As in W3: the assumption is independence, the extension is asymptotic tail independence (A.1), and the transfer summary is 4/2/1 under Holm over the seven points, MIS moving from 0.0352 to p_adj = 0.070 with the uncorrected 4/1/2 printed beside it (§3.5); CA's slowdown is not a correction artefact (p_adj = 5.2 × 10^-5).