Search NASA⌕ Search

SEARCH · Search NASA

Results for “probabilistic machine learning”

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 127 records · Page 7

How to Build a Quantum Supercomputer: Scaling from Hundreds to Millions of Qubits

In the span of four decades, quantum computation has evolved from an intellectual curiosity to a potentially realizable technology. Today, small-scale demonstrations have become possible for quantum algorithmic primitives on hundreds of physical qubits and proof-of-principle error-correction on a single logical qubit. Nevertheless, despite significant progress and excitement, the path toward a full-stack scalable technology is largely unknown. There are significant outstanding quantum hardware, fabrication, software architecture, and algorithmic challenges that are either unresolved or overlooked. These issues could seriously undermine the arrival of utility-scale quantum computers for the foreseeable future. Here, we provide a comprehensive review of these scaling challenges. We show how the road to scaling could be paved by adopting existing semiconductor technology to build much higher-quality qubits, employing system engineering approaches, and performing distributed quantum computation within heterogeneous high-performance computing infrastructures. These opportunities for research and development could unlock certain promising applications, in particular, efficient quantum simulation/learning of quantum data generated by natural or engineered quantum systems. To estimate the true cost of such promises, we provide a detailed resource and sensitivity analysis for classically hard quantum chemistry calculations on surface-code error-corrected quantum computers given current, target, and desired hardware specifications based on superconducting qubits, accounting for a realistic distribution of errors. Furthermore, we argue that, to tackle industry-scale classical optimization and machine learning problems in a cost-effective manner, heterogeneous quantum-probabilistic computing with custom-designed accelerators should be considered as a complementary path toward scalability.

Mohseni, Masoud↗

A Nonergodic Ground-Motion Model for the San Francisco Bay Area for Small-Magnitude Earthquakes

ABSTRACT Recently, generative models have become a computationally efficient alternative to physics-based numerical simulations of ground motions. Neural networks can learn from existing ground-motion data to generate unobserved ground-motion data at new source and site locations. A key challenge with generative models is ensuring that predicted ground motions remain within a physically realistic range. For this purpose, we developed an empirical, nonergodic ground-motion model (GMM) for small-magnitude earthquakes in the San Francisco Bay area based on about 5000 recordings per component for Mw ≤ 4 earthquakes. The nonergodic GMM predicts spatially varying median source, site, and path effects for both the Fourier amplitude spectrum (FAS) and the Fourier phase derivative (a proxy for duration), as well as the corresponding epistemic uncertainty for each term. For FAS, our model shows above-average source and site effects in the western part of the region and below-average effects in the eastern part, with regional effects exhibiting larger spatial correlation lengths with increasing frequency. For duration, the source term is negligible for small-magnitude earthquakes, and the site term leads to site-specific variations up to 5 s. Path effects for FAS and duration depend on the source–site pair and are extrapolated spatially using recent methods for path-effect modeling. The aleatory variability of the within-site within-path residuals is similar to the variability found in previous studies for other regions. The nonergodic model provides two key contributions: first, median adjustment terms that are transferable to larger magnitude earthquakes, further reducing aleatory variability in probabilistic seismic hazard analysis; second, region-specific criteria for validating machine learning-based ground-motion generators to evaluate whether synthetic ground motions exhibit physically realistic source, site, and path effects.

Lacour, Maxime↗

VFR Trajectory Forecasting using Deep Generative Model for Autonomous Airspace Operations

To enable the airspace integration of autonomous operations, such as uncrewed aircraft conducting cargo deliveries, there is a need to forecast the positions of the surrounding traffic with which they may interact. This paper focuses on forecasting Visual Flight Rules traffic, a significant source of uncertainty and risk in the airspace, especially around small regional airports, due to the unplanned and often untracked nature of such flights. A deep generative model is developed, trained on historical traffic data at example towered and non-towered airports, and used to predict flight trajectories. Experimental results are presented comparing the performance of variational autoencoder and classical machine learning forecasting when applied to both the towered and non-towered airports over varying time horizons. The results show the advantages of the variational autoencoder in producing accurate probabilistic forecasts over varying time horizons.

uncrewed aircraft↗

VFR Trajectory Forecasting using Deep Generative Model for Autonomous Airspace Operations

To enable the airspace integration of autonomous operations, such as uncrewed aircraft conducting cargo deliveries, there is a need to forecast the positions of the surrounding traffic with which they may interact. This paper focuses on forecasting Visual Flight Rules traffic, a significant source of uncertainty and risk in the airspace, especially around small regional airports, due to the unplanned and often untracked nature of such flights. A deep generative model is developed, trained on historical traffic data at example towered and non-towered airports, and used to predict flight trajectories. Experimental results are presented comparing the performance of variational autoencoder and classical machine learning forecasting when applied to both the towered and non-towered airports over varying time horizons. The results show the advantages of the variational autoencoder in producing accurate probabilistic forecasts over varying time horizons.

