- Rating
- 4(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper introduces SemanticOpt, an LLM-based optimizer for black-box optimization. An LLM (Qwen 3.5 27B) is directly fine-tuned with LoRA on more than optimization trajectories. Given the semantic context and observation history, it jointly proposes candidate configurations and predict objective values with uncertainty, and failure probability. The trajectories are collected on two types of function spaces: GP-based functions, and LLM-generated function spaces with semantic context, where the initializations are also LLM-generated. The remaining queries come from the best-performing HEBO method for given budget. At inference, SemanticOpt gives strong context-informed initializations while being able to continually improve as observations accumulate, outperforming the base model on average at all context levels, and is more robust to counterfactual, mismatched and adversarial semantic information.
Critical strengths
- The paper is well written and easy to follow.
- The function space generation part is especially interesting and useful.
- The experiments answer meaningful questions, including how the proposed method performs at different context levels, and how it reacts to imperfect semantic information compared to the base model.
Critical weaknesses
- The function spaces with semantic information are generated by an LLM. It’s unclear: 1) whether the generated problems are realistic and diverse, and 2) whether training and test problems overlap.
- SemanticOpt is supervised fine-tuned on HEBO trajectories, without on-policy data. Therefore, apart from the context-informed initializations, it is not expected to exceed the teachers. Also, since it conditions on its own queries which are likely to differ from the teachers’, the errors might occur and accumulate. Additionally, fine-tuning appears to degrade the base models’ initialization quality.
Questions for authors
- See Weakness 1: could you clarify on how you ensure the training data to be realistic and diverse, and how you check for overlap between training and test problems?
- See Weakness 2: did you consider on-policy training, e.g., DAgger or RL fine-tuning?
- How does SemanticOpt perform against the baselines on standard BO benchmarks without semantic information?
- Even though the authors consider it as out-of-scope to compare against other LLM-based baselines, to me it’s still worthy of learning whether the fine-tuning cost brings clear gains over training-free LLM-based methods with a base model of comparable strength.
- Do the LLM-generated training problems include counterfactual, mismatched, and adversarial semantic information? If not, where does the robustness come from?
- SemanticOpt is trained on trajectories with 10, 25, 50, and 100 total steps. How does it perform with longer budgets (e.g., 200 steps)? Given the maximum sequence length, what are the longest histories that SemanticOpt can handle?
4 comments
Response to Specific Questions
We hope to address your specific comments below.
Q1. Realism, diversity and overlap of the training problems
The 1,800 training problems span a diverse set of problems, dimensions, and parameter types. Their objectives are surrogates fitted to generated points, so no benchmark data is used in training. We evaluate the dataset and benchmark using textual similarity scores and find that the gain over the base model is unrelated to similarity (Appendix J).
Q2. Off-policy training, error accumulation and initialization
We agree that, from the same starts, SemanticOpt matches rather than exceeds its teachers. Its contribution is to reach their level within the LLM, where the base model plateaus. We see no error accumulation within the trained length: between 50 and 100 evaluations, SemanticOpt keeps improving and stays level with the teachers (Appendix I).
We also agree on initialization. SemanticOpt's first proposals are weaker than the base model's, likely because the training trajectories started from a smaller model's proposals, and given the base model's starts instead, SemanticOpt scores higher (Appendix G). On-policy training such as DAgger or RL is a principled fix and could be an interesting opportunity for future work.
Q3. Standard BO benchmarks without semantic information
We evaluated SemanticOpt, the base model and the HEBO teachers on 33 standard test functions and the 24 BBOB functions, with anonymized parameters and no context (Appendix H):
| Standard (33) | BBOB (24) | |
|---|---|---|
| SemanticOpt | 0.578 | 0.843 |
| Qwen 3.5 27B | 0.471 | 0.713 |
| HEBO teachers | 0.524–0.608 | 0.771–0.881 |
The learned refinement carries over without context. SemanticOpt improves clearly on its base model and falls within the range of its teachers.
Q4. Comparison with training-free LLM methods on a comparable base model
We have added the suggested methods, LLAMBO, LGBO, LLINBO-Transient, LLINBO-Justify, LABO and GOLLuM, on all 42 benchmarks and the same context. Overall results are available in Figure 9. Scores after 50 evaluations, each method from its own initial configurations, are summarized below:
| Method | Score |
|---|---|
| LGBO | 0.854 |
| SemanticOpt | 0.827 |
| LLINBO-Transient | 0.809 |
| LLINBO-Justify | 0.808 |
| LABO | 0.786 |
| Qwen 3.5 27B | 0.769 |
| LLAMBO | 0.767 |
| GOLLuM | 0.713 |
Fine-tuning brings a clear gain over prompting the same base model (0.827 against 0.769), and SemanticOpt also outperforms LLAMBO and GOLLuM. It is level with both LLINBO variants and LABO, and only LGBO ends higher (0.854).
Additionally, LGBO’s lead over SemanticOpt comes from initialization rather than refinement. LGBO takes its five initial configurations from the base model, and these are stronger than SemanticOpt’s own (0.61 against 0.48 after five evaluations). When both methods continue from the same five configurations, SemanticOpt refines as well as LGBO (0.836 against 0.844, p = 0.49; Appendix G).
SemanticOpt therefore matches LGBO's refinement within a single model, without fitting a GP. LGBO queries the base model throughout the search, and under misleading context it loses 0.14, against 0.04 for SemanticOpt (Figure 10). The remaining gap is SemanticOpt's weaker initialization, which is the main step for future work.
Q5. Source of robustness to misleading context
No, the training data contains no specified counterfactual, mismatched or adversarial context. However, its contexts are generated by an LLM together with the objective and are never checked against it, and in each trajectory the BO teacher explores beyond the context-informed initial proposals. We believe the model learns to treat context as a prior rather than an instruction. Consistent with this, its initial proposals lose far less under adversarial context than the base model’s (Figure 10), and it keeps exploring where the base model does not (Appendix D).
Q6. Longer budgets
With a budget of 100 evaluations (Figure 24, Appendix I), SemanticOpt is level with its teachers, while the base model barely improves after 50. Training used trajectories of up to 100 evaluations and 24,576 tokens. As SemanticOpt was only trained up to 100 evaluations and many of our training functions reach near-optimum after this long, we do not expect the performance to generalize beyond this range. Further training and dataset generation could help alleviate this issue.
We hope these additions address your concerns, and we would be happy to answer any further questions.
Thank you for the rebuttal and the additional results.
The finding that the gain over the base model is not correlated with the TF-IDF similarity between training and test problems is interesting. A future investigation using a metric that reflects semantic similarity between tasks, or a principled criterion for designing the LLM-generated training priors, would be insightful.
The new results on standard BO benchmarks without semantic information, and the comparison with LLM-based optimizers based on a frozen LLM, better position the proposed method: SemanticOpt does not outperform the strongest BO teacher or the frozen-LLM method (LGBO), but it offers an alternative approach that does not rely on an external surrogate, and it is more robust to adversarial context than frozen-LLM baselines and the base model.
I believe the additional results and the revised contributions and scope in the updated manuscript improve the work, and I am happy to increase my score.
Thank you for raising your score and for your thoughtful engagement. We agree that a semantic similarity measure between tasks, or a principled criterion for designing the LLM-generated training problems, would be a valuable follow-up.
Update Overview
Thank you for your careful reading and constructive comments. We have run several new experiments and revised the paper based on your useful feedback. All new or changed text is marked in blue within the updated paper.
Key new experiments:
Core claims: