Search NASA⌕ Search

SEARCH · Search NASA

Results for “Bayesian belief”

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.

52 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Inter-Domain Fusion for Enhanced Intrusion Detection in Power Systems: An Evidence Theoretic and Meta-Heuristic Approach

False alerts due to misconfigured or compromised intrusion detection systems (IDS) in industrial control system (ICS) networks can lead to severe economic and operational damage. However, research using deep learning to reduce false alerts often requires the physical and cyber sensor data to be trustworthy. Implicit trust is a major problem for artificial intelligence or machine learning (AI/ML) in cyber-physical system (CPS) security, because when these solutions are most urgently needed is also when they are most at risk (e.g., during an attack). To address this, the Inter-Domain Evidence theoretic Approach for Inference (IDEA-I) is proposed that reframes the detection problem as how to make good decisions given uncertainty. Specifically, an evidence theoretic approach leveraging Dempster–Shafer (DS) combination rules and their variants is proposed for reducing false alerts. A multi-hypothesis mass function model is designed that leverages probability scores obtained from supervised-learning classifiers. Using this model, a location-cum-domain-based fusion framework is proposed to evaluate the detector’s performance using disjunctive, conjunctive, and cautious conjunctive rules. The approach is demonstrated in a cyber-physical power system testbed, and the classifiers are trained with datasets from Man-In-The-Middle attack emulation in a large-scale synthetic electric grid. For evaluating the performance, we consider plausibility, belief, pignistic, and general Bayesian theorem-based metrics as decision functions. To improve the performance, a multi-objective-based genetic algorithm is proposed for feature selection considering the decision metrics as the fitness function. Finally, we present a software application to evaluate the DS fusion approaches with different parameters and architectures.

42 ENGINEERING↗
DOE OSTI2020

Parsimonious Inference Information-Theoretic Foundations for a Complete Theory of Machine Learning (CIS-LDRD Project 218313 Final Technical Report)

This work examines how we may cast machine learning within a complete Bayesian framework to quantify and suppress explanatory complexity from first principles. Our investigation into both the philosophy and mathematics of rational belief leads us to emphasize the critical role of Bayesian inference in learning well-justified predictions within a rigorous and complete extended logic. The Bayesian framework allows us to coherently account for evidence in the learned plausibility of potential explanations. As an extended logic, the Bayesian paradigm regards probability as a notion of degrees of truth. In order to satisfy critical properties of probability as a coherent measure, as well as maintain consistency with binary propositional logic, we arrive at Bayes' Theorem as the only justifiable mechanism to update our beliefs to account for empiracle evidence. Yet, in the machine learning paradigm, where explanations are unconstrained algorithmic abstractions, we arrive at a critical challenge: Bayesian inference requires prior belief. Conventional approaches fail to yield a consistent framework in which we could compare prior plausibility among the infinities of potential choices in learning architectures. The difficulty of articulating well-justified prior belief over abstract models is the provinence of memorization in traditional machine learning training practices. This becomes exceptionally problematic in the context of limited datasets, when we wish to learn justifiable predictions from only a small amount of data.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Analysis and optimization of seismic monitoring networks with Bayesian optimal experimental design

SUMMARY Monitoring networks increasingly aim to assimilate data from a large number of diverse sensors covering many sensing modalities. Bayesian optimal experimental design (OED) seeks to identify data, sensor configurations or experiments which can optimally reduce uncertainty and hence increase the performance of a monitoring network. Information theory guides OED by formulating the choice of experiment or sensor placement as an optimization problem that maximizes the expected information gain (EIG) about quantities of interest given prior knowledge and models of expected observation data. Therefore, within the context of seismo-acoustic monitoring, we can use Bayesian OED to configure sensor networks by choosing sensor locations, types and fidelity in order to improve our ability to identify and locate seismic sources. In this work, we develop the framework necessary to use Bayesian OED to optimize a sensor network’s ability to locate seismic events from arrival time data of detected seismic phases at the regional-scale. This framework requires five elements: (i) A likelihood function that describes the distribution of detection and traveltime data from the sensor network, (ii) A prior distribution that describes a priori belief about seismic events, (iii) A Bayesian solver that uses a prior and likelihood to identify the posterior distribution of seismic events given the data, (iv) An algorithm to compute EIG about seismic events over a data set of hypothetical prior events, (v) An optimizer that finds a sensor network which maximizes EIG. Once we have developed this framework, we explore many relevant questions to monitoring such as: how to trade off sensor fidelity and earth model uncertainty; how sensor types, number and locations influence uncertainty; and how prior models and constraints influence sensor placement.

58 GEOSCIENCES↗
DOE OSTI2022

