Search NASA⌕ Search

SEARCH · Search NASA

Results for “Bayesian methods”

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 1,045 records · Page 58
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

Combining Push-Forward Measures and Bayes' Rule to Construct Consistent Solutions to Stochastic Inverse Problems

We formulate, and present a numerical method for solving, an inverse problem for inferring parameters of a deterministic model from stochastic observational data on quantities of interest. The solution, given as a probability measure, is derived using a Bayesian updating approach for measurable maps that finds a posterior probability measure, that when propagated through the deterministic model produces a push-forward measure that exactly matches the observed probability measure on the data. Our approach for finding such posterior measures, which we call consistent Bayesian inference or push-forward based inference, is simple and only requires the computation of the push-forward probability measure induced by the combination of a prior probability measure and the deterministic model. We establish existence and uniqueness of observation-consistent posteriors and present both stability and error analyses. We also discuss the relationships between consistent Bayesian inference, classical/statistical Bayesian inference, and a recently developed measure-theoretic approach for inference. Finally, analytical and numerical results are presented to highlight certain properties of the consistent Bayesian approach and the differences between this approach and the two aforementioned alternatives for inference.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Bayesian Static Parameter Estimation for Partially Observed Diffusions via Multilevel Monte Carlo

In this article we consider static Bayesian parameter estimation for partially observed diffusions that are discretely observed. We work under the assumption that one must resort to discretizing the underlying diffusion process, for instance, using the Euler--Maruyama method. Given this assumption, we show how one can use Markov chain Monte Carlo (MCMC) and particularly particle MCMC [C. Andrieu, A. Doucet, and R. Holenstein, J. R. Stat. Soc. Ser. B Stat. Methodol., 72 (2010), 269--342] to implement a new approximation of the multilevel (ML) Monte Carlo (MC) collapsing sum identity. Our approach comprises constructing an approximate coupling of the posterior density of the joint distribution over parameter and hidden variables at two different discretization levels and then correcting by an importance sampling method. The variance of the weights are independent of the length of the observed data set. The utility of such a method is that, for a prescribed level of mean square error, the cost of this MLMC method is provably less than i.i.d. sampling from the posterior associated to the most precise discretization. However the method here comprises using only known and efficient simulation methodologies. Finally, the theoretical results are illustrated by inference of the parameters of two prototypical processes given noisy partial observations of the process: the first is an Ornstein--Uhlenbeck process and the second is a more general Langevin equation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Overhead longwave infrared hyperspectral material identification using radiometric models

Material detection algorithms used in hyperspectral data processing are computationally efficient but can produce relatively high numbers of false positives. Material identification performed as a secondary processing step on detected pixels can help separate true and false positives. This paper presents a material identification processing chain for longwave infrared hyperspectral data of solid materials collected from airborne platforms. The algorithms utilize unwhitened radiance data and an iterative algorithm that determines the temperature, humidity, and ozone of the atmospheric profile. Pixel unmixing is done using constrained linear regression and Bayesian Information Criteria for model selection. The resulting product includes an optimal atmospheric profile and full radiance material model that includes material temperature, abundance values, and several fit statistics. A logistic regression method utilizing all model parameters to improve identification is also presented. This paper details the processing chain and provides justification for the algorithms used. Several examples are provided using modeled data at different noise levels.

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

Transitional Markov Chain Monte Carlo Sampler in UQTk

Transitional Markov Chain Monte Carlo (TMCMC) is a variant of a class of Markov Chain Monte Carlo algorithms known as tempering-based methods. In this report, the implementation of TMCMC in the Uncertainty Quantification Toolkit is investigated through the sampling of high-dimensional distributions, multi-modal distributions, and nonlinear manifolds. Furthermore, the Bayesian model evidence estimates obtained from TMCMC are tested on problems with known analytical solutions and shown to provide consistent results.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Accurate and Timely Forecasts of Geologic Carbon Storage using Machine Learning Methods

