Metraipolis › archive › dc_3d0bebc7634c

BOBA: Dynamic Bayesian Optimization through Bayesian Active Inference — arXiv:2609.26021

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.26021
License (as archived)
CC0-1.0
Archived
2026-10-08T15:07:42.654Z
SHA-256 of the archived text
12cd5a71697153e6ecc815d421f48b8219d04e97586a71db0c52ce9937e7aaf7
Stable URL of this page
https://metraipolis.com/documento/dc_3d0bebc7634c

How to cite

BOBA: Dynamic Bayesian Optimization through Bayesian Active Inference — arXiv:2609.26021 — arXiv (en), https://arxiv.org/abs/2609.26021 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_3d0bebc7634c (Metraipolis archive dc_3d0bebc7634c, sha256 12cd5a71697153e6ecc815d421f48b8219d04e97586a71db0c52ce9937e7aaf7)
BibTeX
@misc{dc3d0bebc7634c,
  title = {BOBA: Dynamic Bayesian Optimization through Bayesian Active Inference — arXiv:2609.26021},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.26021},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_3d0bebc7634c; sha256 12cd5a71697153e6ecc815d421f48b8219d04e97586a71db0c52ce9937e7aaf7},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.26021. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Dynamic black-box optimization presents significant challenges for Bayesian Optimization (BO), as the objective function evolves over time, causing optimal locations to shift continuously. Existing dynamic BO (DBO) methods using standard acquisition functions such as Upper Confidence Bound (UCB) fail to explicitly account for temporal variations, leading to suboptimal sample allocation and poor tracking of moving optima. Here, we propose BOBA (Bayesian Optimization through Bayesian Active Inference), a novel acquisition function inspired by free energy principles from active inference that explicitly minimizes predictive uncertainty about future states in dynamic environments. BOBA extends traditional acquisition functions by incorporating a forward-looking uncertainty quantification that estimates uncertainty in function changes, enabling more informed exploration-exploitation trade-offs in non-stationary settings. We evaluate BOBA on synthetic dynamic benchmarks, comparing against state-of-the-art DBO methods. Our experiments demonstrate that BOBA significantly improves regret in query-restricted settings, while remaining competitive in time-limited settings. We further analyze variants of BOBA with different exploration strategies, showing how the exploration-exploitation balance can be tuned for different types of dynamic functions. This work contributes both a free energy-based acquisition function for DBO and insights into how active inference principles can enhance optimization in non-stationary environments, with implications for real-time applications requiring continuous adaptation.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-23 in cs.LG).
Categorie arXiv: Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2609.26021 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T14:37:29.448Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-23?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).