Mass Detection for Heavy-Duty Vehicles using Gaussian Belief Propagation

Predicting vehicle mass is critical to accurately estimate energy use and emissions of commercial trucks. However, data from vehicle telematics is often not at sufficient temporal resolution or accuracy for use in model-based detection methods. In this work, a new statistical mass prediction technique is described for heavy-duty vehicles that incorporates the use Gaussian Belief Propagation (GBP) for probabilistic inference. Similar to Bayesian inference models, the GBP model typically requires less labeled training data than other contemporary machine learning techniques. First, a factor graph is constructed, and a set of Gaussian belief nodes with associated means and variances are fitted to the training data. To better handle noisy input data, the GBP mass prediction model utilizes a k-nearest factors (kNF) algorithm for probabilistic inference on unseen testing data. The proposed method is compared with a classical weighted k-nearest neighbors (kNN) regressor. This statistical kNF-GBP model works even with low-quantity, low-quality initial training data, while being capable of realtime mass estimation. Unlike the kNN regressor, the GBP model produces a measure of uncertainty with its predictions. The proposed method is validated using curve-sampled driving data collected from multiple cloud-connected Class 8 regional haul diesel trucks. Both the kNN regressor and the kNF-GBP mass prediction model were able to predict payload mass with coefficients of determination above 0.97 with minimal data preprocessing.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2022

A Bayesian View on the Dr. Evil Scenario

Abstract In Defeating Dr. Evil with Self-Locating Belief , Adam Elga proposes and defends a principle of indifference for self-locating beliefs: if an individual is confident that his world contains more than one individual who is in a state subjectively indistinguishable from his own, then he should assign equal credences to the hypotheses that he is any one of these individuals. Through a sequence of thought experiments, Elga in effect claims that he can derive the credence function that should apply in such situations, thus justifying his principle of indifference. Here we argue, using a Bayesian approach, that Elga’s reasoning is circular: in analyzing the third of his thought experiments, he uses an assertion that is justifiable only if one assumes, from the start, the principle of indifference that he is attempting to justify. We agree with Elga that the assumption of equal credences is a very reasonable principle, in the absence of any reason to assign unequal credences, but we do not agree that the equality of credences can be so derived.

Azhar, Feraz↗
DOE OSTI2020

Milling stability identification using Bayesian machine learning

This paper describes automated identification of the milling stability boundary using Bayesian machine learning and experiments. The Bayesian machine learning process begins with the user’s initial beliefs about milling stability. This “prior” is a distribution that uses all available information, which may be based only on experience or may be informed by physics-based model predictions. Experiments are then completed to update this prior by calculating the “posterior,” a modified probabilistic description of the milling stability limit based on the new information. The approach is demonstrated and results are presented for both numerical and experimental cases.

Karandikar, Jaydeep↗
NASA NTRS2015

Data Applicability of Heritage and New Hardware For Launch Vehicle Reliability Models

