Search NASA⌕ Search

SEARCH · Search NASA

Results for “probabilistic computing”

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 307 records · Page 17

Inferring colloidal interaction from scattering by machine learning

A machine learning solution for the potential inversion problem in elastic scattering is outlined. The inversion scheme consists of two major components, a generative network featuring a variational autoencoder which extracts the targeted static two-point correlation functions from experimentally measured scattering cross sections, and a Gaussian process framework which probabilistically infers the relevant structural parameters from the inverted correlation functions. Via a case study of charged colloidal suspensions, the feasibility of this approach for quantitative study of molecular interaction is critically benchmarked and its merit over existing deterministic approaches, in terms of numerical accuracy and computationally efficiency, is demonstrated.

36 MATERIALS SCIENCE↗

A method for predicting failure statistics for steady state elevated temperature structural components

This paper presents the initial development of a high temperature life prediction method that accounts for the variability in the material properties of Grade 91 steel. The method accounts for material variability by fitting a variable 3-parameter Weibull distribution to experimental rupture data and accounts for the variability of creep deformation on the steady-state stresses via a Monte Carlo approach. To ensure reasonable computational times, the model represents the material as an extremely viscous Stokes fluid with a non-Newtonian viscosity, therefore solving the stress relaxation problem with a steady, static, instead of transient, analysis. Furthermore, the complete statistical analysis combines this model for creep deformation with a probabilistic model for creep rupture to evaluate the probability of premature failure for a set of sample problems, comparing the predicted failure statistics to the design life predicted by the ASME Boiler and Pressure Vessel Code rules.

42 ENGINEERING↗

Characterization of Extremes and Compound Impacts: Applications of Machine Learning and Interpretable Neural Networks

Focal Area: This white paper responds to Focal area III by exploring data fusion, learning and explainable AI methods in characterizing hydrological extremes and interconnections. It also addresses Focal area II by using probabilistic AI and ensemble ML for predicting extremes and compound extremes. Science Challenge: A key question associated with the integrated water (or hydrological) cycle grand challenge in the Earth and Environmental Systems Sciences Division (EESSD) strategic plan, is how the frequency and intensity of hydrological events will change. Prediction of the tail behavior (extremes) of the hydrological cycle is especially challenging, because of their stochasticity and low probability. These extreme events and their compound impacts have significant societal and economic consequences. It is anticipated for the next-generation Earth System models (ESMs), that model predictability of the water cycle will improve with increased resolution (e.g., regionally refined E3SM), advanced software and computational architectures, and improved model physics based on the data from ARM measurements and high-fidelity models. However, the challenges for predictability of low-probability high-impact extreme events will unlikely be alleviated with conventional modeling and data-driven approaches, as ESMs are calibrated largely for capturing the high-frequency mean climate states. Recent AI and ML applications have shown great potential in quantifying well-defined climate extremes (e.g., supervised learning of tropical cyclones/atmospheric rivers by ClimateNet1) but few efforts are dedicated to compound events, extreme drivers and uncertainty estimation. We envision the opportunity to develop and apply ML and interpretable AI methods extended on the existing efforts, specifically, for: (1) identification of compound extremes, (2) diagnosing drivers of extremes, (3) bias correction in extreme predictions and (4) probabilistic modeling of extremes.

54 ENVIRONMENTAL SCIENCES↗

Differentiable Quantum Programming with Unbounded Loops

The emergence of variational quantum applications has led to the development of automatic differentiation techniques in quantum computing. Existing work has formulated differentiable quantum programming with bounded loops, providing a framework for scalable gradient calculation by quantum means for training quantum variational applications. However, promising parameterized quantum applications, e.g., quantum walk and unitary implementation, cannot be trained in the existing framework due to the natural involvement of unbounded loops. To fill in the gap, we provide the first differentiable quantum programming framework with unbounded loops, including a newly designed differentiation rule, code transformation, and their correctness proof. Technically, we introduce a randomized estimator for derivatives to deal with the infinite sum in the differentiation of unbounded loops, whose applicability in classical and probabilistic programming is also discussed. We implement our framework with Python and Q# and demonstrate a reasonable sample efficiency. Through extensive case studies, we showcase an exciting application of our framework in automatically identifying close-to-optimal parameters for several parameterized quantum applications.

Computer Science↗

Randomized Algorithms for Scientific Computing (RASC)