uncrewed aircraft↗

Exploring Advanced Computational Tools and Techniques with Artificial Intelligence and Machine Learning in Operating Nuclear Plants

This report presents the project Idaho National Laboratory conducted for Nuclear Regulatory Commission to explore the advanced computational tools and techniques, such as artificial intelligence (AI) and machine learning (ML), for operating nuclear plants. The report reviews the nuclear data sources, with the focus on the operating experience data, that could be applied by advanced computational tools and techniques. Plant-specific and generic (national and international) data from different sources are described. The report describes the relationships between statistics and AI/ML and then introduces the most widely used AI/ML algorithms in both supervised and unsupervised learning. The report reviews the recent applications of advanced computational tools and techniques in various fields of nuclear industry, such as reactor system design and analysis, plant operation and maintenance, and nuclear safety and risk analysis. Finally, the report presents the insights from the project on the potential applicability of AI/ML techniques in improving advanced computational capabilities, how the advanced tools and techniques could contribute to the understanding of safety and risk, and what information would be needed to provide meaningful insights to decision makers. The report also documents an NRC survey on the current state of commercial nuclear power operations relative to the use of AI and ML tools as well as the role of AI/ML tools in nuclear power operations was published by the NRC as in FRN NRC-2021-0048 in April 2021. A summary of the survey including the survey questions, survey participants, survey responses, and the conclusions and insights derived from the survey is provided in the report. Finally, the report investigates potential applications of using AI/ML in operating NPPs and advanced reactors (both advanced LWRs and advanced NLWRs) to improve nuclear plant safety and efficiency. Three main application fields are defined and discussed: (1) plant safety and security assessments; (2) plant degradation modeling, fault and accident diagnosis and prognosis; and (3) plant operation and maintenance efficiency improvement.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Probabilistic Wind Power Ramp Forecasting Based on a Scenario Generation Method

Wind power ramps (WPRs) are particularly important in the management and dispatch of wind power and currently drawing the attention of balancing authorities. With the aim to reduce the impact of WPRs for power system operations, this paper develops a probabilistic ramp forecasting method based on a large number of simulated scenarios. An ensemble machine learning technique is first adopted to forecast the basic wind power forecasting scenario and calculate the historical forecasting errors. A continuous Gaussian mixture model (GMM) is used to fit the probability distribution function (PDF) of forecasting errors. The cumulative distribution function (CDF) is analytically deduced. The inverse transform method based on Monte Carlo sampling and the CDF is used to generate a massive number of forecasting error scenarios. An optimized swinging door algorithm is adopted to extract all the WPRs from the complete set of wind power forecasting scenarios. The probabilistic forecasting results of ramp duration and start-time are generated based on all scenarios. Numerical simulations on publicly available wind power data show that within a predefined tolerance level, the developed probabilistic wind power ramp forecasting method is able to predict WPRs with a high level of sharpness and accuracy.

17 WIND ENERGY↗

Probabilistic Wind Power Ramp Forecasting Based on a Scenario Generation Method: Preprint

Wind power ramps (WPRs) are particularly important in the management and dispatch of wind power, and they are currently drawing the attention of balancing authorities. With the aim to reduce the impact of WPRs for power system operations, this paper develops a probabilistic ramp forecasting method based on a large number of simulated scenarios. An ensemble machine learning technique is first adopted to forecast the basic wind power forecasting scenario and calculate the historical forecasting errors. A continuous Gaussian mixture model (GMM) is used to fit the probability distribution function (PDF) of forecasting errors. The cumulative distribution function (CDF) is analytically deduced. The inverse transform method based on Monte Carlo sampling and the CDF is used to generate a massive number of forecasting error scenarios. An optimized swinging door algorithm is adopted to extract all the WPRs from the complete set of wind power forecasting scenarios. The probabilistic forecasting results of ramp duration and start time are generated based on all scenarios. Numerical simulations on publicly available wind power data show that within a predefined tolerance level, the developed probabilistic wind power ramp forecasting method is able to predict WPRs with a high level of sharpness and accuracy.

17 WIND ENERGY↗

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↗

Probabilistic Design Methodology and its Application to the Design of an Umbilical Retract Mechanism

