arXiv Machine Learning By Shuhei Sugiura, Ichiro Takeuchi, Shion Takeno

Randomized Kriging Believer for Parallel Bayesian Optimization with Regret Bounds

Read the original on arXiv Machine Learning →

arXiv:2603. 01470v3 Announce Type: replace Abstract: We consider the optimization problem of an expensive-to-evaluate black-box function, in which we can obtain noisy function values in parallel.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Jun 2

Local Preferential Bayesian Optimization

arXiv:2606. 02351v1 Announce Type: new Abstract: Bayesian optimization (BO) is a popular and effective approach for tuning expensive, noisy experiments, but requires the formulation of an explicit objective function.

By Johanna Menn, Miriam Kober, Paul Brunzema, David Stenger, Sebastian Trimpe