Randomized algorithms have propelled advances in artificial intelligence (AI) and represent a foundational research area in advancing AI for Science. Future advancements in DOE Office of Science priority areas such as climate science, astrophysics, fusion, advanced materials, combustion, and quantum computing all require randomized algorithms for surmounting challenges of complexity, robustness, and scalability. Advances in data collection and numerical simulation have changed the dynamics of scientific research and motivate the need for randomized algorithms. For instance, advances in imaging technologies such as X-ray ptychography, electron microscopy, electron energy loss spectroscopy, or adaptive optics lattice light-sheet microscopy collect hyperspectral imaging and scattering data in terabytes, at breakneck speed enabled by state-of-the-art detectors. The data collection is exceptionally fast compared with its analysis. Likewise, advances in high-performance architectures have made exascale computing a reality and changed the economies of scientific computing in the process. Floating-point operations that create data are essentially free in comparison with data movement. Thus far, most approaches have focused on creating faster hardware. Ironically, this faster hardware has exacerbated the problem by making data still easier to create. Under such an onslaught, scientists often resort to heuristic deterministic sampling schemes (e.g., low-precision arithmetic, sampling every nth element) and sacrifice potentially valuable accuracy. Dramatically better results can be achieved via randomized algorithms, reducing the data size as much as or more than naive deterministic subsampling can achieve, while retaining the high accuracy of computing on the full data set. By randomized algorithms we mean those algorithms that employ some form of randomness in internal algorithmic decisions to accelerate time to solution, increase scalability, or improve reliability. Examples include matrix sketching for solving large-scale least-squares problems (see Figure 1) and stochastic gradient descent for training machine learning models. We are not recommending heuristic methods but rather randomized algorithms that have certificates of correctness and probabilistic guarantees of optimality and near-optimality. Such approaches can be useful beyond acceleration, for example, in understanding how to avoid measure zero worst-case scenarios that plague methods such as QR matrix factorization.

97 MATHEMATICS AND COMPUTING↗

User’s Manual for RESRAD-BUILD Code V.4: Vol. 1 – Methodology and Models Used in RESRAD-BUILD Code

The RESRAD-BUILD computer code models radionuclide release and transport in indoor environments and performs pathway analyses to evaluate the potential radiological dose and risk incurred by an individual who works or lives in a building contaminated with radioactive material or housing radioactively contaminated furniture or equipment. The code provides four geometries to characterize a radiation source: point, line, area, and volume, in which radionuclides are homogeneously distributed. Radionuclides contained in a source are considered to be released to the indoor air due to various processes including erosion (mechanically or weathering), diffusion (for tritium and radon in a volume source), or emanation (radon in a point, line, or area source). The release can proceed through different time phases with different rates. In RESRAD-BUILD Version 4.0, a dynamic ventilation model is implemented to simulate the fate and transport of source material particles and radionuclides after their releases. This dynamic ventilation model considers (1) air exchange between rooms in the building and between the rooms and the outdoor environment, (2) deposition from air to floor, (3) resuspension from the floor to the air, and (4) periodical vacuuming that reduces the floor deposition. The fate and transport modeling provides estimates of radionuclide concentrations in the source, in the air, and on the floor at different times, which are then integrated over the exposure duration for the calculation of radiation doses and cancer risks. A single run of the RESRAD-BUILD code can model a building with up to 9 rooms, 10 sources, and 10 receptors. The potential radiation dose and cancer risk incurred by each receptor are calculated for seven exposure pathways: (1) external radiation directly from the sources (accounting for shielding), (2) external radiation from radioactive particles deposited on the floors, (3) external radiation from airborne radionuclides, (4) inhalation of airborne radionuclides, (5) inhalation of radon and radon progenies, (6) inadvertent ingestion of radioactive particles directly from the source, and (7) ingestion of radioactive particles deposited on the floors. Various exposure scenarios can be modeled with RESRAD-BUILD, including but are not limited to, office worker, renovation worker, decontamination worker, building visitor, and resident. Both deterministic and probabilistic analyses can be performed to obtain results in both text reports and graphic displays.

61 RADIATION PROTECTION AND DOSIMETRY↗

HYPHY: Deep Generative Conditional Posterior Mapping of Hydrodynamical Physics

Generating large-volume hydrodynamical simulations for cosmological observables is a computationally demanding task necessary for next-generation observations. In this work, we construct a novel fully convolutional variational autoencoder (VAE) to synthesize hydrodynamic fields conditioned on dark matter fields from N -body simulations. After training the model on a single hydrodynamical simulation, we are able to probabilistically map new dark-matter-only simulations to corresponding full hydrodynamical outputs. By sampling over the latent space of our VAE, we can generate posterior samples and study the variance of the mapping. We find that our reconstructed field provides an accurate representation of the target hydrodynamical fields as well as reasonable variance estimates. This approach has promise for the rapid generation of mocks as well as for implementation in a full inverse model of observed data.