A lot has been learned from past experience with structural and machine element failures. The understanding of failure modes and the application of an appropriate design analysis method can lead to improved structural and machine element safety as well as serviceability. To apply Probabilistic Design Methodology (PDM), all uncertainties are modeled as random variables with selected distribution types, means, and standard deviations. It is quite difficult to achieve a robust design without considering the randomness of the design parameters which is the case in the use of the Deterministic Design Approach. The US Navy has a fleet of submarine-launched ballistic missiles. An umbilical plug joins the missile to the submarine in order to provide electrical and cooling water connections. As the missile leaves the submarine, an umbilical retract mechanism retracts the umbilical plug clear of the advancing missile after disengagement during launch and retrains the plug in the retracted position. The design of the current retract mechanism in use was based on the deterministic approach which puts emphasis on factor of safety. A new umbilical retract mechanism that is simpler in design, lighter in weight, more reliable, easier to adjust, and more cost effective has become desirable since this will increase the performance and efficiency of the system. This paper reports on a recent project performed at Tennessee State University for the US Navy that involved the application of PDM to the design of an umbilical retract mechanism. This paper demonstrates how the use of PDM lead to the minimization of weight and cost, and the maximization of reliability and performance.

Onyebueke, Landon↗

Incorporating polar field data for improved solar flare prediction

In this paper, we consider incorporating data associated with the sun’s north and south polar field strengths to improve solar flare prediction performance using machine learning models. When used to supplement local data from active regions on the photospheric magnetic field of the sun, the polar field data provides global information to the predictor. While such global features have been previously proposed for predicting the next solar cycle’s intensity, in this paper we propose using them to help classify individual solar flares. We conduct experiments using HMI data employing four different machine learning algorithms that can exploit polar field information. Additionally, we propose a novel probabilistic mixture of experts model that can simply and effectively incorporate polar field data and provide on-par prediction performance with state-of-the-art solar flare prediction algorithms such as the Recurrent Neural Network (RNN). Our experimental results indicate the usefulness of the polar field data for solar flare prediction, which can improve Heidke Skill Score (HSS2) by as much as 10.1%.

79 ASTRONOMY AND ASTROPHYSICS↗

FIRST RESULTS FROM THE RAPID-RESPONSE SPECTROPHOTOMETRIC CHARACTERIZATION OF NEAR-EARTH OBJECTS USING UKIRT

Using the Wide Field Camera for the United Kingdom Infrared Telescope (UKIRT), we measure the near-infrared colors of near-Earth objects (NEOs) in order to put constraints on their taxonomic classifications. The rapid-response character of our observations allows us to observe NEOs when they are close to the Earth and bright. Here we present near-infrared color measurements of 86 NEOs, most of which were observed within a few days of their discovery, allowing us to characterize NEOs with diameters of only a few meters. Using machine-learning methods, we compare our measurements to existing asteroid spectral data and provide probabilistic taxonomic classifications for our targets. Our observations allow us to distinguish between S-complex, C/X-complex, D-type, and V-type asteroids. Our results suggest that the fraction of S-complex asteroids in the whole NEO population is lower than the fraction of ordinary chondrites in the meteorite fall statistics. Future data obtained with UKIRT will be used to investigate the significance of this discrepancy.

79 ASTRONOMY AND ASTROPHYSICS↗

Decentralized Collaborative Learning with Probabilistic Data Protection

We discuss future directions of Blockchain as a collaborative value co-creation platform, in which network participants can gain extra insights that cannot be accessed when disconnected from the others. As such, we propose a decentralized machine learning framework that is carefully designed to respect the values of democracy, diversity, and privacy. Specifically, we propose a federated multi-task learning framework that integrates a privacy-preserving dynamic consensus algorithm. We show that a specific network topology called the expander graph dramatically improves the scalability of global consensus building. We conclude the paper by making some remarks on open problems.

Ide, Tsuyoshi↗

Scalable statistical inference of photometric redshift via data subsampling

Handling big data has largely been a major bottleneck in traditional statistical models. Consequently, when accurate point prediction is the primary target, machine learning models are often preferred over their statistical counterparts for bigger problems. But full probabilistic statistical models often outperform other models in quantifying uncertainties associated with model predictions. We develop a data-driven statistical modeling framework that combines the uncertainties from an ensemble of statistical models learned on smaller subsets of data carefully chosen to account for imbalances in the input space. We demonstrate this method on a photometric redshift estimation problem in cosmology, which seeks to infer a distribution of the redshift—the stretching effect in observing the light of far-away galaxies—given multivariate color information observed for an object in the sky. Our proposed method performs balanced partitioning, graph-based data subsampling across the partitions, and training of an ensemble of Gaussian process models.

data subsampling↗

FuseIM: Fusing Probabilistic Traversals for Influence Maximization on Exascale Systems

