Hierarchical Bayesian Quadrature

• URL: http://arxiv.org/abs/2607.10793v1
• Date: Sun, 12 Jul 2026 15:01:59 GMT
• Title: Hierarchical Bayesian Quadrature
• Abstract summary: We develop an adaptively growing, tree-based partition of the integration domain into local stationary models.<n>Our method recombines the local integral estimates through a hierarchy of GP conditioning.<n>It achieves substantial gains over standard Bayesian Quadrature on nonstationary integrands while matching its performance on stationary ones.
• Score: 19.643213436347754
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Numerical integration is a cornerstone of various scientific computing applications, such as engineering simulations and model evidence computations in probabilistic machine learning. Bayesian Quadrature uses Gaussian process surrogates that explicitly encode structural assumptions about the integrand to obtain integral estimates with quantified uncertainty. These surrogates are predominantly based on stationary covariance functions, which results in model misspecification for integrands exhibiting nonstationary behavior. We tackle this issue through an adaptively growing, tree-based partition of the integration domain into local stationary models. Our method recombines the local integral estimates through a hierarchy of GP conditioning that reintroduces cross-subdomain correlations, while model selection criteria control the tree growth to avoid unnecessary partitioning. The resulting algorithm is simple, requires no MCMC, and adapts its evaluation budget to local integrand complexity. On benchmark integration problems and a model evidence computation for an epidemiological model, Hierarchical Bayesian Quadrature achieves substantial gains over standard Bayesian Quadrature on nonstationary integrands while matching its performance on stationary ones.

Related papers

• Generalized Score Matching for Parameter Estimation on Convex Domains [13.954816561132942]
  We derive the generalized score matching objective on a convex subset of $mathbbRd$.<n>We show how classical score matching as well as domain-adapted variants for non-negative data arise naturally within the proposed framework.<n>Our derivation sheds new light on the scope and applicability of generalized score matching in various problem settings.
  arXiv  Detail & Related papers  (2026-09-10T13:23:41Z)
• Symbolic Density Estimation for Discrete Distributions [5.337523703846813]
  We introduce symbolic density estimation (SDE), an unsupervised framework that automatically recovers closed-form probability mass functions.<n>Our method integrates domain-specific structural priors with evolutionary search and a validity-aware inference stage.<n>A real data application shows that it identifies concise and interpretable mixture models that improve goodness-of-fit over standard models.
  arXiv  Detail & Related papers  (2026-05-20T23:22:21Z)
• Noise Titration: Exact Distributional Benchmarking for Probabilistic Time Series Forecasting [1.5939955861266883]
  We propose a paradigm shift toward interventionist, exact-statistical benchmarking.<n>We transform forecasting from a black-box sequence matching game into an exact distributional inference task.<n>We find that state-of-the-art zero-shot models behave consistently with the context-parroting mechanism.
  arXiv  Detail & Related papers  (2026-03-23T17:14:11Z)
• Supervised Learning of Random Neural Architectures Structured by Latent Random Fields on Compact Boundaryless Multiply-Connected Manifolds [0.0]
  This paper introduces a new probabilistic framework for supervised learning in neural systems.<n>It is designed to model complex, uncertain random outputs whose outputs are strongly non-Gaussian given deterministic inputs.<n>The goal is to establish a novel conceptual and mathematical framework in which neural systems are realizations of a geometry-aware, field-driven generative process.
  arXiv  Detail & Related papers  (2025-12-11T08:17:12Z)
• Effective Method for Inverse Ising Problem under Missing Observations in Restricted Boltzmann Machines [0.0]
  Boltzmann machines (RBMs) are energy-based models analogous to the Ising model.<n>In this study, we propose a approximation framework for these expectations in the practical inverse Ising problems.<n>We demonstrate that the proposed method effectively and accurately tunes the model parameters in comparison to the conventional method.
  arXiv  Detail & Related papers  (2025-04-08T03:39:56Z)
• Generalization Bounds of Surrogate Policies for Combinatorial Optimization Problems [53.03951222945921]
  We analyze smoothed (perturbed) policies, adding controlled random perturbations to the direction used by the linear oracle.<n>Our main contribution is a generalization bound that decomposes the excess risk into perturbation bias, statistical estimation error, and optimization error.<n>We illustrate the scope of the results on applications such as vehicle scheduling, highlighting how smoothing enables both tractable training and controlled generalization.
  arXiv  Detail & Related papers  (2024-07-24T12:00:30Z)
• Polynomial Chaos Surrogate Construction for Random Fields with Parametric Uncertainty [0.0]
  Surrogate models provide a means of circumventing the high computational expense of complex models. We develop a PCE surrogate on a joint space of intrinsic and parametric uncertainty, enabled by Rosenblatt. We then take advantage of closed-form solutions for computing PCE Sobol indices to perform a global sensitivity analysis of the model.
  arXiv  Detail & Related papers  (2023-11-01T14:41:54Z)
• Learning to Bound Counterfactual Inference in Structural Causal Models from Observational and Randomised Data [64.96984404868411]
  We derive a likelihood characterisation for the overall data that leads us to extend a previous EM-based algorithm. The new algorithm learns to approximate the (unidentifiability) region of model parameters from such mixed data sources. It delivers interval approximations to counterfactual results, which collapse to points in the identifiable case.
  arXiv  Detail & Related papers  (2022-12-06T12:42:11Z)
• Distributed Bayesian Learning of Dynamic States [65.7870637855531]
  The proposed algorithm is a distributed Bayesian filtering task for finite-state hidden Markov models. It can be used for sequential state estimation, as well as for modeling opinion formation over social networks under dynamic environments.
  arXiv  Detail & Related papers  (2022-12-05T19:40:17Z)
• Numerically Stable Sparse Gaussian Processes via Minimum Separation using Cover Trees [57.67528738886731]
  We study the numerical stability of scalable sparse approximations based on inducing points. For low-dimensional tasks such as geospatial modeling, we propose an automated method for computing inducing points satisfying these conditions.
  arXiv  Detail & Related papers  (2022-10-14T15:20:17Z)
• Jointly Modeling and Clustering Tensors in High Dimensions [6.072664839782975]
  We consider the problem of jointly benchmarking and clustering of tensors. We propose an efficient high-maximization algorithm that converges geometrically to a neighborhood that is within statistical precision.
  arXiv  Detail & Related papers  (2021-04-15T21:06:16Z)
• Identification of Probability weighted ARX models with arbitrary domains [75.91002178647165]
  PieceWise Affine models guarantees universal approximation, local linearity and equivalence to other classes of hybrid system. In this work, we focus on the identification of PieceWise Auto Regressive with eXogenous input models with arbitrary regions (NPWARX) The architecture is conceived following the Mixture of Expert concept, developed within the machine learning field.
  arXiv  Detail & Related papers  (2020-09-29T12:50:33Z)
• On dissipative symplectic integration with applications to gradient-based optimization [77.34726150561087]
  We propose a geometric framework in which discretizations can be realized systematically. We show that a generalization of symplectic to nonconservative and in particular dissipative Hamiltonian systems is able to preserve rates of convergence up to a controlled error.
  arXiv  Detail & Related papers  (2020-04-15T00:36:49Z)

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.