Carbon capture and storage is one strategy to reduce greenhouse gas emissions. One approach to storing the captured CO2 is to inject it into deep saline aquifers. However, dynamics of the injected CO2 plume is uncertain and the potential for leakage back to the atmosphere must be assessed. Thus, accurate and timely forecasts of CO2 storage via real-time measurements integration becomes very crucial. This study proposes a learning-based, inverse-free prediction method that can accurately and rapidly forecast CO2 movement and distribution with uncertainty quantification based on limited simulation and observation data. The machine learning techniques include dimension reduction, multivariate data analysis, and Bayesian learning. The outcome is expected to provide CO2 storage site operators with an effective tool for real-time decision making.

Lu, Dan↗
DOE OSTI2026

Non -degenerate marginal-likelihood calibration with application to quantum characterization

Here, we propose a marginal likelihood strategy within the Kennedy-O’Hagan (KOH) Bayesian framework, where a Gaussian process (GP) models the discrepancy between a physical system and its simulator. Our approach introduces a novel marginalized likelihood by integrating out the degenerate eigenspace of the covariance matrix, rather than approximating the original likelihood. Unlike approximation methods that compromise accuracy for computational efficiency, our method defines an exact likelihood—distinct from the original but preserving all relevant information. This formulation achieves computational efficiency and stability, even for large datasets where the covariance matrix nears degeneracy. Applied to the characterization of a superconducting quantum device at Lawrence Livermore National Laboratory, the approach enhances the predictive accuracy of the Lindblad master equations for modeling Ramsey measurement data by effectively quantifying uncertainties consistent with the quantum data.

general physics↗
DOE OSTI2023

Pushing the limits of detectability: mixed dark matter from strong gravitational lenses

One of the frontiers for advancing what is known about dark matter lies in using strong gravitational lenses to characterize the population of the smallest dark matter haloes. There is a large volume of information in strong gravitational lens images – the question we seek to answer is to what extent we can refine this information. To this end, we forecast the detectability of a mixed warm and cold dark matter scenario using the anomalous flux ratio method from strong gravitational lensed images. The halo mass function of the mixed dark matter scenario is suppressed relative to cold dark matter but still predicts numerous low-mass dark matter haloes relative to warm dark matter. Since the strong lensing signal receives a contribution from a range of dark matter halo masses and since the signal is sensitive to the specific configuration of dark matter haloes, not just the halo mass function, degeneracies between different forms of suppression in the halo mass function, relative to cold dark matter, can arise. Here, we find that, with a set of lenses with different configurations of the main deflector and hence different sensitivities to different mass ranges of the halo mass function, the different forms of suppression of the halo mass function between the warm dark matter model and the mixed dark matter model can be distinguished with 40 lenses with Bayesian odds of 30:1.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Enhancing approximate modular Bayesian inference by emulating the conditional posterior

In modular Bayesian analyses, complex models are composed of distinct modules, each representing different aspects of the data or prior information. In this context, fully Bayesian approaches can sometimes lead to undesirable feedback between modules, compromising the integrity of the inference. The “cut-distribution” prevents unwanted influence between modules by “cutting” feedback. The direct sampling (DS) algorithm is standard practice for approximating the cut-distribution, but it can be computationally intensive, especially when the number of imputations required is large. An enhanced method is proposed, the Emulating the Conditional Posterior (ECP) algorithm, which leverages emulation to increase the number of imputations. Through numerical experiment it is demonstrated that the ECP algorithm outperforms the traditional DS approach in terms of accuracy and computational efficiency, particularly when resources are constrained. Here, it is also shown how the DS algorithm can be improved using ideas from design of experiments. Some practical recommendations are given for algorithm choice in modular Bayesian analyses.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Exploring physics of ferroelectric domain walls via Bayesian analysis of atomically resolved STEM data

The physics of ferroelectric domain walls is explored using the Bayesian inference analysis of atomically resolved STEM data. We demonstrate that domain wall profile shapes are ultimately sensitive to the nature of the order parameter in the material, including the functional form of Ginzburg-Landau-Devonshire expansion, and numerical value of the corresponding parameters. The preexisting materials knowledge naturally folds in the Bayesian framework in the form of prior distributions, with the different order parameters forming competing (or hierarchical) models. Here, we explore the physics of the ferroelectric domain walls in BiFeO 3 using this method, and derive the posterior estimates of relevant parameters. More generally, this inference approach both allows learning materials physics from experimental data with associated uncertainty quantification, and establishing guidelines for instrumental development answering questions on what resolution and information limits are necessary for reliable observation of specific physical mechanisms of interest.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2024

