ARTFEED — Contemporary Art Intelligence

Ensemble Robust Bayesian Optimisation Algorithm

ai-technology · 2026-05-11

A new algorithm for Ensemble Distributionally Robust Bayesian Optimisation (EDRBO) has been proposed, addressing zeroth-order optimisation under context distributional uncertainty. The method uses an ensemble as a surrogate model to enhance robustness against noisy data, a common challenge in Bayesian optimisation (BO). It remains computationally tractable while handling continuous contexts. Theoretical sublinear regret bounds are established, improving upon current state-of-the-art results. Empirical evaluations confirm alignment with theoretical guarantees. The work is published on arXiv under computer science and machine learning categories.

Key facts

  • Algorithm: Ensemble Distributionally Robust Bayesian Optimisation (EDRBO)
  • Addresses zeroth-order optimisation under context distributional uncertainty
  • Uses ensemble surrogate model to improve robustness
  • Remains computationally tractable with continuous context
  • Theoretical sublinear regret bounds achieved
  • Improves current state-of-the-art results
  • Empirical behaviour aligns with theoretical guarantees
  • Published on arXiv (2605.07565) in cs.LG

Entities

Institutions

  • arXiv

Sources