79 ASTRONOMY AND ASTROPHYSICS↗

User's Manual for RESRAD-BUILD Code Version 4: Vol. 2 - User's Guide for RESRAD-BUILD Code Version 4

The RESRAD-BUILD computer code is designed to assess radiological doses to individuals who live or work in a building contaminated with radioactive material. The code is equipped with a user-friendly interface that has many features to facilitate using the computer code and understanding the results. The design of the interface provides various options, from entering data and performing calculations to displaying calculation results. General and context-specific help are available, providing information on editing and viewing the radionuclide database, the definitions of input parameters and their use in the calculations, and the selection of the calculation results for placement into other applications. Two types of sensitivity analysis are supported by the code, i.e., deterministic and probabilistic, that can be used to study the influence of input parameters on the calculation results. This user’s guide provides instructions to help users on how to install the RESRAD-BUILD code, navigate the interface, and use the various features to set up a dose/risk analysis and to view/print the results in text and graphical outputs.

61 RADIATION PROTECTION AND DOSIMETRY↗

An efficient method to identify uncertainties of WRF-Solar variables in forecasting solar irradiance using a tangent linear sensitivity analysis

Uncertainty in predicting solar energy resources introduces major challenges in power system management and necessitates the development of reliable probabilistic solar forecasts. As the first part of the development of probabilistic forecasts based on the Weather Research and Forecasting model with solar extensions (WRF-Solar), this study presents a tangent linear approach to identify input variables responsible for the largest uncertainties in predicting surface solar irradiance and clouds. A tangent linear analysis is capable of efficiently investigating sensitivities of output variables with respect to various input variables of WRF-Solar because this approach avoids the computational burden of perturbing the initial conditions of individual input variables. We develop tangent linear models (TLMs) for six WRF-Solar physics packages that control the formation and dissipation of clouds and solar radiation, and we evaluate the validity of TLMs using a linearity test. The tangent linear sensitivity analysis is conducted under various scenarios based on satellite observations and model simulations to consider realistic input conditions. A simple method is used to quantify the impact of the uncertainty of input variables on the output variables from the TLMs. The results demonstrate that uncertainties in the output variables that are the focus of this study—including global horizontal irradiance, direct normal irradiance, cloud mixing ratio, cloud tendency, cloud fraction, and sensible and latent heat fluxes—are highly sensitive to uncertainties in 14 input variables. This study indicates that the tangent linear method can identify key variables of physics modules in WRF-Solar that can be stochastically perturbed to generate ensemble-based probabilistic forecasts.

14 SOLAR ENERGY↗

Nuclear safety Enhanced: A Deep dive into current and future RAVEN applications

As the horizon of nuclear energy expands with the advent of small modular reactors, IV generation reactors, and fusion reactors, there is a growing perspective that the licensing process could benefit from a more comprehensive approach. Moving beyond traditional deterministic and PRA analysis might pave the way for a novel safety analysis paradigm propelled by the increasing computational power at our disposal. This paper explores different methodologies that can improve the outcomes of nuclear safety analysis. These range from uncertainty quantification techniques, aimed at enhancing the precision of safety margins, to deploying dynamic event trees by driving system code simulations, capturing the potential evolutions of severe accidents. These methodologies introduce innovative dimensions to safety analysis, considering the consequences of postulated events and the dynamics of accident sequences. However, they also bring forth challenges, especially in managing the complexity and sheer volume of potential scenarios. The paper touches upon some strategies to counter these challenges, emphasizing the importance of adaptability and continuous evolution in the face of emerging nuclear safety concerns. Additionally, the paper sheds light on the need for advanced tools to apply these methodologies. Among these tools is RAVEN, an open-source software designed for parametric and probabilistic analyses. Its core components, including distribution, sampler, and reduced order model, enable various applications, from risk assessment and mitigation to dynamic learning and plant control logic simulations.

97 - MATHEMATICS AND COMPUTING↗

Interpreting Primal-Dual Algorithms for Constrained Multiagent Reinforcement Learning

