Metraipolis › archive › dc_e25aab48d221

No-Regret Bayesian Optimization with Finite-Library Input-Warped Kernels — arXiv:2609.02993

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.02993
License (as archived)
CC0-1.0
Archived
2026-10-17T02:07:43.219Z
SHA-256 of the archived text
9e671c5ae6d95eca7178868210a9f6a0f6e40fd2af578a5caee432f3fed9c0de
Stable URL of this page
https://metraipolis.com/documento/dc_e25aab48d221

How to cite

No-Regret Bayesian Optimization with Finite-Library Input-Warped Kernels — arXiv:2609.02993 — arXiv (en), https://arxiv.org/abs/2609.02993 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e25aab48d221 (Metraipolis archive dc_e25aab48d221, sha256 9e671c5ae6d95eca7178868210a9f6a0f6e40fd2af578a5caee432f3fed9c0de)
BibTeX
@misc{dce25aab48d221,
  title = {No-Regret Bayesian Optimization with Finite-Library Input-Warped Kernels — arXiv:2609.02993},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.02993},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e25aab48d221; sha256 9e671c5ae6d95eca7178868210a9f6a0f6e40fd2af578a5caee432f3fed9c0de},
  year = {2026}
}

Archived text

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

Gaussian-process Bayesian optimization (GP-BO) excels at black-box optimization of costly functions, e.g., hyperparameter optimization (HPO) and multi-agent system (MAS) design. Convergence-rate guarantees exist for select methods, notably GP upper confidence bound (GP-UCB), but require a fixed kernel. Critically, the kernel encodes how input proximity affects objective value similarity. When raw coordinates poorly match this geometry - as with log-scaled hyperparameters or localized peaks - input warping can greatly improve sample efficiency, yet known GP-UCB proofs require a fixed kernel. We propose Finite-Library Input-Warped Bayesian Optimization (FLIWBO), which selects warps from a finite library of smooth input maps by any history-dependent rule. It adapts the input geometry to accelerate learning while retaining high-probability convergence guarantees under mild hypotheses, with an explicit $\sqrt(N_\varepsilon)$ library-size cost. Controlled diagnostics show that finite-library warping repairs planted geometry mismatches and identify FLIWBO failure cases. Across four repeated benchmarks - warped synthetic objectives, a confidence-fence trap, and Fashion-MNIST HPO - FLIWBO-UCB beats raw-coordinate GP-UCB under misspecified geometry, escapes traps that defeat even oracle-warp expected improvement, and recovers much of the gain from manual log scaling, while leading the tested methods that admit a matching regret guarantee. A 20-dimensional MAS design study further shows feasibility under costly noisy evaluations. Code for experiments is available: this https URL .

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-04 in cs.LG).
Categorie arXiv: Machine Learning (cs.LG) ; Optimization and Control (math.OC); Machine Learning (stat.ML).
Pagina del lavoro: https://arxiv.org/abs/2609.02993 — 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-17T01:47:25.516Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-04?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).