- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper addresses the heavy solver evaluation bottleneck during LLM-guided MILP branching policy discovery (e.g., LLM4Branch). The authors propose an evaluation gate inside the Stage-2 Bayesian optimization loop that inspects BO-state signals to decide whether to evaluate or skip a proposed parameter trial, assigning skipped trials a conservative penalty. Across four standard MILP benchmark families, the method saves 5.19%–18.92% of Stage-2 solver calls while maintaining final policy quality.
Critical strengths
Exploring the design of MILP branching policies based on LLM is a frontier and impactful research direction.
Critical weaknesses
-
As shown in Table 2, the discovered policies offer no significant solving performance improvements on held-out sets, and solving time even degrades on hard cauctions instances (+14.53%). Because branching policy search is performed offline as a one-off procedure, saving modest offline search time at the expense of downstream solving quality offers marginal practical value. Moreover, the pipeline strictly follows LLM4Branch, with the simple modification being an early-skipping gate heuristic inside the inner-loop BO. These makes the novelty and value of this maniscript incremental and below the bar for ICLR.
-
Several notations are ambiguous or missing definitions, such as in Equation (8). Furthermore, because the framework relies heavily on LLM4Branch, the paper had better provide a more clear introduction of LLM4Branch in the background section.
Questions for authors
-
What specific LLM (e.g., model name, version), prompting strategy, and decoding settings were used during policy generation?
-
How is the gate decision in Equation (5) concretely implemented?
Dear authors and reviewers,
The author-reviewer discussion period closes on November 18 (AoE). Please engage in response periods so that we have our issues discussed thoroughly.
AC