Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “probabilistic inference”

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Adaptive mitigation of time-varying quantum noise

Current quantum computers suffer from non-stationary noise channels with high error rates, which undermines their reliability and reproducibility. We propose a Bayesian inference based adaptive algorithm that can learn and mitigate quantum noise in response to changing channel conditions. Our study emphasizes the need for dynamic inference of critical channel parameters to improve program accuracy. We use the Dirichlet distribution to model the stochasticity of the Pauli channel. This allows us to perform Bayesian inference, which can improve the performance of probabilistic error cancellation (PEC) under time-varying noise. Our work demonstrates the importance of characterizing and mitigating temporal variations in quantum noise, which is crucial for developing more accurate and reliable quantum technologies. Our results demonstrate that Bayesian PEC can outperform non-adaptive approaches by a factor of 4.5x when measured using Hellinger distance from the ideal distribution.

Dasgupta, Samudra↗
DOE OSTI2024

Assessing and benchmarking the fidelity of posterior inference methods for astrophysics data analysis

In this era of large and complex astronomical survey data, interpreting, validating, and comparing inference techniques becomes increasingly difficult. This is particularly critical for emerging inference methods like Simulation-Based Inference (SBI), which offer significant speedup potential and posterior modeling flexibility, especially when deep learning is incorporated. We present a study to assess and compare the performance and uncertainty prediction capability of Bayesian inference algorithms – from traditional MCMC sampling of analytic functions to deep learning-enabled SBI. We focus on testing the capacity of hierarchical inference modeling in those scenarios. Before we extend this study to cosmology, we first use astrophysical simulation data to ensure interpretability. We demonstrate a probabilistic programming implementation of hierarchical and non-hierarchical Bayesian inference using simulations derived from the DeepBench software library, a benchmarking tool developed by our group that generates simple and controllable astrophysical objects from first principles. This study will enable astronomers and physicists to harness the inference potential of these methods with confidence.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2020

Probabilistic Power Flow Based on a Gaussian Process Emulator

In this letter, a novel Gaussian process emulator is proposed, for the first time, to conduct the probabilistic power-flow calculation. Based on Bayesian inference, a Gaussian process emulator is trained and served as a nonparametric, reduced-order model of the nonlinear power-flow model. This emulator has allowed us to evaluate the time-consuming power-flow solver at the sampled values with a negligible computational cost. The simulations reveal the excellent performance of this method.

42 ENGINEERING↗
DOE OSTI2019

Adversarial uncertainty quantification in physics-informed neural networks

Here, we introduce a deep learning framework for quantifying and propagating uncertainty in systems governed by non-linear differential equations using physics-informed neural networks. Specifically, we employ latent variable models to construct probabilistic representations for the system states, and put forth an adversarial inference procedure for training them on data, while constraining their predictions to satisfy given physical laws expressed by partial differential equations. Such physics-informed constraints provide a regularization mechanism for effectively training deep generative models as surrogates of physical systems in which the cost of data acquisition is high, and training data-sets are typically small. This provides a flexible framework for characterizing uncertainty in the outputs of physical systems due to randomness in their inputs or noise in their observations that entirely bypasses the need for repeatedly sampling expensive experiments or numerical simulators. Moreover, we demonstrate the effectiveness of our approach through a series of examples involving uncertainty propagation in non-linear conservation laws, and the discovery of constitutive laws for flow through porous media directly from noisy data.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

The Gaia DR2 parallax zero-point: hierarchical modelling of red clump stars

ABSTRACT The systematic offset of Gaia parallaxes has been widely reported with Gaia’s second data release, and it is expected to persist in future Gaia data. In order to use Gaia parallaxes to infer distances to high precision, we develop a hierarchical probabilistic model to determine the Gaia parallax zero-point offset along with the calibration of an empirical model for luminosity of red clump stars by combining astrometric and photometric measurements. Using a cross-matched sample of red clump stars from the Apache Point Observatory Galactic Evolution Experiment and Gaia Data Release 2 (DR2), we report the parallax zero-point offset in DR2 to be $\varpi _0 = -48 \pm 1\,\mu \text{as}$. We infer the red clump absolute magnitude to be −1.622 ± 0.004 in Ks, 0.435 ± 0.004 in G, −1.019 ± 0.004 in J, and −1.516 ± 0.004 in H. The intrinsic scatter of the red clump is ∼0.09 mag in J, H, and Ks, or ∼ 0.12 mag in G. We tailor our models to accommodate more complex analyses such as investigating the variations of the parallax zero-point with each source’s observed magnitude, observed colour, and sky position. In particular, we find fluctuations of the zero-point across the sky to be of order or less than a few 10s of $\mu \text{as}$.

Chan, Victor C.↗
DOE OSTI2021

System risk quantification and decision making support using functional modeling and dynamic Bayesian network