Optimization on Manifolds via Graph Gaussian Processes

This paper integrates manifold learning techniques within a Gaussian process upper confidence bound algorithm to optimize an objective function on a manifold. Our approach is motivated by applications where a full representation of the manifold is not available and querying the objective is expensive. We rely on a point cloud of manifold samples to define a graph Gaussian process surrogate model for the objective. Query points are sequentially chosen using the posterior distribution of the surrogate model given all previous queries. We establish regret bounds in terms of the number of queries and the size of the point cloud. Several numerical examples complement the theory and illustrate the performance of our method.

Bayesian optimization↗
DOE OSTI2021

Reliability Prediction using FMEA, FTA, and Related Techniques [Slides]

Summary: We presented a reliability analysis framework. We made point estimates of reliability using reliability block diagrams, fault trees, success trees and estimates with uncertainty using expert elicitation, Monte Carlo simulation, Bayesian analysis. Expert elicitation of failure modes and probabilities is labor-intensive, but critical. Bayesian analysis updates information from expert elicitation with data from reliability and aging tests (aging/compatibility data are needed to estimate lower-bound reliabilities at end of life). Estimation by more than one method helps insure consistency and accuracy.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Constraining physical models at gigabar pressures

High-energy-density (HED) experiments in convergent geometry are able to test physical models at pressures beyond hundreds of millions of atmospheres. The measurements from these experiments are generally highly integrated and require unique analysis techniques to procure quantitative infor mation. This work describes a methodology to constrain the physics in convergent HED experiments by adapting the methods common to many other fields of physics. As an example, a mechanical model of an imploding shell is constrained by data from a thin-shelled direct-drive exploding-pusher experiment on the OMEGA Laser System using Bayesian inference, resulting in the reconstruction of the shell dynamics and energy transfer during the implosion. The model is tested by analyzing synthetic data from a 1-D hydrodynamics code and is sampled using a Markov chain Monte Carlo to generate the posterior distributions of the model parameters. As a result, the goal of this work is to demonstrate a general methodology that can be used to draw conclusions from a wide variety of HED experiments.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2023

Proactive Frequency Stability Scheme via Bayesian Filters and Synchrophasors

Underfrequency (UF) load shedding schemes are traditionally implemented in two ways: One approach is based on manual load shedding, with system operators requesting loads to be shed ahead of anticipated stressful operating conditions. Manual load shedding is usually done through phone calls. The second method is automatic load shedding via underfrequency relays. Using static static settings, these schemes can be designed to operate in stages and drop previously identified loads. The main limitation of traditional load shedding schemes is that they are reactive and leave little room for optimized corrective actions. This work presents a proactive and automatic underfrequency load shedding solution for power systems. Measurements are captured via phasor measurement units (PMUs) at relatively low sampling rates of 30 Hz. These measurements are then processed by particle filters who predict the future state of the system's frequency. Based on these predictions excess load is determined and shed. Comparative case studies are performed in simulated environments. Easy-to-implement models, without hard-to-derive parameters, highlight potential aspects for real-life implementation.

Paramo, Gian↗
DOE OSTI2020

Bayesian Structural Time Series for Behind-the-Meter Photovoltaic Disaggregation: Preprint

Distributed photovoltaic (PV) generation often occurs ``behind the meter": a grid operator can only observe the net load, which is the sum of the gross load and distributed PV generation. This lack of observability poses a challenge to system operation at both bulk level and distribution level. The lack of real-time or near-future disaggregated estimates of gross load and PV generation will lead to over scheduling of energy production and regulation reserves, reliability constraints violations, wear and tear of controller devices, and potentially cascading failures of a system. In this paper we propose the use of a Bayesian Structural Time Series (BSTS) model with local solar irradiance measurements to disaggregate the summed PV generation and gross load signals at a downstream measurement site. BSTSs are a highly expressive model class that blends classic time series models with the powerful Bayesian state space estimation framework. Disaggregation is done probabilistically, which automatically quantifies the uncertainties of the estimated PV generation and gross load consumption. Depending on the data availability in real-time, it can be used to disaggragate PV and gross load at customer site, or can be used at the feeder level. In this paper, we focus on solving the problem at feeder level. We compare the performance of a BSTS model as well as a handful of state-of-the-art methods on a Pecan Street AMI dataset, using the National Solar Radiation Database (NSRDB) to estimate local irradiance.

