arXiv — Machine Learning · · 3 min read

Bayesian optimization with kernel ensembles and disagreement-based acquisition for source localization and acoustic inversion

Mirrored from arXiv — Machine Learning for archival readability. Support the source by reading on the original site.

Computer Science > Machine Learning

arXiv:2609.14262 (cs)
[Submitted on 13 Sep 2026]

Title:Bayesian optimization with kernel ensembles and disagreement-based acquisition for source localization and acoustic inversion

View a PDF of the paper titled Bayesian optimization with kernel ensembles and disagreement-based acquisition for source localization and acoustic inversion, by Heng Zhang and 3 other authors
View PDF HTML (experimental)
Abstract:Joint source localization and geoacoustic inversion requires optimizing an objective built from an expensive normal mode propagation model. Bayesian optimization (BO) with a Gaussian process (GP) surrogate can obtain accurate parameter estimates within a limited number of forward model evaluations, but its performance depends on the choice of kernel family. With few observations in a seven-dimensional search space, no single kernel can be expected to perform consistently well across individual inversions. To reduce this dependence, we use a weighted ensemble of GPs with different kernel families, allowing the surrogate to adapt to the observed objective without committing to one kernel in advance. The ensemble is combined with an optimum-conditioned acquisition function that determines where the expensive objective should be evaluated next. Experiments on simulated and measured SWellEx-96 data show that the resulting method achieves the lowest mean final objective among the considered BO strategies and reduces parameter estimation error on most coordinates. Ablation results further show that the ensemble provides robustness to kernel choice, while the acquisition function accounts for most of the optimization gain.
Subjects: Machine Learning (cs.LG)
Cite as: arXiv:2609.14262 [cs.LG]
  (or arXiv:2609.14262v1 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.2609.14262
arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Haotian Xiang [view email]
[v1] Sun, 13 Sep 2026 03:52:00 UTC (1,153 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled Bayesian optimization with kernel ensembles and disagreement-based acquisition for source localization and acoustic inversion, by Heng Zhang and 3 other authors
  • View PDF
  • HTML (experimental)
  • TeX Source

Current browse context:

cs.LG
< prev   |   next >
Change to browse by:
cs

References & Citations

Loading...

BibTeX formatted citation

loading...
Data provided by:

Bookmark

BibSonomy Reddit
Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle
alphaXiv (What is alphaXiv?)
Links to Code Toggle
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub Toggle
DagsHub (What is DagsHub?)
GotitPub Toggle
Gotit.pub (What is GotitPub?)
Huggingface Toggle
Hugging Face (What is Huggingface?)
ScienceCast Toggle
ScienceCast (What is ScienceCast?)
Demos

Demos

Replicate Toggle
Replicate (What is Replicate?)
Spaces Toggle
Hugging Face Spaces (What is Spaces?)
Spaces Toggle
TXYZ.AI (What is TXYZ.AI?)
Related Papers

Recommenders and Search Tools

Link to Influence Flower
Influence Flower (What are Influence Flowers?)
Core recommender toggle
CORE Recommender (What is CORE?)
IArxiv recommender toggle
IArxiv Recommender (What is IArxiv?)
About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Discussion (0)

Sign in to join the discussion. Free account, 30 seconds — email code or GitHub.

Sign in →

No comments yet. Sign in and be the first to say something.

More from arXiv — Machine Learning