Simplifying Bayesian Optimization Via In-Context Direct Optimum Sampling
Not on the map. Why?
Abstract (arXiv)
The optimization of expensive black-box functions is ubiquitous in science and engineering. A common solution to this problem is Bayesian optimization (BO), which is generally comprised of two components: (i) a surrogate model and (ii) an acquisition function, which generally require expensive re-training and optimization steps at each iteration, respectively. Although recent work enabled in-context surrogate models that do not require re-training, virtually all existing BO methods still require acquisition function maximization to select the next observation, which introduces many knobs to tune, such as Monte Carlo samplers and multi-start optimizers. In this work, we propose a completely in-context, zero-shot solution for BO that does not require surrogate fitting or acquisition function optimization. This is done by using a pre-trained deep generative model to directly sample from the posterior over the optimum point. We show that this process is equivalent to Thompson sampling and demonstrate the capabilities and cost-effectiveness of our foundation model on a suite of real-world benchmarks. We achieve an efficiency gain of more than 35x in terms of wall-clock time when compared with Gaussian process-based BO, enabling efficient parallel and distributed BO, e.g., for high-throughput optimization.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 30 of its 47 references that are in the map. First posted on arXiv 29 May 2025.
Builds on
30 of 47 references.
References · 30
- 2017Attention Is All You Needcited by 59,932
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2021Zero-Shot Text-to-Image Generationcited by 4,276
- 2014Learning Phrase Representations using RNN Encoder-Decoder for Statistical Machine Translationcited by 4,016
- 2017Deep Setscited by 1,394
- 2019Normalizing Flows for Probabilistic Modeling and Inferencecited by 1,315
- 2021An Explanation of In-context Learning as Implicit Bayesian Inferencecited by 915
- 2019Neural Spline Flowscited by 590
- 2018Conditional Neural Processescited by 421
- 2024OmniGen: Unified Image Generationcited by 388
- 2021Transformers Can Do Bayesian Inferencecited by 338
- 2014Predictive Entropy Search for Efficient Global Optimization of Black-box Functionscited by 201
18 more
- 2020Auto-Sklearn 2.0: Hands-free AutoML via Meta-Learningcited by 174
- 2023Unexpected Improvements to Expected Improvement for Bayesian Optimizationcited by 144
- 2020BayesFlow: Learning complex stochastic models with invertible neural networkscited by 139
- 2018Maximizing acquisition functions for Bayesian optimizationcited by 113
- 2019Model Inversion Networks for Model-Based Optimizationcited by 83
- 2017Parallel and Distributed Thompson Sampling for Large-scale Accelerated Exploration of Chemical Spacecited by 76
- 2023Diffusion Models for Black-Box Optimizationcited by 75
- 2023PFNs4BO: In-Context Learning for Bayesian Optimizationcited by 70
- 2023normflows: A PyTorch Package for Normalizing Flowscited by 56
- 2023A Study of Bayesian Neural Network Surrogates for Bayesian Optimizationcited by 50
- 2024A Sober Look at LLMs for Material Discovery: Are They Actually Good for Bayesian Optimization Over Molecules?cited by 46
- 2019BINOCULARS for Efficient, Nonmyopic Sequential Experimental Designcited by 35
- 2024Text-Guided Molecule Generation with Diffusion Language Modelcited by 31
- 2025Can Transformers Learn Full Bayesian Inference in Context?cited by 30
- 2020Olympus: a benchmarking framework for noisy optimization and experiment planningcited by 28
- 2025Posterior Inference with Diffusion Models for High-dimensional Black-box Optimizationcited by 12
- 2023Promises and Pitfalls of the Linearized Laplace in Bayesian Optimizationcited by 10
- 2024How Useful is Intermittent, Asynchronous Expert Feedback for Bayesian Optimization?cited by 2
Built on by
Citing papers per year: 2025: 1; 2026: 6.
7 papers.
- 2025Thompson Sampling via Fine-Tuning of LLMscited by 6
- 2026LABO: LLM-Accelerated Bayesian Optimization through Broad Exploration and Selective Experimentationcited by 4
- 2026Tree-Structured Synergy of Large Language Models and Bayesian Optimization for Efficient CASHcited by 2
- 2026A Theoretical Analysis of Test-Driven Code Generationcited by 2
- 2026Partition, Prompt, Aggregate: Statistical Self-Consistency in Language Modelscited by 2
- 2026POETS: Uncertainty-Aware LLM Optimization via Compute-Efficient Policy Ensemblescited by 0
- 2026IQS-BO: In-Context Query Selection for Bayesian Optimisationcited by 0
- 2026IQS-BO: In-Context Query Selection for Bayesian Optimisation1 Oct 2026
- 2026Partition, Prompt, Aggregate: Statistical Self-Consistency in Language Models16 Jul 2026
- 2026LABO: LLM-Accelerated Bayesian Optimization through Broad Exploration and Selective Experimentation21 May 2026
- 2026POETS: Uncertainty-Aware LLM Optimization via Compute-Efficient Policy Ensembles8 May 2026
- 2026A Theoretical Analysis of Test-Driven Code Generation5 Feb 2026
- 2026Tree-Structured Synergy of Large Language Models and Bayesian Optimization for Efficient CASH18 Jan 2026
- 2025Thompson Sampling via Fine-Tuning of LLMs15 Oct 2025