Agentic High-Dimensional Bayesian Optimization with Hypothesis- and Evidence-Guided Search
cs.LG
Submitted: 2026-09-28
Updated: 2026-09-28
License: http://creativecommons.org/licenses/by/4.0/
The gist: High-dimensional Bayesian optimization (HDBO) seeks sample-efficient optimization when the number of variables is large relative to the evaluation budget.
Terminology
Abstract
High-dimensional Bayesian optimization (HDBO) seeks sample-efficient optimization when the number of variables is large relative to the evaluation budget. Recent LLM-based and agentic BO methods incorporate task knowledge and adapt search decisions during a run, but have primarily been evaluated on low- and moderate-dimensional problems. We ask whether this paradigm can transfer to the higher-dimensional regime. Our experiments show that these methods do not remain reliable in the high-dimensional regime, where the challenge is not only where to evaluate, but also which modeling assumption and search geometry to use when the objective's useful structure is unknown. We therefore introduce HERA, a Hypothesis- and Evidence-guided Research Agent that uses task context, optimization feedback, and structural diagnostics to revise search hypotheses, select and configure HDBO strategies, and determine their execution length. PRISM, its numerical optimization engine, generates and evaluates candidates sequentially within each search block, updating numerical models after each observation. HERA remains competitive with strong numerical HDBO baselines and outperforms the evaluated LLM-based and agentic methods on four metadata-free synthetic functions. Across eight real-world tasks, HERA achieves the best mean final objective among all evaluated systems on most benchmarks. Further analyses show that structural diagnostics change strategy use, metadata effects vary across tasks, and adaptive search blocks reduce inference cost.
Sources
- Agentic Bayesian Optimization through Surrogate-Augmented Autoresearch
- LLINBO: Trustworthy LLM-in-the-Loop Bayesian Optimization
- Can LLMs Beat Classical Hyperparameter Optimization Algorithms? A Study on autoresearch
- A Tutorial on Bayesian Optimization
- Embedding by Elicitation: Dynamic Representations for Bayesian Optimization of System Prompts
- Large Language Model Agent for Hyper-Parameter Optimization
- OptiMindTune: A Multi-Agent Framework for Intelligent Hyperparameter Optimization
- Language Model Embeddings Can Be Sufficient for Bayesian Optimization
- Large language models as uncertainty-calibrated optimizers for experimental discovery
- Benchmarking Model-Based Reinforcement Learning
- BBOPlace-Bench: Benchmarking Black-Box Optimization for Chip Placement
- Reasoning BO: Enhancing Bayesian Optimization with Long-Context Reasoning Power of LLMs
- GIT-BO: High-Dimensional Bayesian Optimization with Tabular Foundation Models
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks