Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Approximate Bayesian computation”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

A neural-network-enhanced parameter-varying framework for multi-objective model predictive control applied to buildings

Management of the electrical grid is becoming more complex due to the increased penetration of alternative energy generation technologies and a broadening diversity of electric loads. This complexity creates challenges in balancing demand and generation that can increase the potential for grid instabilities. One effective way to address this issue is to leverage previously unexploited demand flexibility through advanced control strategies. In this work, we propose an advanced control method, called adaptive neural parameter-varying model predictive control (ANPV-MPC), to control the temperature and energy consumption of a building via its Heating, Ventilation, and Air Conditioning system. ANPV-MPC combines key ideas in parameter-varying control, adaptive control, and online learning strategies to bridge the gap between computationally efficient linear model predictive control and more accurate nonlinear model predictive control. The novelty in ANPV-MPC is the use of a physics-inspired Bayesian neural network to estimate the coefficients of the parameter-varying linear control model. The Bayesian neural network additionally provides uncertainty estimates, triggering online training to capture evolving building system conditions. We show that ANPV-MPC can approximate the building system dynamics with a 28.39% higher accuracy than traditional linear model predictive control, resulting in 36.23% better control performance without increasing complexity of the optimal control problem. ANPV-MPC also adapts in real time to previously unseen conditions using online learning, further improving its performance.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

Neural network ensembles and uncertainty estimation for predictions of inelastic mechanical deformation using a finite element method-neural network approach

The finite element method (FEM) is widely used to simulate a variety of physics phenomena. Approaches that integrate FEM with neural networks (NNs) are typically leveraged as an alternative to conducting expensive FEM simulations in order to reduce the computational cost without significantly sacrificing accuracy. However, these methods can produce biased predictions that deviate from those obtained with FEM, since these hybrid FEM-NN approaches rely on approximations trained using physically relevant quantities. In this work, an uncertainty estimation framework is introduced that leverages ensembles of Bayesian neural networks to produce diverse sets of predictions using a hybrid FEM-NN approach that approximates internal forces on a deforming solid body. The uncertainty estimator developed herein reliably infers upper bounds of bias/variance in the predictions for a wide range of interpolation and extrapolation cases using a three-element FEM-NN model of a bar undergoing plastic deformation. This proposed framework offers a powerful tool for assessing the reliability of physics-based surrogate models by establishing uncertainty estimates for predictions spanning a wide range of possible load cases.

42 ENGINEERING↗
DOE OSTI2025

Advancements in Constitutive Model Calibration: Leveraging the Power of Full‐Field DIC Measurements and In Situ Load Path Selection for Reliable Parameter Inference

Accurate material characterization and model calibration are essential for computationally supported high-consequence engineering decisions. Historically, characterization and calibration methods (1) use simplified test specimen geometries and global data, (2) cannot guarantee that sufficient characterization data are collected for a specific model of interest, (3) use deterministic methods that provide best-fit parameter values with no uncertainty quantification, and (4) are sequential, inflexible, and time-consuming. This work brings together several recent advancements into an improved workflow called interlaced characterization and calibration (ICC) that advances the state-of-the-art in constitutive model calibration. The ICC paradigm (1) employs tools to efficiently use full-field data to calibrate high-fidelity material models, (2) aligns the data needed with the data collected by adopting an optimal experimental design protocol, (3) quantifies parameter uncertainty through Bayesian inference and (4) incorporates these advancements into a quasi real-time feedback loop. The ICC framework is demonstrated here on the calibration of a material model using simulated full-field data for an aluminium cruciform specimen being deformed biaxially. The cruciform is actively driven through the myopically preferred load path using Bayesian optimal experimental design, which selects load steps that yield the maximum expected information gain (EIG). Principal component analysis (PCA) is performed on the model predictions of full-field displacements, and fast surrogate models are built to approximate the input-output relationships of the expensive finite element model. Furthermore, the tools developed and demonstrated here show that high-fidelity constitutive models can be efficiently and reliably calibrated with quantified uncertainty, thus supporting credible decision-making and potentially increasing the agility of solid mechanics modelling by enabling utilization of computational simulations at earlier stages of the design cycle.

Bayesian optimal experimental design↗
DOE OSTI2020

Fast matrix algebra for Bayesian model calibration

In Bayesian model calibration, evaluation of the likelihood function usually involves finding the inverse and determinant of a covariance matrix. When Markov Chain Monte Carlo (MCMC) methods are used to sample from the posterior, hundreds of thousands of likelihood evaluations may be required. In this paper, we demonstrate that the structure of the covariance matrix can be exploited, leading to substantial time savings in practice. Here, we also derive two simple equations for approximating the inverse of the covariance matrix in this setting, which can be computed in near-quadratic time. The practical implications of these strategies are demonstrated using a simple numerical case study and the "quack" R package. For a covariance matrix with 1000 rows, application of these strategies for a million likelihood evaluations leads to a speedup of roughly 4000 compared to the naive implementation

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Bayesian optimization to design a novel x-ray shaping device

In radiation therapy, x-ray dose must be precisely sculpted to the tumor, while simultaneously avoiding surrounding organs at risk. This requires modulation of x-ray intensity in space and/or time. Typically, this is achieved using a multi leaf collimator (MLC) - a complex mechatronic device comprising over one hundred individually powered tungsten ‘leaves’ that move in or out of the radiation field as required. Here, an all-electronic x-ray collimation concept with no moving parts is presented, termed “SPHINX”: Scanning Pencil-beam High-speed Intensity-modulated X-ray source. SPHINX utilizes a spatially distributed bremsstrahlung target and collimator array in conjunction with magnetic scanning of a high energy electron beam to generate a plurality of small x-ray “beamlets.” A simulation framework was developed in Topas Monte Carlo incorporating a phase space electron source, transport through user defined magnetic fields, bremsstrahlung x-ray production, transport through a SPHINX collimator, and dose in water. This framework was completely parametric, meaning a simulation could be built and run for any supplied geometric parameters. This functionality was coupled with Bayesian optimization to find the best parameter set based on an objective function which included terms to maximize dose rate for a user defined beamlet width while constraining inter-channel cross talk and electron contamination. Designs for beamlet widths of 5, 7, and 10 mm 2 were generated. Each optimization was run for 300 iterations and took approximately 40 h on a 24-core computer. For the optimized 7-mm model, a simulation of all beamlets in water was carried out including a linear scanning magnet calibration simulation. Finally, a back-of-envelope dose rate formalism was developed and used to estimate dose rate under various conditions. The optimized 5–, 7–, and 10-mm models had beamlet widths of 5.1 , 7.2 , and 10.1 mm 2 and dose rates of 3574, 6351, and 10 015 Gy/C, respectively. The reduction in dose rate for smaller beamlet widths is a result of both increased collimation and source occlusion. For the simulation of all beamlets in water, the scanning magnet calibration reduced the offset between the collimator channels and beam centroids from 2.9 ±1.9 mm to 0.01 ±0.03 mm. A slight reduction in dose rate of approximately 2% per degree of scanning angle was observed. Based on a back-of-envelope dose rate formalism, SPHINX in conjunction with next-generation linear accelerators has the potential to achieve substantially higher dose rates than conventional MLC-based delivery, with delivery of an intensity modulated 100 x 100 mm 2 field achievable in 0.9 to 10.6 s depending on the beamlet widths used. Bayesian optimization was coupled with Monte Carlo modeling to generate SPHINX geometries for various beamlet widths. A complete Monte Carlo simulation for one of these designs was developed, including electron beam transport of all beamlets through scanning magnets, x-ray production and collimation, and dose in water. These results demonstrate that SPHINX is a promising candidate for sculpting radiation dose with no moving parts, and has the potential to vastly improve both the speed and robustness of radiotherapy delivery. A multi-beam SPHINX system may be a candidate for delivering magavoltage FLASH RT in humans.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2025

Persistent Sampling: Enhancing the Efficiency of Sequential Monte Carlo

Sequential Monte Carlo (SMC) samplers are powerful tools for Bayesian inference but suffer from high computational costs due to their reliance on large particle ensembles for accurate estimates. We introduce persistent sampling (PS), an extension of SMC that systematically retains and reuses particles from all prior iterations to construct a growing, weighted ensemble. By leveraging multiple importance sampling and resampling from a mixture of historical distributions, PS mitigates the need for excessively large particle counts, directly addressing key limitations of SMC such as particle impoverishment and mode collapse. Crucially, PS achieves this without additional likelihood evaluations-weights for persistent particles are computed using cached likelihood values. This framework not only yields more accurate posterior approximations but also produces marginal likelihood estimates with significantly lower variance, enhancing reliability in model comparison. Furthermore, the persistent ensemble enables efficient adaptation of transition kernels by leveraging a larger, decorrelated particle pool. Experiments on high-dimensional Gaussian mixtures, hierarchical models, and non-convex targets demonstrate that PS consistently outperforms standard SMC and related variants, including recycled and waste-free SMC, achieving substantial reductions in mean squared error for posterior expectations and evidence estimates, all at reduced computational cost. PS thus establishes itself as a robust, scalable, and efficient alternative for complex Bayesian inference tasks.

Karamanis, Minas↗
DOE OSTI2019

Model Structural Inference Using Local Dynamic Operators

This paper focuses on the problem of quantifying the effects of model-structure uncertainty in the context of time-evolving dynamical systems. This is motivated by multi-model uncertainty in computer physics simulations: developers often make different modeling choices in numerical approximations and process simplifications, leading to different numerical codes that ostensibly represent the same underlying dynamics. We consider model-structure inference as a two-step methodology: the first step is to perform system identification on numerical codes for which it is possible to observe the full state; the second step is structural uncertainty quantification, in which the goal is to search candidate models "close" to the numerical code surrogates for those that best match a quantity of interest (QOI) from some empirical data sets. Here, we (1) define a discrete, local representation of the structure of a partial differential equation, which we refer to as the "local dynamical operator" (LDO); (2) identify model structure nonintrusively from numerical code output; (3) nonintrusively construct a reduced-order model (ROM) of the numerical model through POD-DEIM-Galerkin projection; (4) perturb the ROM dynamics to approximate the behavior of alternate model structures; and (5) apply Bayesian inference and energy conservation laws to calibrate a LDO to a given QOI. We demonstrate these techniques using the two-dimensional rotating shallow water equations as an example system.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Residual-based error correction for neural operator accelerated infinite-dimensional Bayesian inverse problems

We explore using neural operators, or neural network representations of nonlinear maps between function spaces, to accelerate infinite-dimensional Bayesian inverse problems (BIPs) with models governed by nonlinear parametric partial differential equations (PDEs). Neural operators have gained significant attention in recent years for their ability to approximate the parameter-to-solution maps defined by PDEs using as training data solutions of PDEs at a limited number of parameter samples. The computational cost of BIPs can be drastically reduced if the large number of PDE solves required for posterior characterization are replaced with evaluations of trained neural operators. However, reducing error in the resulting BIP solutions via reducing the approximation error of the neural operators in training can be challenging and unreliable. We provide an a priori error bound result that implies certain BIPs can be ill-conditioned to the approximation error of neural operators, thus leading to inaccessible accuracy requirements in training. To reliably deploy neural operators in BIPs, we consider a strategy for enhancing the performance of neural operators: correcting the prediction of a trained neural operator by solving a linear variational problem based on the PDE residual. We show that a trained neural operator with error correction can achieve a quadratic reduction of its approximation error, all while retaining substantial computational speedups of posterior sampling when models are governed by highly nonlinear PDEs. The strategy is applied to two numerical examples of BIPs based on a nonlinear reaction–diffusion problem and deformation of hyperelastic materials. We demonstrate that posterior representations of the two BIPs produced using trained neural operators are greatly and consistently enhanced by error correction.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Bayesian Monte-Carlo Evaluation Framework of Differential and Integral Data [Slides]

This presentation discusses the Bayesian Monte Carlo evaluation framework of differential and integral data, specifically in relation to two methods that are based on Bayes theorem, which assumes that all PDFs are normal (Gaussian) and that they use a linear approximation for IBEs. The presentation states that basic components of the MC evaluation framework include the computation of random MC ensemble from ENDF File 32, the simulation of IBEs and R-matrix cross section compared to experimental data, and the computation of weighted averages. It also states that the application to U-233 indicates deviation from the conventional linear approximation. In conclusion, evaluation framework will require MCMC method e.g., Metropolis-Hastings (M.-H.).

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2020

CheKiPEUQ Intro 1: Bayesian Parameter Estimation Considering Uncertainty or Error from both Experiments and Theory**

A common goal is extraction of physico-chemical parameter values such as pre-exponentials and activation energies from experiment. Ever increasing knowledge from experiments and computations is enabling semi-quantitative prior predictions of such values. When prior knowledge of physically realistic ranges is available, a method named Bayesian parameter estimation (BPE) enables more physically realistic parameter estimation relative to unsophisticated fitting by seeking the most probable value when considering together the uncertainties from prior knowledge, experimental data, and approximations in the model. An impediment to widespread use of BPE is a lack of understanding, training, and user-friendly software. Along with this invited publication, a general software package for BPE is being released that is user-friendly and that does not require understanding of the math behind the methodology. Overall, two previously unpublished catalysis science examples are provided along with considerations and guidelines for successful application of BPE. Following this work, BPE can become more widespread to enable extraction of physically meaningful parameter values.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2013

Multi-variate joint PDF for non-Gaussianities: exact formulation and generic approximations

We provide an exact expression for the multi-variate joint probability distribution function of non-Gaussian fields primordially arising from local transformations of a Gaussian field. This kind of non-Gaussianity is generated in many models of inflation. We apply our expression to the non-Gaussianity estimation from Cosmic Microwave Background maps and the halo mass function where we obtain analytical expressions. We also provide analytic approximations and their range of validity. For the Cosmic Microwave Background we give a fast way to compute the PDF which is valid up to more than 7σ for f{sub NL} values (both true and sampled) not ruled out by current observations, which consists of expressing the PDF as a combination of bispectrum and trispectrum of the temperature maps. The resulting expression is valid for any kind of non-Gaussianity and is not limited to the local type. The above results may serve as the basis for a fully Bayesian analysis of the non-Gaussianity parameter.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

A Gaussian process based surrogate approach for the optimization of cylindrical targets

Simulating direct-drive inertial confinement experiments presents significant computational challenges, both due to the complexity of the codes required for such simulations and the substantial computational expense associated with target design studies. Machine learning models, and in particular, surrogate models, offer a solution by replacing simulation results with a simplified approximation. In this study, we apply surrogate modeling and optimization techniques that are well established in the existing literature to one-dimensional simulation data of a new cylindrical target design containing deuterium–tritium fuel. These models predict yields without the need for expensive simulations. We find that Bayesian optimization with Gaussian process surrogates enhances sampling efficiency in low-dimensional design spaces but becomes less efficient as dimensionality increases. Nonetheless, optimization routines within two-dimensional and five-dimensional design spaces can identify designs that maximize yield, while also aligning with established physical intuition. Optimization routines, which ignore constraints on hydrodynamic instability growth, are shown to lead to unstable designs in 2D, resulting in yield loss. However, routines that utilize 1D simulations and impose constraints on the in-flight aspect ratio converge on novel cylindrical target designs that are stable against hydrodynamic instability growth in 2D and achieve high yield.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2016

Sparse-grid, reduced-basis Bayesian inversion: Nonaffine-parametric nonlinear equations

We extend the reduced basis (RB) accelerated Bayesian inversion methods for affine-parametric, linear operator equations which are considered in [16,17] to non-affine, nonlinear parametric operator equations. We generalize the analysis of sparsity of parametric forward solution maps in [20] and of Bayesian inversion in [48,49] to the fully discrete setting, including Petrov–Galerkin high-fidelity (“HiFi”) discretization of the forward maps. We develop adaptive, stochastic collocation based reduction methods for the efficient computation of reduced bases on the parametric solution manifold. The nonaffinity and nonlinearity with respect to (w.r.t.) the distributed, uncertain parameters and the unknown solution is collocated; specifically, by the so-called Empirical Interpolation Method (EIM). For the corresponding Bayesian inversion problems, computational efficiency is enhanced in two ways: first, expectations w.r.t. the posterior are computed by adaptive quadratures with dimension-independent convergence rates proposed in [49]; the present work generalizes [49] to account for the impact of the PG discretization in the forward maps on the convergence rates of the Quantities of Interest (QoI for short). Second, we propose to perform the Bayesian estimation only w.r.t. a parsimonious, RB approximation of the posterior density. Based on the approximation results in [49], the infinite-dimensional parametric, deterministic forward map and operator admit N-term RB and EIM approximations which converge at rates which depend only on the sparsity of the parametric forward map. In several numerical experiments, the proposed algorithms exhibit dimension-independent convergence rates which equal, at least, the currently known rate estimates for N-term approximation. We propose to accelerate Bayesian estimation by first offline construction of reduced basis surrogates of the Bayesian posterior density. The parsimonious surrogates can then be employed for online data assimilation and for Bayesian estimation. They also open a perspective for optimal experimental design.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2017

Stan : A Probabilistic Programming Language

Stan is a probabilistic programming language for specifying statistical models. A Stan program imperatively defines a log probability function over parameters conditioned on specified data and constants. As of version 2.14.0, Stan provides full Bayesian inference for continuous-variable models through Markov chain Monte Carlo methods such as the No-U-Turn sampler, an adaptive form of Hamiltonian Monte Carlo sampling. Penalized maximum likelihood estimates are calculated using optimization methods such as the limited memory Broyden-Fletcher-Goldfarb-Shanno algorithm. Stan is also a platform for computing log densities and their gradients and Hessians, which can be used in alternative algorithms such as variational Bayes, expectation propagation, and marginal inference using approximate integration. To this end, Stan is set up so that the densities, gradients, and Hessians, along with intermediate quantities of the algorithm such as acceptance probabilities, are easily accessible. Stan can also be called from the command line using the cmdstan package, through R using the rstan package, and through Python using the pystan package. All three interfaces support sampling and optimization-based inference with diagnostics and posterior analysis. rstan and pystan also provide access to log probabilities, gradients, Hessians, parameter transforms, and specialized plotting.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2013

Annealed Importance Sampling Reversible Jump MCMC algorithms

It will soon be 20 years since reversible jump Markov chain Monte Carlo (RJ-MCMC) algorithms have been proposed. They have significantly extended the scope of Markov chain Monte Carlo simulation methods, offering the promise to be able to routinely tackle transdimensional sampling problems, as encountered in Bayesian model selection problems for example, in a principled and flexible fashion. Their practical efficient implementation, however, still remains a challenge. A particular difficulty encountered in practice is in the choice of the dimension matching variables (both their nature and their distribution) and the reversible transformations which allow one to define the one-to-one mappings underpinning the design of these algorithms. Indeed, even seemingly sensible choices can lead to algorithms with very poor performance. The focus of this paper is the development and performance evaluation of a method, annealed importance sampling RJ-MCMC (aisRJ), which addresses this problem by mitigating the sensitivity of RJ-MCMC algorithms to the aforementioned poor design. As we shall see the algorithm can be understood as being an “exact approximation” of an idealized MCMC algorithm that would sample from the model probabilities directly in a model selection set-up. Such an idealized algorithm may have good theoretical convergence properties, but typically cannot be implemented, and our algorithms can approximate the performance of such idealized algorithms to an arbitrary degree while not introducing any bias for any degree of approximation. Our approach combines the dimension matching ideas of RJ-MCMC with annealed importance sampling and its Markov chain Monte Carlo implementation. We illustrate the performance of the algorithm with numerical simulations which indicate that, although the approach may at first appear computationally involved, it is in fact competitive.