Risk-informed decision-making requires a probabilistic assessment of the likelihood of success of control action, given the system status. This paper presents a systematic state transition modeling approach integrating dynamic probabilistic risk assessment with a decision-making process using a dynamic Bayesian network (DBN) coupled with functional modeling. A functional model designed with multilevel flow modeling (MFM) technique was used to build a system state structure inferred by energy, mass, and information flow so that one can verify the developed model with respect to system functionality. The MFM model represents the causal relationship among the nodes, which captures the structure of process parameters and control units. Each node may have multiple possible states, and the DBN structured by the MFM model represents the time-domain transitions among the defined states. Furthermore, the MFM-DBN integrated state transition modeling is a white-box approach that allows one to draw the system's risk profile by updating the system states and supports the decisions probabilistically with physical inference. An example of a simple heating system has been used to illustrate this process, including decision-making support based on quantitative risk profile. For demonstrating its applicability to a complex system operational decision making, a case study of station blackout accident scenario leading to the seal loss of coolant accident in a nuclear power plant is presented. The proposed approach effectively provided the risk profile along time for each option so that the operators can make the best decision, which minimizes the plant risk.

42 ENGINEERING↗
DOE OSTI2024

A flexible class of priors for orthonormal matrices with basis function-specific structure

Statistical modeling of high-dimensional matrix-valued data motivates the use of a low-rank representation that simultaneously summarizes key characteristics of the data and enables dimension reduction. Low-rank representations commonly factor the original data into the product of orthonormal basis functions and weights, where each basis function represents an independent feature of the data. However, the basis functions in these factorizations are typically computed using algorithmic methods that cannot quantify uncertainty or account for basis function correlation structure a priori. While there exist Bayesian methods that allow for a common correlation structure across basis functions, empirical examples motivate the need for basis function-specific dependence structure. We propose a prior distribution for orthonormal matrices that can explicitly model basis function-specific structure. The prior is used within a general probabilistic model for singular value decomposition to conduct posterior inference on the basis functions while accounting for measurement error and fixed effects. We discuss how the prior specification can be used for various scenarios and demonstrate favorable model properties through synthetic data examples. Finally, we apply our method to two-meter air temperature data from the Pacific Northwest, enhancing our understanding of the Earth system’s internal variability.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Reducing model error using optimized galaxy selection: weak lensing cluster mass estimation

Galaxy clusters are one of the most powerful probes to study extensions of General Relativity and the Standard Cosmological Model. Upcoming surveys like the Vera Rubin Observatory’s Legacy Survey of Space and Time are expected to revolutionise the field, by enabling the analysis of cluster samples of unprecedented size and quality. To reach this era of high-precision cluster cosmology, the mitigation of sources of systematic error is crucial. A particularly important challenge is bias in cluster mass measurements induced by the mismodelling of photometric redshift estimates of source galaxies. This work proposes a method to optimise the source sample selection in cluster weak lensing analyses drawn from wide-field survey lensing catalogs to reduce the bias on reconstructed cluster masses. We use a combinatorial optimisation scheme and methods from variational inference to select galaxies in latent space to produce a probabilistic galaxy source sample catalog for highly accurate cluster mass estimation. We show that our method reduces the critical surface mass density Σ crit relative modelling bias on the 60-70% level, while maintaining up to 90% of galaxies. We highlight that our methodology has applications beyond cluster mass estimation as an approach to jointly combine galaxy selection and model inference under sources of systematics.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

PROVABGS: The Probabilistic Stellar Mass Function of the BGS One-percent Survey

We present the probabilistic stellar mass function (pSMF) of galaxies in the DESI Bright Galaxy Survey (BGS), observed during the One-percent Survey. The One-percent Survey was one of DESI's survey validation programs conducted from 2021 April to May, before the start of the main survey. It used the same target selection and similar observing strategy as the main survey and successfully observed the spectra and redshifts of 143,017 galaxies in the r < 19.5 magnitude-limited BGS Bright sample and 95,499 galaxies in the fainter surface-brightness- and color-selected BGS Faint sample over z < 0.6. We derive pSMFs from posteriors of stellar mass, M*, inferred from DESI photometry and spectroscopy using the Hahn et al. PRObabilistic Value-Added BGS (PROVABGS) Bayesian spectral energy distribution modeling framework. We use a hierarchical population inference framework that statistically and rigorously propagates the M* uncertainties. Furthermore, we include correction weights that account for the selection effects and incompleteness of the BGS observations. We present the redshift evolution of the pSMF in BGS, as well as the pSMFs of star-forming and quiescent galaxies classified using average specific star formation rates from PROVABGS. Overall, the pSMFs show good agreement with previous stellar mass function measurements in the literature. Our pSMFs showcase the potential and statistical power of BGS, which in its main survey will observe >100 × more galaxies. Moreover, we present the statistical framework for subsequent population statistics measurements using BGS, which will characterize the global galaxy population and scaling relations at low redshifts with unprecedented precision.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

Continuous-Time Models for Longitudinal Data

This software is used to estimate a probabilistic continuous-time model from data. The models capture nonlinear associations between variables that change over time. They can be used to infer future values of variables. These tools were used in the manuscript entitled "Continuous-Time Probabilistic Models for Longitudinal Electronic Health Records."

Kaplan, AlanD↗
DOE OSTI2015

Past and present cosmic structure in the SDSS DR7 main sample

We present a chrono-cosmography project, aiming at the inference of the four dimensional formation history of the observed large scale structure from its origin to the present epoch. To do so, we perform a full-scale Bayesian analysis of the northern galactic cap of the Sloan Digital Sky Survey (SDSS) Data Release 7 main galaxy sample, relying on a fully probabilistic, physical model of the non-linearly evolved density field. Besides inferring initial conditions from observations, our methodology naturally and accurately reconstructs non-linear features at the present epoch, such as walls and filaments, corresponding to high-order correlation functions generated by late-time structure formation. Our inference framework self-consistently accounts for typical observational systematic and statistical uncertainties such as noise, survey geometry and selection effects. We further account for luminosity dependent galaxy biases and automatic noise calibration within a fully Bayesian approach. As a result, this analysis provides highly-detailed and accurate reconstructions of the present density field on scales larger than ∼ 3 Mpc/h, constrained by SDSS observations. This approach also leads to the first quantitative inference of plausible formation histories of the dynamic large scale structure underlying the observed galaxy distribution. The results described in this work constitute the first full Bayesian non-linear analysis of the cosmic large scale structure with the demonstrated capability of uncertainty quantification. Some of these results will be made publicly available along with this work. The level of detail of inferred results and the high degree of control on observational uncertainties pave the path towards high precision chrono-cosmography, the subject of simultaneously studying the dynamics and the morphology of the inhomogeneous Universe.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Data-driven projection pursuit adaptation of polynomial chaos expansions for dependent high-dimensional parameters

Uncertainty quantification (UQ) and inference involving a large number of parameters are valuable tools for problems associated with heterogeneous and non-stationary behaviors. The difficulty with these problems is exacerbated when these parameters are statistically dependent requiring statistical characterization over joint measures. Probabilistic modeling methodologies stand as effective tools in the realms of UQ and inference. Among these, polynomial chaos expansions (PCE), when adapted to low-dimensional quantities of interest (QoI), provide effective yet accurate approximations for these QoI in terms of an adapted orthogonal basis. These adaptation techniques have been cast as projection pursuits in Gaussian Hilbert space in what has been referred to as a projection pursuit adaptation (PPA) by Xiaoshu Zeng and Roger Ghanem (2023). The PPA method efficiently identifies an optimal low-dimensional space for representing the QoI and simultaneously evaluates an optimal PCE within that space. The quality of this approximation clearly depends on the size of the training dataset, which is typically a function of the adapted reduced dimension. Here, the complexity of the problem is thus mediated by the complexity of the low-dimensional quantity of interest and not the complexity of the high-dimensional parameter space.

Data-driven↗
DOE OSTI2026

Uncertainty quantification and reliability assessment for intermodal freight transportation

Intermodal freight optimization models support cost-effective, low-emission, and timely goods movement by coordinating trucks, rail, and barges. These models determine optimal flows, routing, and modal switches while respecting infrastructure and operational constraints. However, their real-world utility is often undermined by pervasive uncertainties-such as fluctuating transportation costs and emissions, variable terminal capacities, and uncertain freight demand-that distort key performance outcomes, including total system cost, carbon footprint, and transit time reliability. This study presents a structured framework for quantifying uncertainty in intermodal freight transportation (IFT) optimization. The framework evaluates how input uncertainty affects system performance and reliability, a critical need for ensuring that model-based decisions remain robust under real-world variability, especially amid volatile fuel prices, shifting demand, and growing disruptions. It integrates three complementary methods: (1) Sobol-based global sensitivity analysis to identify influential parameters affecting cost, emissions, and transit time, (2) Monte Carlo-based capacity perturbation analysis to assess robustness under probabilistic facility disruptions, and (3) Monte Carlo filtering with Bayesian inference to detect threshold-based performance vulnerabilities. The results highlight diesel truck unit cost as the dominant driver of variability. To improve system resilience, planners should prioritize uncertainty in fuel-related parameters when designing intermodal strategies.

Intermodal freight transportation↗
DOE OSTI2025

Enhancing Gaussian Process Surrogates for Optimization and Posterior Approximation via Random Exploration

