- Rating
- 3
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes CLUE-BO, a framework for high-dimensional Bayesian optimization that uses LLMs to construct priors over Gaussian process ARD lengthscales based on provided task descriptions and variable semantics. The method employs sequential predictive evidence to monitor the reliability of these priors, trigger LLM-based revisions, and validate updated priors before activation. Experiments on six benchmarks show that CLUE-BO achieves improved performance against a conventional high-dimensional BO methods. Ablation studies examine individual contributions of semantic guidance and the adaptive switching mechanism.
Critical strengths
The paper presents a well-motivated approach to incorporating semantic information into high-dimensional Bayesian optimization. The proposed framework is interesting, and the adaptation mechanism provides a principled way to assess and revise LLM priors, which is lacking in many existing LLM+BO approaches. The experimental results are convincing, demonstrated across a diverse set of high-dimensional benchmarks, and the ablation studies provide useful support for the individual components of the method.
Critical weaknesses
Limited evaluation of LLM generalization. The experiments rely on a single LLM and a set of established optimization benchmarks. It would be interesting to evaluate the method using:
- a) additional LLMs
- b) newly constructed synthetic benchmark that is unlikely to have been encountered during pretraining.
Such a benchmark could have a controlled ground-truth sensitivity structure and semantically meaningful variable descriptions. It could be constructed from scratch or by modifying the semantics of existing benchmarks. This would allow to more robustly assess whether the LLM can infer useful dimension-wise priors from the provided task information rather than relying on familiarity with existing benchmarks.
Limited comparison with related LLM-assisted BO methods. While the paper includes a comprehensive set of conventional high-dimensional BO baselines and ablations of the method, it lacks experimental comparisons with more closely related LLM-assisted approaches, particularly CAKE ([1], NeurIPS 2025) and LGBO ([2], ICLR 2026).
The kernel-selection mechanism proposed by CAKE incorporates EI alongside model fit, which could potentially provide an interesting alternative to CLUE-BO's predictive-likelihood-based switching criterion. LGBO, on the other hand, incorporates LLM preferences into the GP surrogate and is primarily motivated by improved suitability for high-dimensional problems (relative to existing LLM+BO approaches such as LLAMBO).
Questions for authors
The proposed controller relies on relative predictive likelihood to decide when semantic priors should be revised, accepted, or reactivated. However, superior predictive performance does not necessarily translate into better optimization performance. Could the authors elaborate on the motivation for using predictive likelihood as the switching criterion? Could a measure more directly related to optimization utility be used instead, e.g. like in CAKE? Is there empirical or theoretical evidence supporting the relationship between the chosen switching criterion and subsequent optimization performance?
8 comments
Author Rebuttal2
W2: Limited comparison with related LLM-assisted BO methods. While the paper includes a comprehensive set of conventional high-dimensional BO baselines and ablations of the method, it lacks experimental comparisons with more closely related LLM-assisted approaches, particularly CAKE ([1], NeurIPS 2025) and LGBO ([2], ICLR 2026).
Answer: Thank you for raising this important question. Both CAKE and LGBO primarily evaluate their methods on relatively low-dimensional optimization tasks, with the highest-dimensional benchmarks in their reported experiments having fewer than 20 dimensions. Neither method has been extensively evaluated in the high-dimensional settings considered in our work. We attempted to reproduce both CAKE and LGBO using their publicly available implementations.
CAKE. We attempted to reproduce CAKE using its publicly available implementation. CAKE uses LLMs to generate candidate kernels through crossover and mutation based on accumulated input-output observations. According to the default configuration of its official repository, each BO iteration invokes the LLM once for crossover and once more for mutation with a probability of 0.7. This corresponds to an expected 1.7 LLM calls per iteration, or approximately 5,100 calls per benchmark under our experimental setting of 300 BO iterations and 10 random seeds, this corresponds to approximately 5,100 expected LLM calls per benchmark, incurring substantial time and token costs.
In addition, CAKE maintains a population of six GP kernels. At each iteration, it refits these kernels using the accumulated observations and evaluates their BIC scores. Newly generated crossover and mutation candidates also require separate GP fitting and BIC evaluation before population selection. These repeated GP fitting procedures can introduce substantial time costs in high-dimensional settings.
In contrast, CLUE-BO is designed with LLM inference cost in mind. Rather than invoking the LLM at every BO iteration, it uses an evidence-driven reflection mechanism that triggers LLM calls only when accumulated predictive evidence suggests that the current semantic prior may need revision. The numbers of reflection triggers across six benchmarks and ten random seeds are summarized below.
| Benchmark | Reflection Triggers |
|---|---|
| Rover | 92 |
| Hopper-v4 | 85 |
| HumanoidStandup-v4 | 55 |
| DNA | 107 |
| SVM | 156 |
| NAS201 | 76 |
Each benchmark contains 3,000 BO observations across ten random seeds.
LGBO. LGBO incorporates LLM-generated point or region preferences into the GP surrogate at every BO iteration. According to its official implementation, each iteration requires an LLM call to generate a new preference based on the task information and accumulated observations, with an additional call if the output cannot be parsed. Under our experimental setting of 300 BO iterations and 10 random seeds, this corresponds to approximately 3,000 LLM calls per benchmark, excluding possible retries. This introduces considerable LLM inference cost. We are further examining the LGBO implementation and its applicability to our high-dimensional benchmarks.
We are currently working on reproducing both CAKE and LGBO under our high-dimensional experimental settings. Although preliminary experimental results are not yet available, we will make every effort to provide the results that can be obtained before the rebuttal deadline.
Author Rebuttal3
Q1: The proposed controller relies on relative predictive likelihood to decide when semantic priors should be revised, accepted, or reactivated. However, superior predictive performance does not necessarily translate into better optimization performance. Could the authors elaborate on the motivation for using predictive likelihood as the switching criterion? Could a measure more directly related to optimization utility be used instead, e.g. like in CAKE? Is there empirical or theoretical evidence supporting the relationship between the chosen switching criterion and subsequent optimization performance?
Answer: Thank you for your insightful question. Our choice of relative predictive likelihood is motivated by the need to continuously assess whether the semantic prior remains suitable for GP modeling as new observations become available. As discussed in Appendix A, the one-step log predictive ratio admits a relative KL-divergence interpretation, and its sequential accumulation has an e-process interpretation under the corresponding assumptions. This provides a principled basis for monitoring persistent predictive differences rather than switching priors based on individual predictions, while triggering LLM reflection and subsequent validation only when sufficient evidence accumulates.
We agree that approaches such as CAKE, which combine BIC and EI, offer an interesting alternative by jointly considering model fit and optimization potential. More generally, predictive quality and optimization utility play complementary roles in BO. GP posterior predictions characterize the objective function and provide the basis for acquisition functions, while acquisition functions such as EI directly guide the selection of promising evaluation points. Our relative predictive likelihood is intended to monitor the suitability of the GP prior, rather than directly measure the optimization utility of a candidate prior. Directly incorporating optimization-oriented criteria into our sequential evidence framework would require an additional statistical formulation to establish corresponding guarantees.
Predictive quality is an important consideration in Bayesian optimization, as GP posterior predictions directly influence subsequent acquisition decisions. To further examine the relationship between prior quality and optimization performance, we conduct independent function variation diagnostics on DNA and SVM, with the corresponding analyses added to Appendices C.1 and C.2. The corresponding changes are highlighted in blue for easy reference.
In particular, the SVM diagnostic shows that the initial semantic priors in eight of the ten runs are less consistent with the observed function variation, and these runs achieve lower final objective values than the other two runs. Nevertheless, seven of these eight runs produce at least one accepted reflection candidate that improves this consistency. Despite the less favorable initial allocations, the final objective values of these eight runs are comparable to those of the w/o LLM baseline. Moreover, the ablation results show that w/o Reflection performs worse than w/o LLM. These findings suggest that monitoring predictive evidence and validating reflected proposals can help mitigate the negative effects of potentially unreliable initial priors. Although these results do not establish a direct correspondence between predictive likelihood and optimization utility, they provide empirical support for using predictive evidence to monitor prior suitability during optimization. Exploring optimization-aware sequential evidence remains an interesting direction for future work. We have added this discussion to the Future Work section in Appendix G, with the corresponding changes highlighted in blue for easy reference.
Author Rebuttal1
Answer: Thank you so much for your suggestion.
To investigate the effect of LLM choice, we conduct additional experiments using DeepSeek-V4-Pro (our default LLM), GPT-6-Sol, and Gemini 3.6 Flash, while keeping the remaining CLUE-BO components unchanged.
The results obtained so far are summarized below:
Numbers in parentheses indicate the number of completed random seeds. Higher values are better.
The results show that LLM choice has a noticeable but task-dependent impact on optimization performance. DeepSeek-V4-Pro outperforms Gemini 3.6 Flash on all benchmarks. In comparison, GPT-6-Sol performs better on Hopper-v4, SVM, and HumanoidStandup-v4, whereas DeepSeek-V4-Pro performs better on NAS201, Rover, and DNA. These findings suggest that sufficient reasoning capability may be important for extracting useful task semantics and constructing informative priors. However, stronger general reasoning capability does not necessarily translate into better optimization performance across all tasks. We have added a new subsection, Appendix C.5 (Effect of LLM Choice), to report these additional experiments and discuss the impact of LLM choice on CLUE-BO. The corresponding changes are highlighted in blue for easy reference.
This experiment is still under development. We are further refining its design and will provide an update before the rebuttal deadline.