- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies anchor-conditioned reoptimization for mixed-integer programs (MIPs). Given a feasible anchor solution , it releases a subset of integer variables, fixes the remaining integer variables to their anchor values, and lets the MIP solver jointly optimize the released integer variables and all continuous variables. The paper defines the restricted objective
and introduces a quality--freedom frontier relating the best attainable objective to the number of released variables. A gradient-boosted decision tree (GBDT) ranks variables using static, root-LP, and anchor-conditioned features. The method then selects the smallest prefix whose predicted correction scores contain a fixed fraction of the total score mass, and solves the resulting restricted MIP. The paper also derives a marginal-probability coverage bound and gives a construction showing that high partial correction recall need not imply objective improvement.
The empirical study has two parts. Controlled experiments on Set Cover, combinatorial auctions, and capacitated facility-location instances use exact minimum-correction labels, several neighborhood baselines, and a development-selected cumulative-mass threshold. A separate MILPBench study trains family-specific LP-aware and NoLP GBDTs on easy-scale instances and evaluates them on medium- and hard-scale instances, including problems with up to two million variables. The reported results show favorable gap--time tradeoffs in the controlled setting and competitive objective values in the MILPBench setting. Overall, the method is coherent and practically motivated, but the central coverage bound is not calibrated or finite-time, the large-scale evaluation has only five test instances per setting and uses nonoptimal reference solutions, and some comparisons are not strictly end-to-end time matched. These limitations make the evidence insufficient for acceptance in its current form.
Critical strengths
-
Feasible anchor-preserving reoptimization. Fixing variables to a feasible anchor preserves feasibility, while enlarging the released set cannot worsen the restricted optimum. This gives the learned policy a safe interface to an off-the-shelf solver: the model chooses where freedom is useful, and the solver still determines the released values.
-
A practical adaptive-sizing study with reproducible artifacts. The controlled experiments include exact-label oracle references, fixed-budget curves, and an adaptive-versus-fixed sizing ablation. The supplementary code, frozen models, solver versions, and timing conventions make the work substantially easier to audit and reproduce than many learned-MIP papers.
Critical weaknesses
- The theoretical guarantee is not operationally informative for the reported method. Equation (19) depends on the unknown marginal correction probabilities and the unmeasured score error
The paper explicitly states that this quantity is not estimated, and the resulting bound is often capped at one when the total score mass is large. Thus, the theorem explains the heuristic but does not provide a non-vacuous quality guarantee, a calibration result, or a finite-time solver guarantee for the reported GBDTs.
- The empirical evidence is too limited and not fully comparable to support the main transfer claims. Each MILPBench scale/family setting uses only five official test instances, reports means without uncertainty intervals, and evaluates objectives against reference solutions whose easy-scale gap estimates are approximately 4.1%, 10.3%, and 8.6% for the three families. In addition, EnCore-PS excludes graph construction, GPU inference, and early-solution generation from the paired timer, so it is explicitly not an end-to-end matched baseline. The default MILPBench feature set also contains raw instance-size features that are far outside the training range at hard scale, yet a scale-invariant ablation is not reported. These issues make it difficult to determine whether the observed gains reflect the proposed adaptive freedom allocation or protocol- and distribution-specific effects.
Questions for authors
-
Uncertainty and paired statistics. Please provide per-instance results, confidence intervals or bootstrap intervals, and paired significance/effect-size analyses for all controlled and MILPBench tables. In particular, how stable are the six MILPBench conclusions when each setting contains only five test instances?
-
Quality of MILPBench references. Which reported reference objectives are proven optimal, and which are only feasible solutions with a solver gap estimate? Please recompute the comparisons against a common high-quality or certified reference wherever possible, rather than interpreting objective differences from a nonoptimal as optimality improvements.
-
Selection of thresholds and gates. What exact development data and objective were used to select , , the exact-half threshold , and ? Were the LP method, gate, and both thresholds frozen before any medium/hard test instance or test reference was inspected?
-
Scale-invariant features. The MILPBench default representation includes
n_vars,n_cons, and family indicators, while the hard-scale instances are much larger than the easy-scale training instances. Can you report a matched ablation that removes all instance-constant and raw-size features, together with the feature-range and score-distribution shift across scales? How does a tree model extrapolate whenn_varsis outside its training range? -
Runtime and memory accounting. Please report the full online decomposition by scale and family: anchor generation, static feature construction, root-LP computation, GBDT inference, restricted reoptimization, peak memory, and total wall time. Also report the same pipeline with one and eight threads. In the controlled experiments, what would the conclusions be if static feature preprocessing were charged to the online budget?
-
Strict end-to-end baseline matching. For every baseline, which stages are included in the reported budget, including incumbent generation, graph/feature construction, model inference, solver model construction, and solver setup? Since the paper states that EnCore-PS is not end-to-end time matched, can you provide a strict end-to-end rerun or remove it from claims based on matched budgets?
-
Baseline tuning and implementation. How were Local Branching radii, RINS parameters, ACP schedules, Random-LNS partitions, and EnCore-PS schedules selected? Were all choices made on the same development instances and with the same solver/version constraints as the proposed method? Please specify which baselines were independently reimplemented and which used official code.
-
Solver and anchor sensitivity. How do results change with the anchor budget, root-LP budget, root-LP algorithm, number of solver threads, and solver random seed? Do the gains remain when all methods are evaluated under a prespecified common end-to-end budget rather than a budget derived from the realized runtime of Ours?
-
Score calibration and the cumulative-mass rule. Can you estimate and on held-out data, and report the numerical value of the bound in Equation (19)? How sensitive are release sets and objective results to monotone score transformations, probability calibration, or replacing cumulative mass with a ranking-only top- rule?
-
Noise in reference-derived labels. MILPBench trains on from feasible references with nonzero reference gaps. What is the label noise rate relative to a stronger teacher or exact minimum-correction labels on a tractable subset? Do multiple feasible references for the same anchor produce materially different correction supports and model rankings?
-
Certification and stability of . For controlled labels, how are optimality and nearest-optimum certification performed under solver tolerances? How often are there multiple nearest optima with different supports, and how stable are the labels under the objective tolerance used in the auxiliary problem?
-
Scope beyond binary variables. The theory allows general integer variables, but most experiments use binary variables and Facility has only 100 binary facility-opening variables plus continuous recourse. What happens on instances with many nonbinary integer variables, general integer bounds, or mixed integer types? Is the Hamming release unit still the right computational cost proxy there?
-
Reliability-gate robustness. Please provide sensitivity to the half-integrality tolerance, the threshold, LP solver/method, and small numerical perturbations of the LP solution. What are the per-instance results with the gate disabled, and how often does the gate switch paths for reasons unrelated to genuine loss of variable-level discrimination?
-
Transfer contamination and auditability. Please provide an immutable manifest of training, development, and test instance IDs, seeds, threshold-selection runs, and all reference files used. Can you confirm that no test-scale labels, test references, test objective values, or post-hoc test outcomes influenced the model, gate, thresholds, or selection of the five reported test instances?
-
Isolating the contribution beyond existing neighborhoods. Since the binary frontier is the optimal radius- Local Branching neighborhood, which ablation isolates the incremental value of (a) the learned ranking, (b) cumulative-mass sizing, and (c) the anchor warm start? In particular, can you compare against a tuned adaptive-radius Local Branching policy under the same strict end-to-end protocol?