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

• URL: http://arxiv.org/abs/2609.14262v1
• Date: Sun, 13 Sep 2026 03:52:00 GMT
• Title: Bayesian optimization with kernel ensembles and disagreement-based acquisition for source localization and acoustic inversion
• Abstract summary: Joint source localization and geoacoustic inversion requires optimizing an objective built from an expensive normal mode propagation model.<n>We use a weighted ensemble of GPs with different kernel families to adapt to the observed objective without committing to one kernel in advance.<n>Experiments on simulated and measured SWellEx-96 data show that the resulting method achieves the lowest mean final objective.
• Score: 12.760068476185504
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Bayesian Optimization with Gaussian Processes to Accelerate Stationary Point Searches [0.0]
  We present a unified Bayesian Optimization view of minimization, single point saddle searches, and double ended saddle searches through a unified six-step surrogate loop.<n>The framework uses Gaussian process regression with derivative observations, inverse-distance kernels, and active learning.<n>Accompanying Rust code demonstrates that all applications use the exact same Bayesian optimization loop, bridging the gap between theoretical formulation and practical execution.
  arXiv  Detail & Related papers  (2026-03-11T17:20:28Z)
• Local Entropy Search over Descent Sequences for Bayesian Optimization [48.7994415668802]
  A practical alternative is to iteratively refine the neighborhood of an initial design using local optimization methods such as gradient descent.<n>We propose local entropy search (LES), a Bayesian optimization paradigm that explicitly targets the solutions reachable by the descent sequences.
  arXiv  Detail & Related papers  (2025-11-24T15:52:17Z)
• BOOST: Bayesian Optimization with Optimal Kernel and Acquisition Function Selection Technique [1.0499611180329804]
  We propose BOOST, a novel framework that automates the selection of kernel-acquisition pairs.<n>BOOST predicts the performance of various kernel-acquisition pairs and identifies the most promising pair before committing to expensive evaluations.
  arXiv  Detail & Related papers  (2025-08-04T12:08:12Z)
• Adaptive Bayesian Optimization for Robust Identification of Stochastic Dynamical Systems [4.0148499400442095]
  This paper deals with the identification of linear derivation systems, where the unknowns include system coefficients and noise variances.<n>A sample-efficient global optimization method based on Bayesian optimization is proposed.<n>Experiments show that the EGP-based BO consistently outperforms MLE via steady-state filtering and expectation-maximization.
  arXiv  Detail & Related papers  (2025-03-09T01:38:21Z)
• Sample-efficient Bayesian Optimisation Using Known Invariances [56.34916328814857]
  We show that vanilla and constrained BO algorithms are inefficient when optimising invariant objectives. We derive a bound on the maximum information gain of these invariant kernels. We use our method to design a current drive system for a nuclear fusion reactor, finding a high-performance solution.
  arXiv  Detail & Related papers  (2024-10-22T12:51:46Z)
• Learning Regions of Interest for Bayesian Optimization with Adaptive Level-Set Estimation [84.0621253654014]
  We propose a framework, called BALLET, which adaptively filters for a high-confidence region of interest. We show theoretically that BALLET can efficiently shrink the search space, and can exhibit a tighter regret bound than standard BO.
  arXiv  Detail & Related papers  (2023-07-25T09:45:47Z)
• Tree ensemble kernels for Bayesian optimization with known constraints over mixed-feature spaces [54.58348769621782]
  Tree ensembles can be well-suited for black-box optimization tasks such as algorithm tuning and neural architecture search. Two well-known challenges in using tree ensembles for black-box optimization are (i) effectively quantifying model uncertainty for exploration and (ii) optimizing over the piece-wise constant acquisition function. Our framework performs as well as state-of-the-art methods for unconstrained black-box optimization over continuous/discrete features and outperforms competing methods for problems combining mixed-variable feature spaces and known input constraints.
  arXiv  Detail & Related papers  (2022-07-02T16:59:37Z)
• Relaxed Gaussian process interpolation: a goal-oriented approach to Bayesian optimization [0.0]
  This work presents a new procedure for obtaining predictive distributions in the context of Gaussian process (GP) modeling.<n>The method called relaxed Gaussian process (reGP) provides better predictive distributions in ranges of interest.<n>It can be viewed as a goal-oriented method and becomes particularly interesting in Bayesian optimization.
  arXiv  Detail & Related papers  (2022-06-07T06:26:46Z)
• Surrogate modeling for Bayesian optimization beyond a single Gaussian process [62.294228304646516]
  We propose a novel Bayesian surrogate model to balance exploration with exploitation of the search space. To endow function sampling with scalability, random feature-based kernel approximation is leveraged per GP model. To further establish convergence of the proposed EGP-TS to the global optimum, analysis is conducted based on the notion of Bayesian regret.
  arXiv  Detail & Related papers  (2022-05-27T16:43:10Z)
• Trusted-Maximizers Entropy Search for Efficient Bayesian Optimization [39.824086260578646]
  This paper presents a novel trusted-maximizers entropy search (TES) acquisition function. It measures how much an input contributes to the information gain on a query over a finite set of trusted maximizers.
  arXiv  Detail & Related papers  (2021-07-30T07:25:07Z)
• High Probability Complexity Bounds for Non-Smooth Stochastic Optimization with Heavy-Tailed Noise [51.31435087414348]
  It is essential to theoretically guarantee that algorithms provide small objective residual with high probability. Existing methods for non-smooth convex optimization have complexity bounds with dependence on confidence level. We propose novel stepsize rules for two methods with gradient clipping.
  arXiv  Detail & Related papers  (2021-06-10T17:54:21Z)
• Stochastic Optimization of Areas Under Precision-Recall Curves with Provable Convergence [66.83161885378192]
  Area under ROC (AUROC) and precision-recall curves (AUPRC) are common metrics for evaluating classification performance for imbalanced problems. We propose a technical method to optimize AUPRC for deep learning.
  arXiv  Detail & Related papers  (2021-04-18T06:22:21Z)
• Global Optimization of Gaussian processes [52.77024349608834]
  We propose a reduced-space formulation with trained Gaussian processes trained on few data points. The approach also leads to significantly smaller and computationally cheaper sub solver for lower bounding. In total, we reduce time convergence by orders of orders of the proposed method.
  arXiv  Detail & Related papers  (2020-05-21T20:59:11Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.