Probabilistic breadth-first traversals (BPTs) are used in many network science and graph machine learning applications. In this paper, we are motivated by the application of BPTs in stochastic diffusion-based graph problems such as influence maximization. These applications heavily rely on BPTs to implement a Monte-Carlo sampling step for their approximations. Given the large sampling complexity, stochasticity of the diffusion process, and the inherent irregularity in real-world graph topologies, efficiently parallelizing these BPTs remains significantly challenging. In this paper, we present a new algorithm to fuse massive number of concurrently executing BPTs with random starts on the input graph. Our algorithm is designed to fuse BPTs by combining separate traversals into a unified frontier on distributed multi-GPU systems. To show the general applicability of the fused BPT technique, we have incorporated it into two state-of-the-art influence maximization parallel implementations (gIM and Ripples). Our experiments on up to 4K nodes of the OLCF Frontier supercomputer (32,768 GPUs and 196K CPU cores) show strong scaling behavior, and that fused BPTs can improve the performance of these implementations up to 34x (for gIM) and ~360x (for Ripples).

Neff, Reece W.↗

How Can Probabilistic Solar Power Forecasts Be Used to Lower Costs and Improve Reliability in Power Spot Markets? A Review and Application to Flexiramp Requirements

Net load uncertainty in electricity spot markets is rapidly growing. There are five general approaches by which system operators and market participants can use probabilistic forecasts of wind, solar, and load to help manage this uncertainty. These include operator situation awareness, resource risk hedging, reserves procurement, definition of contingencies, and explicit stochastic optimization. We review these approaches, and then provide a case study in which a method for using probabilistic solar forecasts to define needs for reserves is developed and evaluated. The case study has three parts. First, we describe building blocks for enhancing the Watt-Sun solar forecasting system to produce probabilistic irradiance and power forecasts. Second, relationships between Watt-Sun forecasts for multiple sites in California and the system's need for flexible ramp capability (flexiramp) are defined by machine learning and statistical methods. Third, the performance of present methods to defining flexiramp requirements, which are not conditioned on weather and renewables forecasts, is compared with that of probabilistic solar forecast-based requirements, using a multi-timescale production costing model with an 1820-bus representation of the WECC power system. Significant potential savings in fuel and flexiramp procurement costs from using solar-informed reserve requirements are found.

14 SOLAR ENERGY↗

A Data-Driven Methodology for Probabilistic Wind Power Ramp Forecasting

With increasing wind penetration, wind power ramps (WPRs) are currently drawing great attention to balancing authorities, since these wind ramps largely affect power system operations. To help better manage and dispatch the wind power, this paper develops a data-driven probabilistic WPR forecasting (p-WPRF) method based on a large number of simulated scenarios. A machine learning technique is first adopted to forecast the basic wind power forecasting scenario and produce the historical forecasting errors. To accurately model the distribution of wind power forecasting errors, a generalized Gaussian mixture model is developed and the cumulative distribution function (CDF) is also analytically deduced. The inverse transform method based on the CDF is used to generate a large number of forecasting error scenarios. An optimized swinging door algorithm is adopted to extract all the WPRs from the complete set of wind power forecasting scenarios. The p-WPRF is generated based on all generated scenarios under different weather and time conditions. Numerical simulations on publicly available wind power data show that the developed p-WPRF method can predict WPRs with a high level of reliability and accuracy.

17 WIND ENERGY↗

Forecasting Marine Sediment Properties with Geospatial Machine Learning

Using a combination of geospatial machine learning prediction and sediment thermodynamic/physical modeling, we have developed a novel software workflow to create probabilistic maps of geoacoustic and geomechanical sediment properties of the global seabed. This new technique for producing reliable estimates of seafloor properties can better support Naval operations relying on sonar performance and seabed strength, can constrain models of shallow tomographic structure important for nuclear treaty compliance monitoring/detection, and can provide constraints on the distribution and inventory of shallow methane gas and gas hydrate accumulations on the continental shelves.

58 GEOSCIENCES↗

A Bayesian Approach to Predict Solubility Parameters

Abstract Solubility is a ubiquitous phenomenon in many aspects of material science. While solubility can be determined by considering the cohesive forces in a liquid via the Hansen solubility parameters (HSP), quantitative structure–property relationship models are often used for prediction, notably due to their low computational cost. Here, gpHSP, an interpretable and versatile probabilistic approach to determining HSP, is reported. Our model is based on Gaussian processes, a Bayesian machine learning approach that provides uncertainty bounds to prediction. gpHSP achieves its flexibility by leveraging a variety of input data, such as SMILES strings, COSMOtherm simulations, and quantum chemistry calculations. gpHSP is built on experimentally determined HSP, including a general solvents set aggregated from the literature, and a polymer set experimentally characterized by this group of authors. In all sets, a high degree of agreement is obtained, surpassing well‐established machine learning methods. The general applicability of gpHSP to miscibility of organic semiconductors, drug compounds, and in general solvents is demonstrated, which can be further extended to other domains. gpHSP is a fast and accurate toolbox, which could be applied to molecular design for solution processing technologies.

Sanchez‐Lengeling, Benjamin↗