Constrained multiagent reinforcement learning (C-MARL) is gaining importance as MARL algorithms find new applications in real-world systems ranging from energy systems to drone swarms. Most C-MARL algorithms use a primal-dual approach to enforce constraints through a penalty function added to the reward. In this paper, we study the structural effects of this penalty term on the MARL problem. First, we show that the standard practice of using the constraint function as the penalty leads to a weak notion of safety. However, by making simple modifications to the penalty term, we can enforce meaningful probabilistic (chance and conditional value at risk) constraints. Second, we quantify the effect of the penalty term on the value function, uncovering an improved value estimation procedure. We use these insights to propose a constrained multiagent advantage actor critic (C-MAA2C) algorithm. Simulations in a simple constrained multiagent environment affirm that our reinterpretation of the primal-dual method in terms of probabilistic constraints is effective, and that our proposed value estimate accelerates convergence to a safe joint policy.

chance constraints↗

Probabilistic partition of unity networks for high–dimensional regression problems

We explore the probabilistic partition of unity network (PPOU-Net) model in the context of high-dimensional regression problems and propose a general framework focusing on adaptive dimensionality reduction. With the proposed framework, the target function is approximated by a mixture of experts model on a low-dimensional manifold, where each cluster is associated with a fixed-degree polynomial. We present a training strategy that leverages the expectation maximization (EM) algorithm. During the training, we alternate between (i) applying gradient descent to update the DNN coefficients; and (ii) using closed-form formulae derived from the EM algorithm to update the mixture of experts model parameters. Under the probabilistic formulation, step (ii) admits the form of embarrassingly paralleliazable weighted least-squares solves. The PPOU-Nets consistently outperform the baseline fully-connected neural networks of comparable sizes in numerical experiments of various data dimensions. Here, we also explore the proposed model in applications of quantum computing, where the PPOU-Nets act as surrogate models for cost landscapes associated with variational quantum circuits.

97 MATHEMATICS AND COMPUTING↗

Performance evaluation of automated data-driven feature extraction and selection methods for practical and scalable building energy consumption prediction models

Here, this study quantifies the impact of automated feature engineering methods (feature extraction and selection) on the quality and accuracy of machine learning models that predict building energy consumption. The case study compares model performance for three main scenarios: baseline (no feature extraction and selection), feature extraction only, and feature extraction combined with feature selection (filter and/or wrapper methods) for fully trained machine learning models for 200 metered/sub-metered energy measurements across 118 real buildings. For consistency, the same machine learning model architecture (a black box deep learning neural network with probabilistic forecast output) was used for all scenarios. Based on results, all feature engineering methods provided noticeable prediction accuracy improvements (e.g., 29%-68% median prediction improvement) compared to baseline scenarios. However, in this application, feature selection methods provide little practical value due to their limited performance gains and high computational cost. Smarter algorithm development supported by better computational environments will be needed before feature selection methods can reliably and efficiently improve predictive model performance.

97 MATHEMATICS AND COMPUTING↗

D$e^+e^-$ffusion: Capturing the Beam-Beam Physics of $e^+e^-$ Collisions with Diffusion Models

Beam-induced backgrounds at high-luminosity $e^+e^-$ colliders, such as the FCC-ee, are dominated by incoherent pair creation (IPC), and require computationally expensive simulations with dedicated Monte Carlo (MC) event generators. Reliable detector and machine-detector interface studies necessitate event samples that are several orders of magnitude larger than what is practically attainable with existing MC. To alleviate this bottleneck, we present D$e^+e^-$ffusion, a denoising diffusion probabilistic model that operates as a permutation-equivariant, set-valued surrogate for fast IPC simulation. Trained on a small GuineaPig++ sample, D$e^+e^-$ffusion faithfully reproduces the marginal and joint kinematic, angular, and positional distributions of all three IPC production processes. In addition, we assess the fidelity at the detector level by propagating both Geant4 and D$e^+e^-$ffusion events through a Geant4 simulation of the CLD vertex detector and by training a transformer-based two-sample classifier; the classifier achieves an area under the ROC curve of $0.553 \pm 0.016$. The trained model generates events nearly four orders of magnitude faster than Geant4, paving the way for a fast-simulation surrogate for FCC-ee design studies.

Chahine, Antonio [Imperial Coll., London]↗

Stochastic Model Predictive Control With Gaussian Wind Direction Preview for Wake Steering

This article addresses the problem of wake steering control for wind farms that explicitly consider the tradeoff between farm-level power generation and yaw duty cycle under variable and uncertain wind conditions. A novel stochastic model predictive control (MPC) algorithm is presented, which utilizes a stochastic model of the freestream wind field components in a receding horizon framework to compute optimal yaw set points that maximize the expected value of the farm power while constraining the yaw actuation. Different configurations of the algorithm are evaluated using a steady-state wind farm simulator. The proposed stochastic MPC algorithm can plan control actions over a future prediction horizon based on probabilistic estimates of the incoming wind magnitude and direction.