Bayesian reliability requires the development of a prior distribution to represent degree of belief about the value of a parameter (such as a component's failure rate) before system specific data become available from testing or operations. Generic failure data are often provided in reliability databases as point estimates (mean or median). A component's failure rate is considered a random variable where all possible values are represented by a probability distribution. The applicability of the generic data source is a significant source of uncertainty that affects the spread of the distribution. This presentation discusses heuristic guidelines for quantifying uncertainty due to generic data applicability when developing prior distributions mainly from reliability predictions.

Al Hassan, Mohammad↗
DOE OSTI2022

A Review of Bayesian Networks for Spatial Data

We report Bayesian networks are a popular class of multivariate probabilistic models as they allow for the translation of prior beliefs about conditional dependencies between variables to be easily encoded into their model structure. Due to their widespread usage, they are often applied to spatial data for inferring properties of the systems under study and also generating predictions for how these systems may behave in the future. We review published research on methodologies for representing spatial data with Bayesian networks and also summarize the application areas for which Bayesian networks are employed in the modeling of spatial data. We find that a wide variety of perspectives are taken, including a GIS-centric focus on efficiently generating geospatial predictions, a statistical focus on rigorously constructing graphical models controlling for spatial correlation, as well as a range of problem-specific heuristics for mitigating the effects of spatial correlation and dependency arising in spatial data analysis. Special attention is also paid to potential future directions for integration of Bayesian networks with spatial processes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Physics-informed Bayesian machine learning case study: Integral blade rotors

This paper provides a physics-informed Bayesian machine learning (PIBML) description and case study. The PIBML approach applies three physics-based models to establish the initial beliefs before testing to determine the probability of milling stability (or prior). These include: receptance coupling substructure analysis (RCSA) prediction for the tool tip frequency response functions; finite element software prediction of the mechanistic force model coefficients; and a spindle speed-dependent power law model for process damping. Testing was then performed to identify optimal stable machining conditions using an expected improvement in material removal rate criterion. The prior probability of stability was updated using the test results to determine the posterior probability of stability. The test results were compared to the parameter recommendations provided by the endmill manufacturer. A demonstration integral blade rotor was machined at the optimal stable machining conditions for 304 stainless steel and 6061-T6 aluminum. Finally, the disagreement between manufacturer recommendations and milling performance in both materials tested emphasizes the need for broad implementation of PIBML approaches to increase machining productivity and efficiency.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Open World Dempster-Shafer Theory/The Transferable Belief Model with Intervals: A Practitioner's Guide to DST and TBM

Dempster-Shafer theory (DST) is a mathematical framework that allows for uncertainty or ignorance to be quantified and included when making predictions from evidence. This is in contrast to Bayesian theory, which does not allow for any quantification of ignorance. The framework is described in great detail in [7]. DST is particularly useful for problems where the inclusion of additional evidence (for example, data from another sensor) could lead to a different conclusion. Thus, it is a useful data fusion method, especially in applications not suited to maximum likelihood or maximum a posteriori estimations due to limited samples or incomplete prior knowledge.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Dynamic Bayesian Networks for Fault Prognosis

A dynamic Bayesian Network (DBN)-based fault prognosis framework is proposed in this study to predict the future fault probabilities of gradual faults. The proposed framework utilizes the trend in prediction error generated from data driven forecasting models to estimate the future fault beliefs. The accuracy and scalability of the proposed method is evaluated using the data from a Modelica-based virtual testbed. Overall, the developed framework demonstrates good potential in estimating future fault probabilities of gradual faults.

Pradhan, Ojas↗
DOE OSTI2020

S -factor and scattering-parameter extractions from ${}^{3}\mathrm{He}+{}^{4}\mathrm{He}{ \rightarrow }^{7}\mathrm{Be}+\gamma $

Previous studies of the reaction ${}^{3}\mathrm{He}+{}^{4}\mathrm{He}\to {}^{7}\mathrm{Be}+\gamma $ have mainly focused on providing the best central value and error bar for the S factor at solar energies. Experimental measurements of this capture reaction at higher energies, the ${}^{3}\mathrm{He}$–${}^{4}\mathrm{He}$ scattering phase shifts, as well as properties of ${}^{7}\mathrm{Be}$ and its excited state, have been used to constrain the theoretical models employed for this purpose. Here we show that much more information than was previously appreciated can be extracted from angle-integrated capture data alone. We use the next-to-leading-order (NLO) amplitude in an effective field theory (EFT) for ${}^{3}\mathrm{He}+{}^{4}\mathrm{He}\to {}^{7}\mathrm{Be}+\gamma $ to perform the extrapolation. At this order the EFT describes the capture process using an s-wave scattering length and effective range, the asymptotic properties of ${}^{7}\mathrm{Be}$ and its excited state, and short-distance contributions to the E1 capture amplitude. We extract the multi-dimensional posterior of all these parameters via a Bayesian analysis that uses capture data below 2 MeV. We find that properties of the ${}^{7}\mathrm{Be}$ ground and excited states are well constrained. The total S factor $S(0)\,={0.577}_{-0.016}^{+0.015}$ keV b, while the branching ratio for excited- to ground-state capture at zero energy, ${Br}(0)={0.406}_{-0.011}^{+0.013}$, both at 68% degree of belief. This S(0) is broadly consistent with other recent evaluations, and agrees with the previously recommended value $S(0)=0.56\pm 0.03\,\,\mathrm{keV}$ b, but has a smaller error bar. We also find significant constraints on ${}^{3}\mathrm{He}$–${}^{4}\mathrm{He}$ scattering parameters, and we obtain constraints on the angular distribution of capture gamma rays, which is important for interpreting experiments. The path forward for this reaction seems to lie with better measurements of the scattering phase shifts and S(E)'s angular dependence away from zero energy, together with better understanding of the asymptotic normalization coefficients of the ${}^{7}$Be bound states' wave functions. Lastly, data on these could further reduce the uncertainty on S(0).

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2020

A New Approach to Distributed Hypothesis Testing and Non-Bayesian Learning: Improved Learning Rate and Byzantine-Resilience

Here, we study a setting where a group of agents, each receiving partially informative private signals, seek to collaboratively learn the true underlying state of the world (from a finite set of hypotheses) that generates their joint observation profiles. To solve this problem, we propose a distributed learning rule that differs fundamentally from existing approaches, in that it does not employ any form of “belief-averaging”. Instead, agents update their beliefs based on a min-rule. Under standard assumptions on the observation model and the network structure, we establish that each agent learns the truth asymptotically almost surely. As our main contribution, we prove that with probability 1, each false hypothesis is ruled out by every agent exponentially fast, at a network-independent rate that is strictly larger than existing rates. We then develop a computationally-efficient variant of our learning rule that is provably resilient to agents who do not behave as expected (as represented by a Byzantine adversary model) and deliberately try to spread misinformation.

42 ENGINEERING↗
NASA NTRS2004

Filtering in Hybrid Dynamic Bayesian Networks

We demonstrate experimentally that inference in a complex hybrid Dynamic Bayesian Network (DBN) is possible using the 2 - T i e Slice DBN (2T-DBN) from [Koller & Lerner, 20001 to model fault detection in a watertank system. In [Koller & Lerner, 20001 a generic Particle Filter (PF) is used for inference. We extend the experiment and perform approximate inference using The Extended Kalman Filter (EKF) and the Unscented Kalman Filter (UKF). Furthermore, we combine these techniques in a 'non-strict' Rao-Blackwellisation framework and apply it to the watertank system. We show that UKF and UKF in a PF framework outperfom the generic PF, EKF and EKF in a PF framework with respect to accuracy and robustness in terms of estimation RMSE. Especially we demonstrate the superiority of UKF in a PF framework when our beliefs of how data was generated are wrong. We also show that the choice of network structure is very important for the performance of the generic PF and the EKF algorithms, but not for the UKF algorithms. Furthermore, we investigate the influence of data noise in the water[ank simulation. Theory and implementation is based on the theory presented.

Andersen, Morten Nonboe↗
DOE OSTI2021

Bayesian inference of the incompressibility, skewness and kurtosis of nuclear matter from empirical pressures in relativistic heavy-ion collisions

Within the Bayesian statistical framework we infer the incompressibility K 0 , skewness J 0 and kurtosis Z 0 parameters of symmetric nuclear matter (SNM) at its saturation density ρ 0 using the constraining bands on the pressure in cold SNM in the density range of 1.3ρ 0 to 4.5ρ 0 from transport model analyses of kaon production and nuclear collective flow in relativistic heavy-ion collisions. As the default option assuming the K 0 , J 0 and Z 0 have Gaussian prior probability distribution functions (PDFs) with the means and variances of 235±30, -200±200 and -146±1728 MeV, their posterior most probable values are narrowed down to 192$^{+12}_{-16}$ MeV, -180$^{+100}_{-110}$ MeV and ${\mathrm{200}}_{-250}^{+250}$ at 68% confidence level, respectively. The results are largely independent of the prior PDFs of J 0 and Z 0 used. However, if one adopts the strong belief that the incompressibility K 0 has a uniform prior PDF within its absolute boundary of 220–260 MeV as one can find easily in the literature, the posterior most probable values of K 0 , J 0 and Z 0 shift to ${K}_{0}=22{0}_{-0}^{+6}$ MeV, ${J}_{0}=-39{0}_{-70}^{+60}$ MeV and ${Z}_{0}=60{0}_{-200}^{+200}$ MeV, respectively. While the posterior PDFs of the SNM EOS parameters depend somewhat on the prior PDF of K 0 used, the results from using different prior PDFs are qualitatively consistent. The uncertainties of all three parameters are significantly reduced especially for the J 0 and Z 0 parameters compared to their current values.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS2000

Filtering in Hybrid Dynamic Bayesian Networks

We implement a 2-time slice dynamic Bayesian network (2T-DBN) framework and make a 1-D state estimation simulation, an extension of the experiment in (v.d. Merwe et al., 2000) and compare different filtering techniques. Furthermore, we demonstrate experimentally that inference in a complex hybrid DBN is possible by simulating fault detection in a watertank system, an extension of the experiment in (Koller & Lerner, 2000) using a hybrid 2T-DBN. In both experiments, we perform approximate inference using standard filtering techniques, Monte Carlo methods and combinations of these. In the watertank simulation, we also demonstrate the use of 'non-strict' Rao-Blackwellisation. We show that the unscented Kalman filter (UKF) and UKF in a particle filtering framework outperform the generic particle filter, the extended Kalman filter (EKF) and EKF in a particle filtering framework with respect to accuracy in terms of estimation RMSE and sensitivity with respect to choice of network structure. Especially we demonstrate the superiority of UKF in a PF framework when our beliefs of how data was generated are wrong. Furthermore, we investigate the influence of data noise in the watertank simulation using UKF and PFUKD and show that the algorithms are more sensitive to changes in the measurement noise level that the process noise level. Theory and implementation is based on (v.d. Merwe et al., 2000).

Andersen, Morten Nonboe↗