annealed importance sampling↗
DOE OSTI2023

Generalized Bayesian Framework for Evaluation of Integral Benchmark Experiments [Slides]

This presentation is on generalized Bayesian framework for evaluation of integral benchmark experiments. This presentation starts off with assumptions and approximations used with Bayes Theorem. then an overview of approximations used by ORNL codes, and Generalized Bayesian Monto Carlo (GBMC). The presentation then details out a precise framework. This presentation then concludes with considerations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Bayesian, Multifidelity Operator Learning for Complex Engineering Systems–A Position Paper

Abstract Deep learning has significantly improved the state-of-the-art in computer vision and natural language processing, and holds great potential to design effective tools for predicting and simulating complex engineering systems. In particular, scientific machine learning seeks to apply the power of deep learning to scientific and engineering tasks, with operator learning (OL) emerging as a particularly effective tool. OL can approximate nonlinear operators arising in complex engineering systems, making it useful for simulating, designing, and controlling those systems. In this position paper, we provide a comprehensive overview of OL, including its potential applications to complex engineering domains. We cover three variations of OL approaches: deterministic OL for modeling nonautonomous systems, OL with uncertainty quantification (UQ) capabilities, and multifidelity OL. For each variation, we discuss drawbacks and potential applications to engineering, in addition to providing a detailed explanation. We also highlight how multifidelity OL approaches with UQ capabilities can be used to design, optimize, and control engineering systems. Finally, we outline some potential challenges for OL within the engineering domain.

Computer Science↗
DOE OSTI2022

Model-Form Epistemic Uncertainty Quantification for Modeling with Differential Equations: Application to Epidemiology

Modeling real-world phenomena to any degree of accuracy is a challenge that the scientific research community has navigated since its foundation. Lack of information and limited computational and observational resources necessitate modeling assumptions which, when invalid, lead to model-form error (MFE). The work reported herein explored a novel method to represent model-form uncertainty (MFU) that combines Bayesian statistics with the emerging field of universal differential equations (UDEs). The fundamental principle behind UDEs is simple: use known equational forms that govern a dynamical system when you have them; then incorporate data-driven approaches – in this case neural networks (NNs) – embedded within the governing equations to learn the interacting terms that were underrepresented. Utilizing epidemiology as our motivating exemplar, this report will highlight the challenges of modeling novel infectious diseases while introducing ways to incorporate NN approximations to MFE. Prior to embarking on a Bayesian calibration, we first explored methods to augment the standard (non-Bayesian) UDE training procedure to account for uncertainty and increase robustness of training. In addition, it is often the case that uncertainty in observations is significant; this may be due to randomness or lack of precision in the measurement process. This uncertainty typically manifests as “noisy” observations which deviate from a true underlying signal. To account for such variability, the NN approximation to MFE is endowed with a probabilistic representation and is updated using available observational data in a Bayesian framework. By representing the MFU explicitly and deploying an embedded, data-driven model, this approach enables an agile, expressive, and interpretable method for representing MFU. In this report we will provide evidence that Bayesian UDEs show promise as a novel framework for any science-based, data-driven MFU representation; while emphasizing that significant advances must be made in the calibration of Bayesian NNs to ensure a robust calibration procedure.

97 MATHEMATICS AND COMPUTING↗