- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
Existing prediction-guided heuristics (hard fixing, penalization) either cause infeasibility when predictions are wrong or respond discontinuously to small changes in predictions near the threshold, making them unsuitable for training the predictor end-to-end within the decision-focused learning (DFL) loop. To address this, the paper introduces a soft guidance term, , added to the objective while leaving the feasible region intact. The authors combine the proposed soft-guidance layer with existing DFL losses, including SPO+ and the Fenchel-Young loss, and evaluate cost gap and relative runtime on an energy-aware lot-sizing problem.
Critical strengths
-
The proposed framework uses the trained model's predictions to guide the solver without modifying the constraints, so feasibility is preserved regardless of prediction quality.
-
The guidance strength can be tuned at inference time through , without any retraining. This design decouples trade-off tuning from training, which could be particularly useful for large-scale problems where training is expensive.
Critical weaknesses
-
The stated contributions are not sufficiently supported by the experiments. First, the problems and baselines are too limited to support the claim of a "generic, problem-independent" soft-guidance framework. The evaluation covers a single problem, energy-aware lot-sizing, which provides limited evidence about how the method behaves across different problem classes, and there is no validation on broader ML4CO benchmarks spanning diverse problem classes (e.g., Distributional MIPLIB [1]). Moreover, the soft-guidance formulation is closely related to a Lagrangian-relaxation view of the trust-region constraint used by PaS (Han et al., 2023) [2], cited in Appendix A. Yet there is no experimental comparison against trust-region-based ML-guided heuristics (PaS [2], Apollo-MILP [3], DiffILO [4]), so it remains unclear whether the proposed soft guidance offers an advantage over these methods and how it should be positioned in the literature. At the solver-guidance stage, the proposed method is structurally closer to DiffILO, which imposes a trust region on the entire solution, than to PaS, which does so on a subset of variables; this relationship is not discussed. Second, the benefit of integrating the proposed CO layer into the DFL pipeline is not evident, which makes it difficult to count as a contribution. In Section 4.1, SEQ BCE is not clearly distinguishable from the DFL variants: in Figure 1 (left), SEQ BCE and most DFL variants overlap within the reported error bars. The effect of DFL is not clearly demonstrated, and the DFL training cost (solver calls per step, total training time) is not reported, so it is difficult to assess whether the gain justifies the cost. More fundamentally, the main novelty appears to lie in the optimization formulation rather than in the learning methodology, given that the model architecture and DFL losses are largely standard. Therefore, the current evidence does not establish a substantial ML contribution.
-
Some claims overstate the presented results. First, the claim of a "strictly dominant Pareto front" (Line 371) does not hold. On in Figure 1(a), the triangle at approximately (0.48 relative run time, 0.1% gap) is not dominated by any proposed configuration (circles): every circle with a shorter run time has a larger gap, while the one with a smaller gap has a larger run time. Hence no circle beats this triangle on both axes. Second, the claim that is "interpretable" (Line 84, 236) is weak. is an unnormalized absolute quantity, so the same value can mean different things on different problems. Obs. 4 itself provides the evidence: on larger instances, the average cost gap grows much faster with than on the training distribution. The authors also acknowledge in Obs. 3 that no result establishes as calibrated to the predictor's reliability; the interpretability claim should either be modified or supported by evidence.
[1] Distributional MIPLIB: a Multi-Domain Library for Advancing ML-Guided MILP Methods, arXiv, 2024.
[2] A GNN-Guided Predict-and-Search Framework for Mixed-Integer Linear Programming, ICLR, 2023.
[3] Apollo-milp: An alternating prediction-correction neural solving framework for mixed-integer linear programming, ICLR, 2025.
[4] Differentiable Integer Linear Programming, ICLR, 2025.
Questions for authors
-
The current version omits information needed to interpret the results. Could you provide the following?
- The DFL training cost (number of epochs, solver calls per step, total training time). Given the claim "cheap enough to solve at every training iteration" at Line 199, this should be reported.
- The absolute solve time (in seconds or minutes) of all compared methods for each dataset, along with the solver settings (gap tolerance, time limit) and the instance sizes (the number of variables and constraints). Without these, it is hard to judge how difficult the instances are and whether the reported speedups are practically meaningful.
- What do the error bars in Figure 1 represent (e.g., standard deviation, standard error, or range)?
-
In Figure 1, what value of is used in the CO layer at inference time, and what value during training? Is fixed during training?
-
Are there results comparing the proposed method against the unguided solver (e.g., CPLEX) with a relaxed gap tolerance of roughly 1–5%?
-
Minor comments
- Line 120, 180: These two diagrams are unnumbered and uncaptioned, so they cannot be referenced from the text; please add figure numbers and captions.
- Line 174: The quotation marks around "confident" appear to be mis-typeset.
- Line 183: and in the DFL diagram appear without definition.
- Line 323: "circular markers" and "triangular markers" are introduced before Figure 1 is referenced, which makes the passage hard to follow.
- Line 418, 420: The text refers to purple and yellow markers while describing Figure 2a; please check whether these references are correct.
2 comments
Thank you for the clarifications. While several points are better explained, my main concerns remain unresolved without additional experimental evidence addressing the issues raised in my review. Therefore, my overall assessment remains unchanged.
Thank you for the valuable feedback regarding baseline connections (PaS, Apollo-MILP, DiffILO) and claim precision.
Baseline Positioning (PaS, Apollo-MILP, DiffILO)
We will update Appendix A to explicitly position soft guidance relative to PaS, Apollo-MILP, and DiffILO:
Experiments on other problem families (e.g., capacitated facility location and unit commitment) and direct comparisons with trust-region methods are planned for a future version of the paper.
Clarification of Overstated Claims
Answers to Questions
SEQ BCEtakes ∼5 minutes (no solver calls).DFLmethods take ∼60 minutes (∼50 epochs).