Search NASA⌕ Search

SEARCH · Search NASA

Results for “Probability estimates”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

GANISP: A GAN-Assisted Importance Splitting Probability Estimator: Preprint

To reduce the variance of rare event probability estimator, genealogical importance splitting marches towards a rare event by iteratively selecting and replicating realizations that are headed towards a rare event. The replication step is made difficult when applied to deterministic systems as the initial conditions of the offspring realizations need to be modified. Typically, a random perturbation is applied to the offspring to differentiate their trajectory from the parent realization. It is shown that a random perturbation strategy may be effective for some systems but may also fail for others, thereby preventing variance reduction in the probability estimate. To address this limitation, it is proposed to use a generative model such as a Generative Adversarial Network (GAN) to generate perturbations that are consistent with the attractor of the dynamical system. The GAN-assisted Importance SPlitting method (GANISP) improves the variance reduction for the system targeted. An implementation of the method is available in a companion repository (https://github.com/NREL/GANISP).

generative adversarial network↗
DOE OSTI2022

GANISP: A GAN-Assisted Importance Splitting Probability Estimator

Designing manufacturing processes with high yield and strong reliability relies on effective methods for rare event estimation. Genealogical importance splitting reduces the variance of rare event probability estimators by iteratively selecting and replicating realizations that are headed towards a rare event. The replication step is difficult when applied to deterministic systems where the initial conditions of the offspring realizations need to be modified. Typically, a random perturbation is applied to the offspring to differentiate their trajectory from the parent realization. However, this random perturbation strategy may be effective for some systems while failing for others, preventing variance reduction in the probability estimate. This work seeks to address this limitation using a generative model such as a Generative Adversarial Network (GAN) to generate perturbations that are consistent with the attractor of the dynamical system. The proposed GAN-assisted Importance SPlitting method (GANISP) improves the variance reduction for the system targeted. An implementation of the method is available in a companion repository (https://github.com/NREL/GANISP).

generative adversarial network↗
DOE OSTI2021

Performance Comparison of Circular and Spherical Error Probable Estimators

This report compares the performance of three Circular Error Probable (CEP) estimators: the Grubbs-Patnaik estimator, a new, non-iterative, radial-integration estimator, and a median estimator. It also compares the performance of two Spherical Error Probable (SEP) estimators. The performance of each estimator is assessed in terms of bias, uncertainty, robustness, and computational complexity. Robustness is evaluated with respect to outliers, variations in the underlying statistical distribution characterizing munition impact positions, and impact-position measurement errors. The performance assessments indicate the radial-integration and Grubbs-Patnaik estimators perform nearly identically providing the statistical distribution of impact-position coordinates is jointly normal with zero means. In that case, both estimators outperform the median estimator by about 2% relative to the true CEP in terms of estimator uncertainty. The bias performance of the radial-integration and median estimators is close to zero for jointly normal impacts, however, the Grubbs-Patnaik estimator can be significantly biased for jointly normal impacts with non-zero means. When the statistical distribution characterizing impact positions is known, but not jointly normal, the radial-integration estimator is superior. In this case, the median estimator also outperforms the Grubbs-Patnaik estimator but is not quite as good as the radial-integration estimator. If the statistical distribution characterizing impacts is unknown and not jointly normal, or if distribution parameters are difficult or impractical to estimate, or if test data is corrupted with outliers, then the median estimator dramatically outperforms the other estimators, especially in terms of estimation bias. Unexpectedly, measurement noise did not significantly degrade the performance of any of the estimators, except for cases with signal to noise ratios less than five. Although the Grubbs-Patnaik estimator has remained the gold standard for CEP estimation for over half a century, the performance assessments indicate the new, non-iterative, radial-integration estimator and the median estimator offer significant advantages and, in most practical real-world conditions, are superior estimators. These estimators are also useful for SEP estimation whereas the Grubbs-Patnaik estimator does not extend to three dimensions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Artificial Reasoning System for Symptom-Based Conditional Failure Probability Estimation Using Bayesian Network

Advances in nuclear power technologies require enhanced capabilities for operator advice and autonomous control. One of the first tasks in the development of such capabilities is the formulation of symptom-based conditional failure probabilities for structures, systems, and components (SSCs) of interest, for which the primary goal is to aid plant personnel in deducing the probabilistic performance status of the monitored SSCs and in detecting impending faults/failure. The task of conditional failure probability estimation is a bidirectional inference problem and shall be logically tackled by the Bayesian network (BN) approach. As a knowledge-based artificial intelligence tool and a probabilistic graphical model, BN offers the capability of reasoning under uncertainty and graphical representation emulating the physical behavior of the target SSC. This paper provides a systematic overview of the BN technique and the software tools for handling implementation of BN models, along with the associated knowledge representation and reasoning paradigm. Both operational data and expert judgement can be readily incorporated into the knowledge base of a BN model. The challenges with data availability are highlighted, and the general approach to target SSC identification is presented. Our focus is upon failure-prone and risk-important balance of plant assets, especially cases having strong operator involvement. An exemplary case study on the failure of a motor-driven centrifugal pump is also conducted to demonstrate the usefulness and technical feasibility of the proposed artificial reasoning system using an expert system shell.

Zhao, Xingang↗
DOE OSTI2022

RESULTS OF A VIRTUAL ROUND ROBIN STUDY TO ESTIMATE PROBABILITY OF DETECTION FOR DISSIMILAR METAL WELDS

This paper presents efforts to overcome challenges with empirical probability of detection (POD) estimations in the nuclear power industry through the utilization of a novel virtual flaw method. A virtual round robin (VRR) study was conducted under the Program for Investigation Of NDE by International Collaboration (PIONIC), organized by the United States Nuclear Regulatory Commission (NRC) utilizing data generated by the virtual flaw method. Analysis of results from the VRR was performed by teams from Pacific Northwest National Laboratory (PNNL), Electric Power Research Institute (EPRI), and Aalto University. Empirically derived POD estimations are presented, and challenges associated with obtaining these estimations are discussed. The virtual flaw method is introduced and some details of its implementation for the VRR activity are described. Results from POD analysis of the VRR data by PNNL, EPRI, and Aalto University are presented and a discussion regarding differences in analysis results is provided. Finally, potential future efforts to improve the application of the virtual flaw method and its estimation of POD are discussed.

Probability of detection, Dissimilar Metal Weld, P↗
DOE OSTI2022

Neptunium transition probabilities estimated through laser induced breakdown spectroscopy (LIBS) measurements

in tis report calibration free–laser induced breakdown spectroscopy (CF-LIBS) approaches are promising for the analysis of radioactive materials; however, a lack of reported fundamental properties for these materials is an obstacle to implementation. Spectra of laser induced plasmas containing Np and Sr, along with Saha–Boltzmann methods, were used to estimate the first reported transition probabilities (TPs) of Np. These TPs enabled the first attempt at CF-LIBS analysis of radioactive samples to predict Np/Sr ratios with a mean error of 3.86%. The presented methodology of TP estimation will be applied to the study of other actinides and allow broader applications of CF-15 LIBS in the nuclear field.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2022

CAMERA: A method for cost-aware, adaptive, multifidelity, efficient reliability analysis

Estimating probability of failure in aerospace systems is a critical requirement for flight certification and qualification. Failure probability estimation involves resolving tails of probability distributions, and Monte Carlo sampling methods are intractable when expensive high-fidelity simulations have to be queried. Here, we propose a method to use models of multiple fidelities that trade accuracy for computational efficiency. Specifically, we propose the use of multifidelity Gaussian process models to efficiently fuse models at multiple fidelity, thereby offering a cheap surrogate model that emulates the original model at all fidelities. Furthermore, we propose a novel sequential acquisition function based experiment design framework that can automatically select samples from appropriate fidelity models to make predictions about quantities of interest at the highest fidelity. We use our proposed approach in an importance sampling setting and demonstrate our method on the failure level set and probability estimation on synthetic test functions and two real-world applications, namely, the reliability analysis of a gas turbine engine blade using a finite element method and a transonic aerodynamic wing test case using Reynolds-averaged Navier-Stokes equations. We show that our method predicts the failure boundary and probability more accurately and at a fraction of the computational cost compared with using just a single expensive high-fidelity model. Finally, we show that our sequential approach is guaranteed to asymptotically converge to the true failure boundary with high probability.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Quasar Identification Using Multivariate Probability Density Estimated from Nonparametric Conditional Probabilities

Nonparametric estimation for a probability density function that describes multivariate data has typically been addressed by kernel density estimation (KDE). A novel density estimator recently developed by Farmer and Jacobs offers an alternative high-throughput automated approach to univariate nonparametric density estimation based on maximum entropy and order statistics, improving accuracy over univariate KDE. This article presents an extension of the single variable case to multiple variables. The univariate estimator is used to recursively calculate a product array of one-dimensional conditional probabilities. In combination with interpolation methods, a complete joint probability density estimate is generated for multiple variables. Good accuracy and speed performance in synthetic data are demonstrated by a numerical study using known distributions over a range of sample sizes from 100 to 10 6 for two to six variables. Performance in terms of speed and accuracy is compared to KDE. The multivariate density estimate developed here tends to perform better as the number of samples and/or variables increases. As an example application, measurements are analyzed over five filters of photometric data from the Sloan Digital Sky Survey Data Release 17. The multivariate estimation is used to form the basis for a binary classifier that distinguishes quasars from galaxies and stars with up to 94% accuracy.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Photometric redshifts probability density estimation from recurrent neural networks in the DECam local volume exploration survey data release 2

Photometric wide-field surveys are imaging the sky in unprecedented detail. These surveys face a significant challenge in efficiently estimating galactic photometric redshifts while accurately quantifying associated uncertainties. In this work, we address this challenge by exploring the estimation of Probability Density Functions (PDFs) for the photometric redshifts of galaxies across a vast area of 17,000 square degrees, encompassing objects with a median 5 σ point-source depth of g = 24.3, r = 23 . 9 , i = 23.5, and z = 22.8 mag. Our approach uses deep learning, specifically integrating a Recurrent Neural Network architecture with a Mixture Density Network, to leverage magnitudes and colors as input features for constructing photometric redshift PDFs across the whole DECam Local Volume Exploration (DELVE) survey sky footprint. Subsequently, we rigorously evaluate the reliability and robustness of our estimation methodology, gauging its performance against other well-established machine learning methods to ensure the quality of our redshift estimations. Our best results constrain photometric redshifts with the bias of − 0 . 0013 , a scatter of 0.0293, and an outlier fraction of 5.1%. These point estimates are accompanied by well-calibrated PDFs evaluated using diagnostic tools such as Probability Integral Transform and Odds distribution. We also address the problem of the accessibility of PDFs in terms of disk space storage and the time demand required to generate their corresponding parameters.We present a novel Autoencoder model that reduces the size of PDF parameter arrays to one-sixth of their original length, significantly decreasing the time required for PDF generation to one-eighth of the time needed when generating PDFs directly from the magnitudes.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Exploration of a Potential Desirability of Outcome Ranking Endpoint for Complicated Intra-Abdominal Infections Using 9 Registrational Trials for Antibacterial Drugs

Abstract Background Desirability of outcome ranking (DOOR) is a novel approach to clinical trial design that incorporates safety and efficacy assessments into an ordinal ranking system to evaluate overall outcomes of clinical trial participants. Here, we derived and applied a disease-specific DOOR endpoint to registrational trials for complicated intra-abdominal infection (cIAI). Methods Initially, we applied an a priori DOOR prototype to electronic patient-level data from 9 phase 3 noninferiority trials for cIAI submitted to the US Food and Drug Administration between 2005 and 2019. We derived a cIAI-specific DOOR endpoint based on clinically meaningful events that trial participants experienced. Next, we applied the cIAI-specific DOOR endpoint to the same datasets and, for each trial, estimated the probability that a participant assigned to the study treatment would have a more desirable DOOR or component outcome than if assigned to the comparator. Results Three key findings informed the cIAI-specific DOOR endpoint: (1) a significant proportion of participants underwent additional surgical procedures related to their baseline infection; (2) infectious complications of cIAI were diverse; and (3) participants with worse outcomes experienced more infectious complications, more serious adverse events, and underwent more procedures. DOOR distributions between treatment arms were similar in all trials. DOOR probability estimates ranged from 47.4% to 50.3% and were not significantly different. Component analyses depicted risk-benefit assessments of study treatment versus comparator. Conclusions We designed and evaluated a potential DOOR endpoint for cIAI trials to further characterize overall clinical experiences of participants. Similar data-driven approaches can be utilized to create other infectious disease–specific DOOR endpoints.

Immunology↗
DOE OSTI2024

Exploration of a Potential DOOR Endpoint for Hospital-acquired Bacterial Pneumonia and Ventilator-associated Bacterial Pneumonia Using Six Registrational Trials for Antibacterial Drugs

Abstract Background Desirability of outcome ranking (DOOR) is an innovative approach to clinical trial design and analysis that uses an ordinal ranking system to incorporate the overall risks and benefits of a therapeutic intervention into a single measurement. Here we derived and evaluated a disease-specific DOOR endpoint for registrational trials for hospital-acquired bacterial pneumonia and ventilator-associated bacterial pneumonia (HABP/VABP). Methods Through comprehensive examination of data from nearly 4000 participants enrolled in six registrational trials for HABP/VABP submitted to the Food and Drug Administration (FDA) between 2005 and 2022, we derived and applied a HABP/VABP specific endpoint. We estimated the probability that a participant assigned to the study treatment arm would have a more favorable overall DOOR or component outcome than a participant assigned to comparator. Results DOOR distributions between treatment arms were similar in all trials. DOOR probability estimates ranged from 48.3% to 52.9% and were not statistically different. There were no significant differences between treatment arms in the component analyses. Although infectious complications and serious adverse events occurred more frequently in ventilated participants compared to non-ventilated participants, the types of events were similar. Conclusions Through a data-driven approach, we constructed and applied a potential DOOR endpoint for HABP/VABP trials. The inclusion of syndrome-specific events may help to better delineate and evaluate participant experiences and outcomes in future HABP/VABP trials and could help inform data collection and trial design.

Immunology↗
DOE OSTI2020

Conservative Estimation of Tail Probabilities from Limited Sample Data

Several sparse-sample uncertainty quantification (UQ) methods are compared for conservative but not overly conservative estimation of small tail probabilities involving responses that lay beyond specified thresholds in the tails of probability distributions. Sixteen very differently shaped distributions (or probability density functions, PDFs) and tail probability magnitudes ranging from 10 -5 to 10 -1 are considered in order for the study to be relevant to a wide range of risk analysis and quantification of margins and uncertainty (QMU) problems. The emphasis of the study is on limited data regimes ranging from N = 2 to 20 samples, reflective of most experimental and some expensive computational situations. Relatively simple sparse-sample UQ methods tested for this regime involve statistical tolerance interval "Equivalent Normal and related "Ensemble of Normals" and "Superdistribution (SD) approaches. (The independently derived SD is effectively equivalent to the Bayesian posterior predictive distribution given the assumptions of the derivation.) The performance of the methods was generally improved for N ≥ 5 samples with a generalized Jackknife resampling technique, which determines a tail probability estimate by averaging estimates from smaller sub-samples. Several quantitative metrics for method conservatism and accuracy of tail probability estimation are used to assess and rank the methods' performance over many random trials for each test PDF and probability magnitude. A variant of Bootstrap resampling was also tried, but did not significantly improve tail probability estimates in most cases. Detailed results are presented from over 100-million tests over the above factors that provide useful granular information on which methods or combination of methods perform best in various areas of the factor space.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A Provably Accurate Randomized Sampling Algorithm for Logistic Regression

In statistics and machine learning, logistic regression is a widely-used supervised learning technique primarily employed for binary classification tasks. When the number of observations greatly exceeds the number of predictor variables, we present a simple, randomized sampling-based algorithm for logistic regression problem that guarantees high-quality approximations to both the estimated probabilities and the overall discrepancy of the model. Our analysis builds upon two simple structural conditions that boil down to randomized matrix multiplication, a fundamental and well-understood primitive of randomized numerical linear algebra. We analyze the properties of estimated probabilities of logistic regression when leverage scores are used to sample observations, and prove that accurate approximations can be achieved with a sample whose size is much smaller than the total number of observations. To further validate our theoretical findings, we conduct comprehensive empirical evaluations. Overall, our work sheds light on the potential of using randomized sampling approaches to efficiently approximate the estimated probabilities in logistic regression, offering a practical and computationally efficient solution for large-scale datasets.

Chowdhury, Agniva↗
DOE OSTI2024

Efficient First-Order Algorithms for Large-Scale, Non-Smooth Maximum Entropy Models with Application to Wildfire Science

Maximum entropy (MaxEnt) models are a class of statistical models that use the maximum entropy principle to estimate probability distributions from data. Due to the size of modern data sets, MaxEnt models need efficient optimization algorithms to scale well for big data applications. State-of-the-art algorithms for MaxEnt models, however, were not originally designed to handle big data sets; these algorithms either rely on technical devices that may yield unreliable numerical results, scale poorly, or require smoothness assumptions that many practical MaxEnt models lack. In this paper, we present novel optimization algorithms that overcome the shortcomings of state-of-the-art algorithms for training large-scale, non-smooth MaxEnt models. Our proposed first-order algorithms leverage the Kullback–Leibler divergence to train large-scale and non-smooth MaxEnt models efficiently. For MaxEnt models with discrete probability distribution of n elements built from samples, each containing m features, the stepsize parameter estimation and iterations in our algorithms scale on the order of O(mn) operations and can be trivially parallelized. Moreover, the strong ℓ1 convexity of the Kullback–Leibler divergence allows for larger stepsize parameters, thereby speeding up the convergence rate of our algorithms. To illustrate the efficiency of our novel algorithms, we consider the problem of estimating probabilities of fire occurrences as a function of ecological features in the Western US MTBS-Interagency wildfire data set. Our numerical results show that our algorithms outperform the state of the art by one order of magnitude and yield results that agree with physical models of wildfire occurrence and previous statistical analyses of wildfire drivers.

Physics↗
DOE OSTI2021

An efficient method to estimate the probability density of seismic Green's functions

We present a computationally efficient method to approximate the probability distribution of seismic Green's functions given the uncertainty of an Earth model. The method is based on the Karhunen-Loève (KL) theorem and an approximation of the Green's function (or seismogram) covariance. Using Monte Carlo (MC) simulations as a control case, we demonstrate that our KL-based method can accurately reproduce a probability distribution of seismograms that results from an uncertain Earth model for a MC-derived seismogram covariance. We then describe a method to estimate the covariance of the seismograms resulting from those Earth models that is not based on MC simulations. We use the estimated Green's function covariance in conjunction with our KL-based method to produce a Green's function probability distribution, and compare that distribution to a Green's function probability distribution produced using a MC finite difference method. We find that the Green's function probability distribution approximated using our KL-based method generally mimics that produced using the MC simulations, especially for direct-arriving body waves. However the accuracy of the KL-based method generally decreases for later times in the simulated Green's function distribution.

58 GEOSCIENCES↗
DOE OSTI2021

GANISP (GAN-assisted Importance SPlitting)

Genealogical importance splitting marches towards a rare event by iteratively selecting and replicating realizations that are headed towards a rare event. The replication step is made difficult when applied to deterministic systems as the initial conditions of the offspring realizations need to be adjusted. Typically, a random perturbation is applied to the offspring. For some cases, this cloning technique may not be adequate and prevent variance reduction in the probability estimate. A GAN-based replication process is proposed to address this limitation. The perturbations applied to the clones are physically consistent instead of being randomly chosen. The proposed method allows reducing the variance in the probability estimation.

Hassanaly, Malik↗