- Rating
- 1
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper incorporates LLM-generated pairwise preferences into a GP prior to improve the sample efficiency of black-box optimization. The method is evaluated on six datasets ranging from 11D to 25D.
Critical strengths
The paper evaluates the method on benchmarks spanning multiple domains.
Critical weaknesses
- Limited novelty. LABO (ICML 2026) models the optimization problem’s input–output relationship using the Kennedy–O’Hagan (KOH) formulation and dual-fidelity modeling. The proposed approach also shares similarities with Direct Preference Optimization (DPO). LGBO (ICLR 2026) has explored incorporating LLM preferences into GP priors. More detailed methodological and empirical comparisons are needed.
- Insufficient justification for the “agentic” claim. The approach appears to rely primarily on prompt engineering, without clearly demonstrating autonomous planning, task execution, tool use, or feedback-driven iterative decision-making. A relevant comparison is Agentic Bayesian Optimization through Surrogate-Augmented Autoresearch .
Questions for authors
- Can the method be evaluated on other BBO applications, such as machine learning hyperparameter optimization?
- Can the authors evaluate performance in higher-dimensional settings, which are common in scientific optimization?
- Can the prior itself evolve throughout optimization?
- The ablation studies are incomplete. Can the authors directly assess the necessity of the agentic preference-generation mechanism, compare different LLMs, and evaluate prompt sensitivity?
- Compare against more LLM-assisted BO baselines, such as BOPRO (ICLR 2025).
8 comments
Reviewer CYXo-Part 2 (Weakness 2)
W2
Insufficient justification for the “agentic” claim. The approach appears to rely primarily on prompt engineering, without clearly demonstrating autonomous planning, task execution, tool use, or feedback-driven iterative decision-making. A relevant comparison is Agentic Bayesian Optimization through Surrogate-Augmented Autoresearch.
Response
We respectfully disagree with the reviewer's characterization of our approach as primarily relying on prompt engineering. Our framework employs a coding agent that autonomously constructs and validates task-specific computational procedures, rather than simply prompting an LLM to generate preferences.
As detailed in Section 3.1 and Appendix B.1, the agent is implemented using the Codex CLI coding-agent environment. Given the optimization problem and static scenario information, it autonomously analyzes the underlying system, identifies relevant domain mechanisms, selects approximation methods, and implements executable analysis code. It further performs computational checks, such as boundary tests and sensitivity analyses, to assess the reliability of its estimates and revise the procedure or abstain from uncertain comparisons when necessary. Importantly, our prompt specifies neither task-specific models nor predefined scoring rules; these are developed by the agent through its own analysis and tool execution. The resulting artifact is a reusable preference-generation program, rather than a collection of direct LLM judgments. These operations explicitly involve autonomous method selection, task execution, tool use, and feedback-based validation.
The suggested comparison with Agentic Bayesian Optimization (Brunzema et al., 2026) also concerns a different research objective. That work investigates agentic optimization, where an LLM agent controls the optimization process, analyzes accumulated observations, and adaptively modifies search strategies. In contrast, our work investigates agentic domain-knowledge elicitation: the agent autonomously transforms problem descriptions and domain knowledge into an executable approximation mechanism, which is subsequently used to construct a GP prior before any expensive objective evaluations. Accordingly, the feedback used by our agent comes from its own computational analyses and validation procedures, rather than observations collected during optimization. These are distinct applications of agentic capabilities, and autonomous modification of the optimizer is not a prerequisite for agentic knowledge elicitation.
We therefore maintain that the agentic nature of our framework should be assessed by its autonomous modeling decisions, executable actions, and use of computational feedback, rather than whether it operates within the BO loop. To make these mechanisms more transparent, we will further clarify the agent's execution and validation workflow in the revised manuscript.
Reviewer CYXo-Part 3 (Q1, Q2)
Q1
Can the method be evaluated on other BBO applications, such as machine learning hyperparameter optimization?
Response
We thank the reviewer for this suggestion. Our framework is not restricted to any particular application domain. Its applicability primarily depends on whether the problem context provides domain knowledge that can be translated into informative preferences. In principle, the framework can also be applied to hyperparameter optimization (HPO), where knowledge about model architectures, training procedures, and hyperparameter interactions may inform prior construction.
However, our primary focus is on expensive scientific and engineering BBO problems, where rich domain knowledge is available but objective evaluations are costly. We have already evaluated the framework on six benchmarks spanning four distinct application domains: traffic control, EV charging, water-network operation, and materials screening. These experiments demonstrate its effectiveness across heterogeneous optimization problems, rather than within a single application.
We agree that HPO represents an interesting additional application. We therefore consider it a valuable direction for future investigation.
Q2
Can the authors evaluate performance in higher-dimensional settings, which are common in scientific optimization?
Response
We thank the reviewer for raising this important question about high-dimensional optimization. While our original six benchmarks span 11–25 dimensions, we agree that further evaluation is needed to assess performance in substantially higher-dimensional settings.
We therefore conducted an additional experiment on HPA101-2, a 108-dimensional human-powered aircraft design problem (Namura, 2025). We construct the preference-informed GP prior using 1,000 agent-generated hard preferences from 2,048 support candidates, with 512 inducing points. No target-task objective evaluations are used during prior construction. We assess preference quality, the elicited distribution, and optimization performance.
(1) Quality of agent-generated preferences. We evaluate the preference generator on a test set containing 10,000 candidate pairs.
Table 1.
| Test pairs | Coverage | Preference accuracy |
|---|---|---|
| 10,000 | 81.02% | 87.45% |
The agent-generated preferences achieve 87.45% accuracy with 81.02% coverage, indicating that informative pairwise relationships can be elicited in this high-dimensional problem.
(2) Quality of the elicited distribution. We compare the ranking accuracy of the preference-informed GP prior with conventional GP posteriors trained on direct objective observations, using 5,000 held-out candidate pairs.
Table 2.
| Predictive distribution | Objective evaluations | Ranking accuracy |
|---|---|---|
| Preference posterior | 0 | 72.62% |
| GP posterior (20) | 20 | 55.67% |
| GP posterior (50) | 50 | 57.46% |
GP results use observations from GP-LCB trajectories and data-estimated RBF lengthscales, averaged over 20 seeds.
Without using target-task evaluations, the elicited distribution achieves 72.62% ranking accuracy, substantially outperforming conventional GP posteriors trained with 20 or 50 objective observations.
(3) Optimization performance. We further incorporate the elicited distribution into GP-LCB and compare it with Vanilla BO (GP-LCB) over 40 paired seeds. Both methods share 10 initial objective evaluations and receive 200 additional evaluations. We report mean best-so-far objective values (lower is better).
Table 3.
| Additional evaluations | Ours (GP-LCB) | Vanilla BO (GP-LCB) | Relative reduction |
|---|---|---|---|
| 10 | 42.01 ± 6.67 | 60.88 ± 26.92 | +30.99% |
| 20 | 38.60 ± 4.72 | 44.39 ± 8.42 | +13.04% |
| 50 | 34.66 ± 3.59 | 35.35 ± 3.51 | +1.95% |
| 100 | 33.04 ± 2.58 | 32.77 ± 2.71 | −0.82% |
| 200 | 31.41 ± 1.56 | 31.32 ± 1.66 | −0.29% |
Relative reduction = (Vanilla BO − Ours) / Vanilla BO × 100%; positive values favor our method. The two methods use their respective tuned GP-LCB configurations.
Our method reduces the mean objective value by 30.99% after 10 additional evaluations and 13.04% after 20 evaluations. The advantage diminishes as more observations become available, with both methods achieving comparable final performance.
Overall, these results demonstrate that our framework can elicit informative preferences, construct a useful probabilistic prior, and improve early-stage optimization in a 108-dimensional search space using only 1,000 hard preferences. This provides further empirical evidence of its applicability to high-dimensional problems, although broader scalability across dimensions and problem classes remains to be investigated. This experiment has been supplemented in the revised manuscript in Appendix E.5
Reviewer CYXo-Part 1 (Weakness 1)
Weakness 1
Response
We respectfully disagree with the reviewer's assessment of limited novelty. The cited studies address substantially different methodological questions and do not establish that our contribution lacks originality. Our central contribution is an agentic framework for eliciting domain knowledge from pretrained LLMs and transforming it into an informative function-space prior before any target-objective evaluations. Specifically, a coding agent autonomously constructs a reusable, task-specific preference generator, whose pairwise judgments are converted into a GP prior with learned mean and covariance through Bayesian preference learning. This provides a systematic mechanism for incorporating LLM domain knowledge into BBO, rather than merely using LLMs to guide individual search decisions.
First, LGBO (Yuan et al., 2026) is the most closely related work, but its methodology differs fundamentally from ours. LGBO repeatedly queries an LLM using evolving optimization histories to identify promising points or regions, which are incorporated through region-lifted updates that shift the GP mean while preserving its covariance. In contrast, our agent constructs an executable preference-generation mechanism before any objective evaluations, and the resulting pairwise comparisons are aggregated probabilistically to learn both the mean and covariance of a GP prior. The distinction therefore lies in how domain knowledge is elicited, how it is represented probabilistically, and how it is incorporated into optimization.
Second, LABO (Chen et al., 2026) addresses a different problem through multi-fidelity modeling. It treats LLM-generated numerical predictions as low-fidelity observations and employs the Kennedy–O'Hagan (KOH) formulation to combine them with real evaluations through a cross-fidelity relationship and discrepancy model. Our approach instead constructs a GP prior from ordinal comparisons without requiring calibrated numerical predictions or estimating a low-to-high-fidelity relationship. The shared objective of modeling an unknown input–output relationship does not imply methodological equivalence; this is a general principle underlying surrogate-based optimization.
Third, the comparison with DPO (Rafailov et al., 2023) is not methodologically justified. DPO uses preference data to optimize the policy parameters of a language model. Our framework does not optimize or fine-tune the LLM; it uses agent-generated comparisons to infer a probabilistic prior over an external black-box objective. The mere use of pairwise comparisons does not make these approaches methodologically equivalent.
Importantly, our manuscript already provides direct empirical comparisons with LGBO across all six benchmarks, using matched initialization and evaluation budgets over 20 seeds. Our method achieves substantially better average ranks at 10, 20, and 200 post-initialization evaluations (1.17 vs. 4.00, 1.00 vs. 4.33, and 2.08 vs. 4.08, respectively), while using considerably fewer LLM tokens (0.52M vs. 16.92M). Furthermore, our theoretical analysis characterizes finite-budget regret improvement under an explicit alignment condition, sensitivity to preference errors, and asymptotic convergence.
In summary, the novelty of our work lies not in the isolated use of LLMs, preferences, or GPs, but in a new mechanism for autonomously eliciting domain knowledge and converting it into a reusable probabilistic prior for BBO. None of the cited studies implements this complete mechanism. We therefore maintain that the methodological contribution is distinct and supported by both theoretical and empirical evidence. We have further clarified these distinctions in the revised Related Work section.