Search arXivSearch

arXiv · 2608.12603

Hierarchical Bayesian Calibration with Bayesian Committee Machine

Abstract

Calibrating computational models to experimental data is a core task in applied statistics, especially in scientific domains, where physical experiments are costly and simulations play a central role in design and inference. Motivated by uncertainty quantification challenges in particle accelerator experiments, we develop and evaluate a Hierarchical Bayesian Calibration framework. In contrast to standard Bayesian calibration, certain inputs - such as beam injection amplitude - must be estimated separately for each experiment. We adopt the Kennedy-O'Hagan formulation and extend it with a hierarchical prior structure to model the distribution of experiment-specific calibration parameters, thus borrowing strength and improving generalisation across repeated experiments. A key methodological challenge arises from the need to evaluate a large number of forward simulations, which renders conventional Markov chain Monte Carlo approaches computationally prohibitive. To address this, we leverage the Bayesian Committee Machine as a scalable modelling strategy for Gaussian Process emulators. The BCM provides a principled divide-and-conquer approach, enabling parallel inference and reducing computational cost without requiring problem-specific tuning of the emulator approximation. Posterior sampling is performed using the No-U-Turn Sampler, supported by automatic differentiation in Julia, which removes the need for analytic gradient derivation and facilitates flexible model specification. We assess the proposed framework using established benchmark problems and simulated data from the Argonne Wakefield Accelerator. The results demonstrate substantial computational savings and robust calibration performance, highlighting the applicability of the method to large-scale scientific modelling problems.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sebastian Heinekamp, David M. Higdon, Andreas Adelmann. 2026-08-12. Hierarchical Bayesian Calibration with Bayesian Committee Machine. https://arxiv.org/abs/2608.12603

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fast inversion of the generalized Fisher transformation of correlation matrices

The generalized Fisher transformation maps a non-singular correlation matrix to an unconstrained real vector through the off-diagonal elements of its matrix logarithm. Evaluating its inverse is a computational bottleneck in dynamic correlation and multivariate volatility models. We develop a fast inversion algorithm by characterizing the unknown diagonal as the minimizer of a smooth, strictly convex, and coercive objective. An explicit Hessian and global spectral bounds identify the standard fixed-point iteration as a quasi-Newton method and explain why it can converge slowly near singularity. Every fixed-point step decreases the objective, and the iteration converges from every starting point. These results motivate GFT-FP+N, a hybrid of fixed-point and matrix-free Newton steps that never forms the Jacobian. In benchmarks with up to 1,000 replications per design and dimensions up to 800, GFT-FP+N reduces computation time by up to a factor of forty-five relative to the fixed-point iteration and converged in every replication, including on designs where Broyden's method almost always fails. Julia and R packages are provided.

stat.CO

Exact Simulation of Diffusions via Brownian Bridge Range Reconstruction

We develop an exact simulation algorithm for scalar diffusion paths and diffusion bridges when the Poisson potential is unbounded in both tails. The method reconstructs the realized range of a Brownian bridge proposal by sampling its maximum and location, together with the maxima and locations of the two adjacent restricted Brownian meanders. Conditional on this finite information, the remaining path decomposes into four conditionally independent interval-constrained Brownian bridges, which can be sampled exactly at the Poisson times required by the rejection test. In contrast to constructions based on an enclosing range layer, the proposed representation retains the exact extrema and their locations. Our algorithm returns an exact finite-dimensional skeleton without time-discretization error and permits exact post-acceptance refinement at arbitrary finite collections of times. Numerical experiments validate the resulting finite-dimensional laws and identify the restricted-meander extremum simulation as the principal computational cost in the nonlinear example.

stat.CO

Wasserstein mixing of a systematic-scan random rotation sampler

We study the mixing time of a systematic-scan analogue of Kac's walk that was proposed as a fast surrogate for Haar-distributed orthogonal matrices in randomized high-dimensional algorithms and was conjectured to approach Haar measure after only logarithmically many sweeps. We show that this conjectured speed-up does not occur for convergence of the full matrix law to Haar measure in Frobenius Wasserstein distance. At fixed normalized accuracy, the mixing time lies between order $n/\log n$ and order $n$ sweeps; at fixed absolute Frobenius accuracy, the corresponding bounds are between order $n$ and order $n\log n$. More strongly, below the scale $n/\log n$, the normalized Wasserstein distance remains asymptotically at its extremal value. We also show that the output law is singular with respect to Haar measure for fewer than $n/2$ sweeps. Thus the sampler may provide effective application-specific randomization without exhibiting the much faster full-Haar mixing.

stat.CO