arXiv:2607. 04356v1 Announce Type: new Abstract: Bayesian Optimization (BO) generally begins with an initialization phase: a batch of $n_0$ uninformed evaluations.
Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.
arXiv:2601. 07094v2 Announce Type: replace-cross Abstract: Bayesian optimization (BO) iteratively fits a Gaussian process (GP) surrogate to accumulated evaluations and selects new queries via an acquisition function.
arXiv:2502. 01226v4 Announce Type: replace Abstract: Gaussian process (GP) bandits provide a powerful framework for performing blackbox optimization of unknown functions.
arXiv:2307. 03587v4 Announce Type: replace Abstract: In non-stationary linear contextual bandits, existing efficient algorithms typically rely on the Weighted Regularized Least-Squares (WRLS) estimator.
arXiv:2603. 09276v2 Announce Type: replace-cross Abstract: We study a widely used Bayesian optimization method, Gaussian process Thompson sampling (GP-TS), under the assumption that the objective function is a sample path from a GP.
arXiv:2606. 00956v1 Announce Type: new Abstract: This paper studies a one-step lookahead Bayesian optimization (BO) method and its theoretical guarantee.
arXiv:2606. 07841v1 Announce Type: cross Abstract: Black-box variational inference (BBVI) is a methodology for posterior approximation that relies on stochastic optimization.