This paper proposes novel noise-free Bayesian optimization strategies that rely on a random exploration step to enhance the accuracy of Gaussian process surrogate models. The new algorithms retain the ease of implementation of the classical GP-UCB algorithm, but the additional random exploration step accelerates their convergence, nearly achieving the optimal convergence rate. Furthermore, to facilitate Bayesian inference with intractable likelihoods, we propose to utilize optimization iterates for maximum a posteriori estimation to build a Gaussian process surrogate model for the unnormalized log-posterior density. We provide bounds for the Hellinger distance between the true and the approximate posterior distributions in terms of the number of design points. We demonstrate the effectiveness of our Bayesian optimization algorithms in nonconvex benchmark objective functions, in a machine learning hyperparameter tuning problem, and in a black-box engineering design problem. The effectiveness of our posterior approximation approach is demonstrated in two Bayesian inference problems for parameters of dynamical systems.

Bayesian inference↗
DOE OSTI2024

Bayesian Tensor Decompositions for Scalable Supervised Learning of Scientific Data (Final Report)

In this document we highlight the detailed accomplishments and progress that we have made in this period. This progress seeks to address the three main objectives to provide new algorithms for quantifying uncertainty in low-multilinear-rank models and to leverage them for data analysis. These include: (1) develop probabilistic models for low-multilinear-rank functions; (2) develop a suite of Bayesian learning approaches to learn the probabilistic models from data; (3) apply the techniques on challenging problems arising in DOE-relevant applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

In-Situ Inference: Bringing Advanced Data Science Into Exascale Simulations

As simulations generate ever-increasing amounts of data, there are correspondingly richer opportunities for analysis and scientific discovery - discoveries that will be missed if most of the data must be discarded before it is analyzed. Because future exascale architectures will be increasingly storage-limited, it will not be possible to save the vast majority of simulation data for later analysis, requiring analysis to occur “in-situ” within the simulation. However, existing in-situ data analysis frameworks provide little or no support for one of the most sophisticated forms of data science: probabilistic statistical modeling or uncertainty quantification (UQ), and the accompanying challenge of inference - fitting those statistical models to massive simulation output. Our goal is to develop the fundamental statistical algorithms and computer science needed to perform statistical inference in-situ (in HPC simulations) to the full stream of data those simulations generate.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

PyApprox: A software package for sensitivity analysis, Bayesian inference, optimal experimental design, and multi-fidelity uncertainty quantification and surrogate modeling

PyApprox is a Python-based one-stop-shop for probabilistic analysis of numerical models such as those used in the earth, environmental and engineering sciences. Easy to use and extendable tools are provided for constructing surrogates, sensitivity analysis, Bayesian inference, experimental design, and forward uncertainty quantification. The algorithms implemented represent a wide range of methods for model analysis developed over the past two decades, including recent advances in multi-fidelity approaches that use multiple model discretizations and/or simplified physics to significantly reduce the computational cost of various types of analyses. An extensive set of Benchmarks from the literature is also provided to facilitate the easy comparison of new or existing algorithms for a wide range of model analyses. Here, this paper introduces PyApprox and its various features, and presents results demonstrating the utility of PyApprox on a benchmark problem modeling the advection of a tracer in groundwater.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2016

Sythesis of MCMC and Belief Propagation

Markov Chain Monte Carlo (MCMC) and Belief Propagation (BP) are the most popular algorithms for computational inference in Graphical Models (GM). In principle, MCMC is an exact probabilistic method which, however, often suffers from exponentially slow mixing. In contrast, BP is a deterministic method, which is typically fast, empirically very successful, however in general lacking control of accuracy over loopy graphs. In this paper, we introduce MCMC algorithms correcting the approximation error of BP, i.e., we provide a way to compensate for BP errors via a consecutive BP-aware MCMC. Our framework is based on the Loop Calculus (LC) approach which allows to express the BP error as a sum of weighted generalized loops. Although the full series is computationally intractable, it is known that a truncated series, summing up all 2-regular loops, is computable in polynomial-time for planar pair-wise binary GMs and it also provides a highly accurate approximation empirically. Motivated by this, we first propose a polynomial-time approximation MCMC scheme for the truncated series of general (non-planar) pair-wise binary models. Our main idea here is to use the Worm algorithm, known to provide fast mixing in other (related) problems, and then design an appropriate rejection scheme to sample 2-regular loops. Furthermore, we also design an efficient rejection-free MCMC scheme for approximating the full series. The main novelty underlying our design is in utilizing the concept of cycle basis, which provides an efficient decomposition of the generalized loops. In essence, the proposed MCMC schemes run on transformed GM built upon the non-trivial BP solution, and our experiments show that this synthesis of BP and MCMC outperforms both direct MCMC and bare BP schemes.

97 MATHEMATICS AND COMPUTING↗