arXiv:2602.07144v3 Announce Type: replace
Abstract: Bayesian optimization (BO) is a popular technique for sample-efficient optimization of black-box functions. In many applications, the parameters be...
By Samuel Daulton, David Eriksson, Maximilian Balandat, Eytan Bakshy
arXiv:2609.25645v1 Announce Type: new
Abstract: Exhaustively evaluating every candidate LLM configuration on every benchmark item to identify a high-performing one is costly. We formulate configurati...
By Qian Xie, Yueli He, Nairen Cao
arXiv:2610.10186v1 Announce Type: new
Abstract: Bayesian optimization (BO) is widely used as a standard approach for expensive black-box optimization. However, BO algorithms often involve parameters...
By Satoshi Katayama, Shoyo Hunt, Shintaro Masuda, Masayuki Karasuyama
Exhaustively evaluating every candidate LLM configuration on every benchmark item to identify a high-performing one is costly. We formulate configuration selection as a cost-aware Bayesian bandit prob...
arXiv:2509. 21725v3 Announce Type: replace Abstract: A bilevel optimization problem consists of two optimization problems nested as an upper- and a lower-level problem, in which the optimality of the lower-level problem defines a constraint for the upper-level problem.
By Takuya Kanayama, Yuki Ito, Tomoyuki Tamura, Masayuki Karasuyama
IQS-BO introduces an in‑context query selection method for Bayesian optimisation that learns to choose evaluation points via supervised learning on synthetic priors. The approach uses a Prior‑data Fitted Network (PFN) to predict, in a single forward pass, the probability that each candidate maximises the objective, thereby amortising the decision step and eliminating the need for costly surrogate refitting or acquisition maximisation. Experiments show that IQS‑BO matches or surpasses traditional Gaussian‑process‑based BO and other in‑context methods on both synthetic and real‑world benchmarks, and that a mixture prior combining GP samples with challenging function types further improves performance.
By Luca Geminiani, Nadja Klein
arXiv:2606. 07134v1 Announce Type: new Abstract: Information-theoretic acquisition functions such as Entropy Search (ES) offer a principled exploration-exploitation framework for Bayesian optimization (BO).
By Herilalaina Rakotoarison, Steven Adriaensen, Tom Viering, Carl Hvarfner, Samuel M\"uller, Frank Hutter, Eytan Bakshy
arXiv:2606. 07841v1 Announce Type: cross Abstract: Black-box variational inference (BBVI) is a methodology for posterior approximation that relies on stochastic optimization.
By Trevor Campbell, Jonathan H. Huggins, Kyurae Kim, Charles C. Margossian
arXiv:2607.10669v3 Announce Type: replace
Abstract: Bayesian optimization is widely used for expensive black-box optimization problems. While methodological advances often focus on individual compone...
By L. A. Zhukov, E. V. Shaburova, D. V. Antonets
arXiv:2609.26021v1 Announce Type: new
Abstract: Dynamic black-box optimization presents significant challenges for Bayesian Optimization (BO), as the objective function evolves over time, causing opt...
By Merlin Angel Kelly, Rishan Patel, Alexander Thomas, Ziyue Zhu, Zikun Quan, Tom Carlson, Youngjun Cho
arXiv:2610.08969v1 Announce Type: new
Abstract: Black-box optimization problems are ubiquitous across science and engineering, often dealing with expensive objective functions. This objective latency...
By Gustavo Sutter, Alejandro Comas-Leon, David Holzm\"uller, Hao Wang, Luis Ricardez-Sandoval, Pascal Poupart, Agustinus Kristiadi
arXiv:2507.06529v2 Announce Type: replace
Abstract: Bayesian optimization (BO) is a powerful paradigm for optimizing expensive black-box functions. Traditional BO methods typically rely on separate h...
By Fengxue Zhang, Yuxin Chen