Metraipolis › archive › dc_1fadfde9f2ea

Bayesian Optimization on Function Spaces via Sparse RKHS Manifolds — arXiv:2610.07417

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.07417
License (as archived)
CC0-1.0
Archived
2026-10-07T11:42:24.655Z
SHA-256 of the archived text
889574bf44d14931d1ffafbfd810557718cd6adbcd3780da02bf52bb16e9691d
Stable URL of this page
https://metraipolis.com/documento/dc_1fadfde9f2ea

How to cite

Bayesian Optimization on Function Spaces via Sparse RKHS Manifolds — arXiv:2610.07417 — arXiv (en), https://arxiv.org/abs/2610.07417 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_1fadfde9f2ea (Metraipolis archive dc_1fadfde9f2ea, sha256 889574bf44d14931d1ffafbfd810557718cd6adbcd3780da02bf52bb16e9691d)
BibTeX
@misc{dc1fadfde9f2ea,
  title = {Bayesian Optimization on Function Spaces via Sparse RKHS Manifolds — arXiv:2610.07417},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.07417},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_1fadfde9f2ea; sha256 889574bf44d14931d1ffafbfd810557718cd6adbcd3780da02bf52bb16e9691d},
  year = {2026}
}

Archived text

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

Bayesian Optimization (BO) has become an established methodology for minimizing black-box functions of a vector input. Often, however, this parameter vector arises from the discretization of an inherently functional relationship. Several recent articles have considered the Functional Bayesian Optimization (FBO) setting, in which the variable to be optimized is not a member of a finite dimensional vector space, but rather an infinite dimensional function space. In this work, we propose $L^0$ Manifold Optimization (L0MO), a simple approach to FBO which searches the subset of a Reproducing Kernel Hilbert Space (RKHS) consisting of functions with a sparse representation in the kernel functions, optimizing both the kernel locations and their coefficients. We discuss in detail the relationship between our method and existing ones, providing a unifying lens through which to view prior works. To assess our method against the state of the art, we conduct an extensive computational study, and along the way develop a novel set of benchmark test functions which port standard finite-dimensional ones to the infinite dimensional domain. Our experiments demonstrate that, on balance, the proposed method achieves superior performance across a wide range of test benchmarks.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno).
Categorie arXiv: Machine Learning (stat.ML) ; Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2610.07417 — 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-07T11:19:24.893Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).