Applied bifidelity material response model construction and uncertainty quantification with a sampling hypernetwork

Reese E. Jones, Cosmin Safta, Dan Bolintineau, Craig M. Hamel, Gianluca Geraci, Sharlotte Lb KramerarXiv 2026 · arXiv

TL;DR

This paper introduces a bifidelity Langevin sampling hypernetwork (LSHN) framework that fuses scarce high-fidelity (HF) data with abundant low-fidelity (LF) data to build accurate, probabilistic material response models. By learning a posterior distribution over model parameters rather than a single deterministic fit, the method provides robust uncertainty quantification (UQ) and improved predictive performance in data-limited regimes.

What Problem Does This Paper Address?

In engineering and material science, we often face a "data dilemma." High-fidelity data (like physical experiments) are accurate but expensive and sparse. Low-fidelity data (like simplified simulations) are cheap and abundant but often biased or missing key physical features.

Existing multifidelity methods often struggle to:

  1. Quantify Uncertainty: Providing a "best guess" isn't enough; we need to know how much to trust the model.
  2. Handle Non-linearity: Simple additive corrections between fidelities often fail when the relationship is complex.
  3. Scale: High-dimensional parameter spaces in neural networks make traditional Bayesian sampling (like MCMC) computationally prohibitive.

The authors aim to bridge these gaps by creating a framework that is both computationally efficient and physically interpretable.

Methods

The core of the approach is a Sampling Hypernetwork (SHN). Instead of training a neural network's weights directly, the authors train a "sampler" that generates an ensemble of weights representing the posterior distribution.

Key components include:

  • Y-shaped Data Model: A neural network architecture with a shared input-to-latent block. It branches into two heads: one for the LF response and one for the HF response (or the discrepancy between them). This allows the model to learn a shared representation of the underlying physics.
Figure 1: Data model: Y-shaped model exploiting the commonality of input and latent space. Input MLP: input X to latent ℓ(blue), high MLP: latent ℓto high-fidelity output ∆HI\LO (red), low MLP: latent ℓto low-fidelity output Y (orange). Note the number of layers in the component MLPs are notional.
  • Langevin Sampling (LS): The sampler uses Langevin dynamics—a stochastic differential equation—to explore the parameter space. To ensure the sampler actually converges, the authors introduce convex drift models (Symmetric Positive Definite and nonlinear convex architectures).
  • Algorithmic Enhancements: They employ staged training (training the LF branch first, then the HF), adaptive initialization of trajectories, and spectral reduction to manage the "curse of dimensionality" in the weight space.
Figure 2: Sampling hypernetwork. Only the sampler is trainable, the form of the data model is fixed and receives parameters from the sampler.

Datasets

The framework was validated on two primary cases:

  1. Synthetic Yeoh Model: An illustrative hyperelastic model where the HF version has five terms and the LF version has only two. This allowed for controlled sensitivity studies on data fractions and model complexity.
  2. 3D-Printed Metamaterial: A real-world engineering case using experimental data from silicone pads (HF) and Bonded Particle Method (BPM) simulations (LF). The experimental data showed abrupt stiffness changes (densification) that the LF simulations completely missed, providing a rigorous test for the model's "correction" capabilities.

Key Insights and Ideas

  • Shared Latent Space is Key: Fusing data at the latent level is more powerful than simple output-level corrections. It allows the model to "transfer" knowledge about the input space from the abundant LF data to the sparse HF regime.
  • Stability via Architecture: By forcing the "drift" (the force pulling the sampler toward the data) to be convex, the authors guarantee that the Langevin trajectories reach a stable steady state. This makes the UQ much more reliable.
  • Conditioning Improves Convergence: Training in stages—where the HF parameters are learned conditionally on the already-trained LF parameters—was found to be more robust than "monolithic" training of everything at once.
  • Efficiency vs. Fidelity: While Hamiltonian Monte Carlo (HMC) is often considered the "gold standard" for sampling, the authors show that Langevin sampling is orders of magnitude faster for these high-dimensional problems while still providing high-quality uncertainty estimates.

Key Results

  • Accuracy: The LSHN achieved significantly lower Root Mean Square Error (RMSE) on HF predictions compared to standard single-fidelity or simple additive discrepancy models.
  • Robust UQ: The model produced tight, physically consistent uncertainty bands. In the metamaterial case, the uncertainty correctly captured the experimental response even where it diverged sharply from the LF simulation.
  • Data Efficiency: The transition to high-quality predictions occurred at a high-fidelity data fraction of approximately 0.1, demonstrating that the model effectively leverages LF data to reduce the need for expensive HF samples.
  • Computational Speed: In the Yeoh study, the LS method was roughly 5-6 times faster in wall-clock time and used ~100x fewer gradient evaluations than a comparable HMC scheme.

Limitations and Future Work

The authors acknowledge that their current drift models implicitly assume a unimodal posterior (one "peak" of likely parameters). While the predictive output of the model often remains well-behaved, the underlying weight space of neural networks is notoriously multimodal.

Future work aims to:

  • Extend the framework to handle multimodal posteriors.
  • Incorporate more advanced sparsification and pruning techniques to make the models even more efficient for real-time applications.
  • Generalize the "bifidelity" (two levels) approach to a general multifidelity (N levels) setting.

Summary updated

Abstract

Multifidelity modeling offers a practical route to accurate prediction and uncertainty quantification when high-fidelity data are scarce but lower-fidelity data are comparatively abundant. This work develops a bifidelity Langevin sampling hypernetwork framework that constructs probabilistic neu- ral response models by learning a posterior distribution over model parameters rather than a single deterministic fit. The method combines a flexible shared-latent data representation for low- and high-fidelity responses, enabling parameter sharing and transfer learning between the fidelities. We introduce several methodological enhancements to improve the robustness and efficiency of this ap- proach, including stability-promoting drift models, staged and conditional training strategies, adap- tive initialization of Langevin trajectories, and training procedures designed to better exploit corre- lations between fidelity levels. These additions improve convergence behavior, reduce the sampling effort required to obtain representative posterior ensembles, and provide more reliable predictive uncertainty in data-limited regimes. The resulting framework makes more effective use of available multifidelity data while preserving interpretability through the learned posterior structure, yielding improved predictive performance, better uncertainty characterization, and a more stable workflow for constructing uncertainty-aware surrogate models. The method is demonstrated on experimental, high-fidelity simulation and illustrative synthetic data.
BibTeX
@misc{jones2026applied,
  author = {Reese E. Jones and Cosmin Safta and Dan Bolintineau and Craig M. Hamel and Gianluca Geraci and Sharlotte LB Kramer},
  title = {{Applied bifidelity material response model construction and uncertainty quantification with a sampling hypernetwork}},
  year = {2026},
  eprint = {2611.10429},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.10429},
}
Figure