arXiv Statistics ML
Cost-aware Bayesian Optimization via the Pandora's Box Gittins Index
Read the original on arXiv Statistics ML →The Flow has not summarised this story yet — read it at arXiv Statistics ML.
Related stories
arXiv Machine Learning
Oct 8
BONSAI: Bayesian Optimization with Natural Simplicity and Interpretability
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...
arXiv Machine Learning
Sep 23
Efficient Cost-Aware LLM Evaluation via Bayesian Bandit Gittins Indices
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...
arXiv Machine Learning
Oct 8
Pre-training of Bayesian Optimization Algorithm through Bayesian Optimization
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...
Hugging Face Trending Papers
Sep 22
Efficient Cost-Aware LLM Evaluation via Bayesian Bandit Gittins Indices
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 Machine Learning
Jul 13
Information-Theoretic Bayesian Optimization for Bilevel Optimization Problems
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.
arXiv Statistics ML
Oct 2
IQS-BO: In-Context Query Selection for Bayesian Optimisation
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.