Metraipolis › archive › dc_d652b4ee93d6
Sharper Regret Bounds for Time-Varying Gaussian Process Bandits with Constant Exploration — arXiv:2608.18863
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.18863
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T13:53:52.508Z
- SHA-256 of the archived text
ef542ab6e3ae20ea5dbcbc7319f1b665fddf7ee1f256721fd1ea4647ea9082b5- Stable URL of this page
https://metraipolis.com/documento/dc_d652b4ee93d6
How to cite
Sharper Regret Bounds for Time-Varying Gaussian Process Bandits with Constant Exploration — arXiv:2608.18863 — arXiv (en), https://arxiv.org/abs/2608.18863 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d652b4ee93d6 (Metraipolis archive dc_d652b4ee93d6, sha256 ef542ab6e3ae20ea5dbcbc7319f1b665fddf7ee1f256721fd1ea4647ea9082b5)
BibTeX
@misc{dcd652b4ee93d6,
title = {Sharper Regret Bounds for Time-Varying Gaussian Process Bandits with Constant Exploration — arXiv:2608.18863},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.18863},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d652b4ee93d6; sha256 ef542ab6e3ae20ea5dbcbc7319f1b665fddf7ee1f256721fd1ea4647ea9082b5},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.18863. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study Bayesian optimization in a time-varying environment where the unknown reward function evolves according to a Gaussian process drift model. Existing GP-UCB analyses in this setting typically require the exploration parameter to grow with the horizon to maintain uniform confidence bounds. Using per-round local confidence events, we show that GP-UCB can instead be run with a constant exploration parameter and obtain an expected-regret bound whose coefficient depends on the drift rate. We also derive a sharper time-varying maximum-information-gain bound. For the squared exponential kernel, it yields $\tilde\gamma_T/T=\widetilde{\mathcal O}(\epsilon^{1/2})$ and expected average regret $\widetilde{\mathcal O}(\epsilon^{1/4})$ in the persistent-drift regime. The same constant-exploration analysis also yields realized-regret guarantees. Simulations support the predicted logarithmic dependence of the bound-suggested exploration parameter on $1/\epsilon$.
Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-20 in cs.LG).
Categorie arXiv: Machine Learning (stat.ML) ; Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2608.18863 — 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-18T13:50:59.004Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-08-20?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).