17 WIND ENERGY↗

Direct Bayesian inference for fault severity assessment in Digital-Twin-Based fault diagnosis

For applications in condition-based maintenance of nuclear systems, the assessment of fault severity is crucial. In this work, we developed a framework that allows for direct inference of the probability distributions of possible faults in a system. Here, we employed a model-based approach with model residuals generated from analytical redundancy relations provided by physics-based models of the system components. From real-time sensor readings, the values of the model residuals can be calculated, and the posterior probability distributions of the faults can be computed directly using the methods of Bayesian networks. From the posterior distribution of each fault, one can estimate the fault probability based on a chosen threshold and assess the severity of the fault. By eliminating the discretization and simplifications in middle steps, this approach allows us to leverage the available computational resources to provide more accurate fault probability estimates and severity assessments.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

General Bayesian Inference over the Stiefel Manifold via the Givens Transform

We introduce here an approach based on the Givens representation for posterior inference in statistical models with orthogonal matrix parameters, such as factor models and probabilistic principal component analysis (PPCA). We show how the Givens representation can be used to develop practical methods for transforming densities over the Stiefel manifold into densities over subsets of Euclidean space. We demonstrate how to deal with issues arising from the topology of the Stiefel manifold and how to inexpensively compute the change-of-measure terms. We introduce an auxiliary parameter approach that limits the impact of topological issues. We provide both analysis of our methods and numerical examples demonstrating the effectiveness of the approach. We also discuss how our Givens representation can be used to define general classes of distributions over the space of orthogonal matrices. We then give demonstrations on several examples showing how the Givens approach performs in practice in comparison with other methods.

97 MATHEMATICS AND COMPUTING↗

Bayesian Framework for Bioburden Density Estimation in Planetary Protection

To comply with the international planetary protection policy set forth by the Committee on Space Research and NASA Agency level requirements, spacecraft destined to biologically sensitive planetary bodies have to minimize terrestrial biological contamination. Analysis, testing and inspection are the standard forward verification activities that are used to demonstrate compliance with the biological contamination requirements. For testing of spacecraft surface areas, a swab or wipe sample is collected from surfaces prior to last access and subsequently processed in the lab using NASA Approved Planetary Protection Methods for Culture Based Assays. Raw data resulting from this assay is then statistically treated employing a mathematical paradigm stemming from the 1970’s Viking Lander Project to generate the bioburden density and total microbial bioburden present. This standard approach arbitrarily accounts for error and provides an upper conservative bound as it reports the maximum number of spores estimated to be present on flight hardware surfaces. A bioburden density estimate factors in the following variables: the observed bioburden count, representative volume processed, sampling efficiencies. Notably, to account for error in the approach, a 0 observed count is arbitrarily changed to a count of 1 for each hardware grouping. The data generated by spacecraft bioburden verification campaigns in the past have resulted in <80% of wipes and <90% of swabs containing a bioburden count of 0. As such, having a robust and well documented statistical approach for dealing with the probability of low incident rates is necessary to be able to estimate spacecraft bioburden. Being able to statistically describe the bioburden distribution and associated confidence level is a gamechanger for the development of bioburden allocations during mission design and will allow for tighter management of risk throughout spacecraft build. Thus, Empirical Bayes statistical approach was evaluated to estimate the microbial bioburden on spacecraft to mitigate the aforementioned mathematical concerns and provide a probabilistic bioburden distribution of the flight hardware surface. For application of this approach to performing bioburden calculations, a range of non-informative prior assumptions on hardware surfaces are explored for Bayesian analyses while informative priors using posterior distributions from prior assays are utilized for Empirical Bayes analyses. Several non-informative priors are currently under investigation to assess fitness including use of these priors to serve as a foundation to build off of NASA specification values or a basis of risk to account for unknowns during the integration and testing process. Informative priors under consideration are generated using sampled bioburden values from hardware originating within like processing environments (e.g. vendor cleaning process or similar assembly process), temporal spacecraft status events as a prediction for hardware cleanliness of future samples, and heritage system bioburden actuals to predict allocation for subsequent missions. Informative priors and probabilistic bioburden distributions are then validated using data sets from the Mars Exploration Rover, Mars Science Laboratory, and InSight missions. Using Empirical Bayes approach to generate a probabilistic bioburden distribution as demonstrated through mission use cases provides a valid approach for use in the end-to-end requirements verification process.

97 - MATHEMATICS AND COMPUTING↗