- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper introduces HEG-Config, a framework using LLMs to generate instance-specific parameter configurations for MIP solvers. Offline tuning trajectories are distilled into feature-conditioned experience cards and organized into a hierarchical experience graph ranging from instance-level rules to general strategies. Then a hierarchy-aware retrieval module provides multi-level context to an LLM to generate customized solver configurations for new instances. Across MIPLIB 2017 and D-MIPLIB benchmarks, HEG-Config reduces the NPDI by 21%–31% relative to solver defaults and outperforms several traditional selection/configuration baselines.
Critical strengths
Tackling instance-specific parameter tuning via LLM-driven generation rather than selecting from a static parameter addresses an important challenge in combinatorial optimization. Across heterogeneous benchmarks and solver backends, the method delivers consistent reductions in NPDI and optimality gap.
Critical weaknesses
The proposed method incurs substantial computational overhead, and the omission of online inference latency undermines the practical value of the reported gains. As shown in Table 14, HEG-Config requires significantly higher runtime. For easy problem instances whose solving times are often below 60 seconds, a 15.6-second inference delay is a heavy penalty that can easily offset the downstream solving speedup. However, the evaluation metrics (Gap, NPDI) disregard inference latency entirely.
The baseline evaluation is incomplete due to the lack of comparisons with existing LLM-based algorithm configuration methods (as mentioned in Appendix A).
Questions for authors
Appendix G.3 (Figure 3) indicates that performance degrades when transitioning from a 30B to a 7B model. Does scaling to even larger models yield further gains, and why did the authors not consider larger reasoning models (e.g., DeepSeek reasoning series)?
4 comments
We are looking forward to your feedback.
Dear Reviewer GTak,
We are writing as the authors of the paper titled "From Tuning Trials to Multi-Level Experience: LLM-Guided MIP Solver Configuration" (ID: 20814). We sincerely thank you for your time and efforts during the rebuttal process. We are looking forward to your feedback to understand if our responses have adequately addressed your concerns. If so, we would deeply appreciate it if you could consider raising your score. If not, please let us know your further concerns, and we will continue actively responding to your comments. We sincerely thank you once more for your insightful comments and kind support.
Best,
Authors
Thanks for the rebuttal, I have raised my score to 3.
Thanks for your kind support
Dear Reviewer GTak,
Thanks for your kind support and for helping us improve the paper. We sincerely appreciate your valuable suggestions.
Best regards,
Authors
Response to Reviewer GTak
Dear Reviewer GTak,
Thank you for your insightful and valuable comments. We sincerely hope our rebuttal could adequately address your concerns. If so, we would deeply appreciate it if you could consider raising your score. If not, please let us know your further concerns, and we will continue actively responding to your comments.
W1. Inference latency and practical runtime
We agree that configuration latency must be included when assessing practical benefit, especially for short solves. The revised Section 4.4, Table 5 reports each method's inference time and “+Infer.”, the sum of solver runtime and inference time. HEG-Config takes 15.60 s for inference and still has the lowest mean total online runtime among the compared methods in all three benchmark groups:
Relative to default SCIP, these correspond to reductions of approximately 19.5%, 39.1%, and 27.6%, respectively, after adding inference. While we acknowledge that fixed inference latency can outweigh solver-time savings on trivial instances, SC-easy is the only evaluated dataset where this occurs (default SCIP takes 22.36s, whereas HEG-Config takes 13.81 + 15.60 = 29.41s). Across all other evaluated datasets, solver-time savings substantially exceed the inference overhead.
W2. Comparisons with existing LLM-based configuration methods
We first clarify that LLAMBO and SLLMBO follow the dataset-level AC setting: they use LLMs within a search procedure to optimize one configuration for a relatively homogeneous dataset. This differs from our main task of adapting configurations to heterogeneous instances and transferring to unseen problem families; tuning on each target family would change the original evaluation setting.
To accommodate their dataset-level objective, we extend the original homogeneous-mix experiment in Appendix G.2, Table 12. It covers four families—CA-easy, SC-easy, CFLP-medium, and MIRP-medium—each relatively homogeneous and represented in both training and evaluation. This makes a shared configuration within each family a suitable comparison. LLAMBO and SLLMBO are optimized separately for each family, while HEG-Config and the original instance-specific baselines learn from the combined training data of all four families. Their configurations are then evaluated on the same test instances:
HEG-Config outperforms LLAMBO on all four datasets and SLLMBO on three, with a tie on CFLP. Its mean NPDI of 0.45 is approximately 36.6% lower than LLAMBO's 0.71 and 15.1% lower than SLLMBO's 0.53, demonstrating its advantage over both LLM-based configuration methods.
Q. Would a larger or more capable model improve performance?
Yes. In our expanded evaluation in Figure 3, integrating DeepSeek-V4.1-Flash into HEG-Config yields lower NPDI than Qwen-30B across all five datasets—for example, improving from 0.72 to 0.54 on CA-easy and from 0.69 to 0.43 on SC-easy. This confirms that our framework scales effectively with stronger underlying LLMs beyond the Qwen models used in the main experiments.