- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes L-IR, a learning-guided framework for accelerating MILP infeasibility relaxation. A constraint-centric attention network ranks constraints and predicts an instance-adaptive candidate-set size. Slack variables outside this set are fixed to zero before solver optimization. Training combines quality-weighted classification, complete-support ranking, and coverage prediction using multiple reference repairs. The authors construct an LLM-assisted synthetic benchmark of approximately 20,000 instances across 580 classes and evaluate two relaxation objectives, reporting speedups over Gurobi and additional transfer results on MIPLIB.
Critical strengths
-
The support-coverage formulation provides a coherent learning objective for infeasibility relaxation. Explicitly targeting the complete support of at least one high-quality repair addresses a limitation of independent constraint-level prediction and connects the training objective to the downstream optimization task.
-
The paper provides a substantial benchmarking effort, including a large synthetic dataset, classical and neural baselines, two relaxation objectives, and component ablations. This offers a useful foundation for studying learning-guided infeasibility repair.
Critical weaknesses
-
The evidence for practical generalization remains limited. The main results rely on synthetically injected conflicts derived from eight seed generators. ID evaluation shares generator classes with training, while OOD evaluation holds out a single GISP family. The experiments also use uniform violation penalties, leaving performance under application-specific relaxation priorities unclear. On MIPLIB, speedups are only 1.11–1.17×, and the constraint-count objective reduces the solved rate from 51.7% to 41.7%. These results leave uncertainty about how much of the synthetic performance transfers to practically representative repair tasks.
-
The acceptance, fallback, and timing protocol is insufficiently specified. Success is defined relative to the unrestricted optimum, while fallback is triggered when the restricted repair fails the quality requirement. It is unclear how this decision is made online without knowing that optimum, how restricted solving and fallback share the time budget, and whether Gurobi and L-IR runtimes use matched solution-quality targets. These details are necessary to interpret the reported acceleration.
Questions for authors
-
How is repair quality checked during inference without access to the unrestricted optimum? Please specify the information used to trigger fallback and how the restricted solve and fallback share the total time budget.
-
Are Gurobi and L-IR timed against the same 10% solution-quality target? Please clarify their stopping conditions and the motivation for selecting this threshold.
-
Which operational conflicts and relaxation priorities are the synthetic generators intended to represent? What evidence supports this correspondence, and how should the substantially smaller gains on MIPLIB be interpreted?