Bayesian structural time series↗
DOE OSTI2016

Comparison of statistical and deterministic frameworks of uncertainty quantification

Two different approaches to the prediction problem are compared employing a realistic example— combustion of natural gas—with 102 uncertain parameters and 76 quantities of interests. One approach, termed bound-to-bound data collaboration (abbreviated to B2B), deploys semidefinite programming algorithms where the initial bounds on unknowns are combined with initial bounds of experimental data to produce new uncertainty bounds for the unknowns that are consistent with the data and, finally, deterministic uncertainty bounds for prediction in new settings. The other approach is statistical and Bayesian, referred to as BCP (for Bayesian calibration and prediction). It places prior distributions on the unknown parameters and on the parameters of the measurement error distributions and produces posterior distributions for model parameters and posterior distributions for model predictions in new settings. The predictions from the two approaches are consistent; a very large degree of overlap exists between B2B bounds and the support of the BCP predictive distribution. Interpretation and comparison of the results is closely connected with assumptions made about the model and experimental data and how they are used in both settings. As a result, the principal conclusion is that use of both methods protects against possible violations of assumptions in the BCP approach and conservative specifications and predictions using B2B.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Cluster characterization in atom probe tomography: Machine learning using multiple summary functions

In this work, we develop a machine learning-based method to characterize intracluster concentration (ρ c ), background concentration (ρ b ), clustering radius (r̄), and radius dispersity (δ r ) in simulated atom probe tomography data using multiple spatial statistics summary functions to train a Bayesian regularized neural network. Here, we build upon previous work that utilized Ripley’s K-function by incorporating additional features from nearest-neighbor spatial statistics summary functions to better characterize concentration-based metrics. The addition of nearest-neighbor based features allows for highly accurate estimates of ρ c and ρ b , both with 90% of the predictions within 4.0% of the real value; the root-mean-square errors are reduced by 81.5% and 92.8% from predictions using only K-function based features, respectively. Additionally, including these nearest-neighbor based features improves the ability to differentiate between r̄ and δ r .

36 MATERIALS SCIENCE↗
DOE OSTI2021

Bayesian Learning of Adatom Interactions from Atomically Resolved Imaging Data

Atomic structures and adatom geometries of surfaces encode information about the thermodynamics and kinetics of the processes that lead to their formation, and which can be captured by a generative physical model. In this work, we develop a workflow based on a machine-learning-based analysis of scanning tunneling microscopy images to reconstruct the atomic and adatom positions, and a Bayesian optimization procedure to minimize statistical distance between the chosen physical models and experimental observations. We optimize the parameters of a 2- and 3-parameter Ising model describing surface ordering and use the derived generative model to make predictions across the parameter space. For concentration dependence, we compare the predicted morphologies at different adatom concentrations with the dissimilar regions on the sample surfaces that serendipitously had different adatom concentrations. The proposed workflow can be used to reconstruct the thermodynamic models and associated uncertainties from the experimental observations of materials microstructures. The code used in the manuscript is available at https://github.com/saimani5/Adatom_interactions.

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

Dynamical Sketching for Enhanced Communication Efficiency in Federated Learning

Federated learning (FL) has revolutionized distributed machine learning by enabling collaborative model training without sharing local data. However, communication efficiency and privacy guarantees remain significant challenges. This paper introduces a dynamic sketching mechanism in FL, optimizing the trade-off between communication efficiency and model accuracy. By dynamically selecting the sketch matrix size, our approach adapts to the evolving characteristics of the data and the model, ensuring optimal performance across diverse scenarios. We leverage Bayesian optimization to systematically tune the sketch parameters, achieving an effective balance between resource efficiency and model performance. Experimental results on the MNIST dataset using a convolutional neural network (CNN) architecture validate the proposed method's efficiency and scalability. Our dynamic sketching approach significantly outperforms fixed-size sketching techniques, achieving higher compression ratios (up to 62x) and providing better privacy guarantees while maintaining high model accuracy. These findings highlight the robustness and versatility of our approach and make it a valuable solution for privacy-preserving, communication-efficient federated learning.

Afrose, Sharmin [ORNL]↗