Search NASA⌕ Search

SEARCH · Search NASA

Results for “Traditional 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 523 records · Page 29

Physics-informed Machine Learning Method for Forecasting and Uncertainty Quantification of Partially Observed and Unobserved States in Power Grids

We present a physics-informed Gaussian Process Regression (GPR) model to predict the phase angle, angular speed, and wind mechanical power from a limited number of measurements. In the traditional data-driven GPR method, the form of the Gaussian Process covariance matrix is assumed and its parameters are found from measurements. In the physics-informed GPR, we treat unknown variables (including wind speed and mechanical power) as a random process and compute the covariance matrix from the resulting stochastic power grid equations. We demonstrate that the physics-informed GPR method is significantly more accurate than the standard data-driven one for immediate forecasting of generators' angular velocity and phase angle. We also show that the physics-informed GPR provides accurate predictions of the unobserved wind mechanical power, phase angle, or angular velocity when measurements from only one of these variables are available. The immediate forecast of observed variables and predictions of unobserved variables can be used for effectively managing power grids (electricity market clearing, regulation actions) and early detection of abnormal behavior and faults. The physics-based GPR forecast time horizon depends on the combination of input (wind power, load, etc.) correlation time and characteristic (relaxation) time of the power grid and can be extended to short and medium-range times.

machine learning, power grid, forecasting, Gaussia↗

SU-E-J-254: Evaluating the Role of Mid-Treatment and Post-Treatment FDG-PET/CT in Predicting Progression-Free Survival and Distant Metastasis of Anal Cancer Patients Treated with Chemoradiotherapy

Purpose: To evaluate the role of mid-treatment and post-treatment FDG-PET/CT in predicting progression-free survival (PFS) and distant metastasis (DM) of anal cancer patients treated with chemoradiotherapy (CRT). Methods: 17 anal cancer patients treated with CRT were retrospectively studied. The median prescription dose was 56 Gy (range, 50–62.5 Gy). All patients underwent FDG-PET/CT scans before and after CRT. 16 of the 17 patients had an additional FDG-PET/CT image at 3–5 weeks into the treatment (denoted as mid-treatment FDG-PET/CT). 750 features were extracted from these three sets of scans, which included both traditional PET/CT measures (SUVmax, SUVpeak, tumor diameters, etc.) and spatialtemporal PET/CT features (comprehensively quantify a tumor’s FDG uptake intensity and distribution, spatial variation (texture), geometric property and their temporal changes relative to baseline). 26 clinical parameters (age, gender, TNM stage, histology, GTV dose, etc.) were also analyzed. Advanced analytics including methods to select an optimal set of predictors and a model selection engine, which identifies the most accurate machine learning algorithm for predictive analysis was developed. Results: Comparing baseline + mid-treatment PET/CT set to baseline + posttreatment PET/CT set, 14 predictors were selected from each feature group. Same three clinical parameters (tumor size, T stage and whether 5-FU was held during any cycle of chemotherapy) and two traditional measures (pre- CRT SUVmin and SUVmedian) were selected by both predictor groups. Different mix of spatial-temporal PET/CT features was selected. Using the 14 predictors and Naive Bayes, mid-treatment PET/CT set achieved 87.5% accuracy (2 PFS patients misclassified, all local recurrence and DM patients correctly classified). Post-treatment PET/CT set achieved 94.0% accuracy (all PFS and DM patients correctly predicted, 1 local recurrence patient misclassified) with logistic regression, neural network or support vector machine model. Conclusion: Applying radiomics approach to either midtreatment or post-treatment PET/CT could achieve high accuracy in predicting anal cancer treatment outcomes. This work was supported in part by the National Cancer Institute Grant R01CA172638.

60 APPLIED LIFE SCIENCES↗

High-Resolution Meteorology with Climate Change Impacts from Global Climate Model Data Using Generative Machine Learning

As renewable energy generation increases, the impacts of weather and climate on energy generation and demand become critical to the reliability of the energy system. However, these impacts are often overlooked. Global climate models (GCMs) can be used to understand possible changes to our climate, but their coarse resolution makes them difficult to use in energy system modelling. Here we present open-source generative machine learning methods that produce meteorological data at a nominal spatial resolution of 4 km at an hourly frequency based on inputs from 100 km daily-average GCM data. These methods run 40 times faster than traditional downscaling methods and produce data that have high-resolution spatial and temporal attributes similar to historical datasets. We demonstrate that these methods can be used to downscale projected changes in wind, solar and temperature variables across multiple GCMs including projections for more frequent low-wind and high-temperature events in the Eastern United States.

climate change↗

Augmenting machine learning of energy landscapes with local structural information

We present a machine learning approach for accurately predicting formation energies of binary compounds in the context of crystal structure predictions. The success of any machine learning model depends significantly on the choice of representation used to encode the relevant physical information into machine-learnable data. We test different representation schemes based on partial radial and angular distribution functions (RDF+ADF) on Al–Ni and Cd–Te structures generated using our genetic algorithm for structure prediction. We observe a remarkable improvement in predictive accuracy upon transitioning from global to atom-centered representations, resulting in a threefold decrease in prediction errors. We show that a support vector regression model using a combination of atomic radial and angular distribution functions performs best at the formation energy prediction task, providing small root mean squared errors of 3.9 meV/atom and 10.9 meV/atom for Al–Ni and Cd–Te, respectively. We test the performance of our models against common traditional descriptors and find that RDF- and ADF-based representations significantly outperform many of those in the prediction of formation energies. The high accuracy of predictions makes our machine learning models great candidates for the exploration of energy landscapes.

Honrao, Shreyas J. (ORCID:0000000166155257)↗

A Perspective on Traditional and Data Driven Electrochemical Modeling and Analysis

To understand the behavior of electrochemical systems, we need to reduce the dimensionality of the measured current-voltage-time (I-V-t) data by fitting models, thus enabling us to analyze and compare the governing physics. Traditionally, the process for this is an 'expert first' approach: defining the model and its explicit assumptions based on inductive reasoning or empirical observation, fitting small portions of the I-V-t data where assumptions are most valid or carefully designing experiments to enforce key assumptions, and then interpreting the model parameters. However, modern data-driven methods enable a new paradigm: a 'data first' approach, where the latent behaviors governing the system's measured response are identified directly using machine-learning models that optimize both model structure and parameters from the I-V-t data, guaranteeing that the learned model explains as much of the observed system response as possible. After model identification, the model can then be interrogated by an expert to connect observed behaviors with underlying physics. This talk will review several different types of electrochemical analysis (electrochemical impedance, differential voltage-capacity, electrochemical kinetics) and compare the traditional and data-driven methods for analyzing the data.

42 ENGINEERING↗

Use of Machine Learning for Signature Development in a Multi-Sensor Environment for Safeguard Applications of Solvent Extraction Processes

Idaho National Laboratory is constructing the Special Nuclear Material test bed (Beartooth) for research and development pertaining to nuclear fuel processing operations using centrifugal contactors. Beartooth will enable give researchers the opportunity to study the dissolution, separation, and conversion of special nuclear materials (e.g., plutonium, enriched uranium, and thorium). As a lead-in to Beartooth, this project constructed a test bed to study the process and equipment behavior with real time series data collection using a variety of non-traditional sensors, in order to identify process failures and label them as either accidental or purposeful, thus enhancing nuclear nonproliferation stewardship. The measurement sources in this test bed include vibration, acoustic, current, flow, colorimetric, and thermal data. These measurements vary in terms of magnitude, frequency, and location. This information will be combined and used within data-driven machine-learning methods to detect operation condition changes that are either intentional (i.e., changes in operating set points) or malicious (i.e., flow diversion) in nature. This presentation covers the data processing and signature development activities necessary for utilizing this heterogeneous dataset to classify process anomalies.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Long-term survival and second malignant tumor prediction in pediatric, adolescent, and young adult cancer survivors using Random Survival Forests: a SEER analysis

Abstract Survival and second malignancy prediction models can aid clinical decision making. Most commonly, survival analysis studies are performed using traditional proportional hazards models, which require strong assumptions and can lead to biased estimates if violated. Therefore, this study aims to implement an alternative, machine learning (ML) model for survival analysis: Random Survival Forest (RSF). In this study, RSFs were built using the U.S. Surveillance Epidemiology and End Results to (1) predict 30-year survival in pediatric, adolescent, and young adult cancer survivors; and (2) predict risk and site of a second tumor within 30 years of the first tumor diagnosis in these age groups. The final RSF model for pediatric, adolescent, and young adult survival has an average Concordance index (C-index) of 92.9%, 94.2%, and 94.4% and average time-dependent area under the receiver operating characteristic curve (AUC) at 30-years since first diagnosis of 90.8%, 93.6%, 96.1% respectively. The final RSF model for pediatric, adolescent, and young adult second malignancy has an average C-index of 86.8%, 85.2%, and 88.6% and average time-dependent AUC at 30-years since first diagnosis of 76.5%, 88.1%, and 99.0% respectively. This study suggests the robustness and potential clinical value of ML models to alleviate physician burden by quickly identifying highest risk individuals.

60 APPLIED LIFE SCIENCES↗

Machine learning-enhanced model-based scenario optimization for DIII-D

Abstract Scenario development in tokamaks is an open area of investigation that can be approached in a variety of different ways. Experimental trial and error has been the traditional method, but this required a massive amount of experimental time and resources. As high fidelity predictive models have become available, offline development and testing of proposed scenarios has become an option to reduce the required experimental resources. The use of predictive models also offers the possibility of using a numerical optimization process to find the controllable inputs that most closely achieve the desired plasma state. However, this type of optimization can require as many as hundreds or thousands of predictive simulation cases to converge to a solution; many of the commonly used high fidelity models have high computational burdens, so it is only reasonable to run a handful of predictive simulations. In order to make use of numerical optimization approaches, a compromise needs to be found between model fidelity and computational burden. This compromise can be achieved using neural networks surrogates of high fidelity models that retain nearly the same level of accuracy as the models they are trained to replicate while reducing the computation time by orders of magnitude. In this work, a model-based numerical optimization tool for scenario development is described. The predictive model used by the optimizer includes neural network surrogate models integrated into the fast Control-Oriented Transport simulation framework. This optimization scheme is able to converge to the optimal values of the controllable inputs that produce the target plasma scenario by running thousands of predictive simulations in under an hour without sacrificing too much prediction accuracy.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Strategies for Integrating Deep Learning Surrogate Models with HPC Simulation Applications

The emerging trend of the convergence of high performance computing (HPC), machine learning/deep learning (ML/DL), and big data analytics presents a host of challenges for large-scale computing campaigns that seek best practices to interleave traditional scientific simulation-based workloads with ML/DL models. A portfolio of systematic approaches to incorporate deep learning into modeling and simulation serves a vital need when we support AI for science at a computing facility. In this paper, we evaluate several strategies for deploying deep learning surrogate models in a representative physics application on supercomputers at the Oak Ridge Leadership Computing Facility (OLCF). We discuss a set of recommended deployment architectures and implementation approaches. We analyze and evaluate these alternatives and show their performance and scalability up to 1000 GPUs on two mainstream platforms equipped with different deep learning hardware and software stacks.

Yin, Junqi↗

A Comprehensive Analysis of PINNs for Power System Transient Stability

The integration of machine learning in power systems, particularly in stability and dynamics, addresses the challenges brought by the integration of renewable energies and distributed energy resources (DERs). Traditional methods for power system transient stability, involving solving differential equations with computational techniques, face limitations due to their time-consuming and computationally demanding nature. This paper introduces physics-informed Neural Networks (PINNs) as a promising solution for these challenges, especially in scenarios with limited data availability and the need for high computational speed. PINNs offer a novel approach for complex power systems by incorporating additional equations and adapting to various system scales, from a single bus to multi-bus networks. Our study presents the first comprehensive evaluation of physics-informed Neural Networks (PINNs) in the context of power system transient stability, addressing various grid complexities. Additionally, we introduce a novel approach for adjusting loss weights to improve the adaptability of PINNs to diverse systems. Our experimental findings reveal that PINNs can be efficiently scaled while maintaining high accuracy. Furthermore, these results suggest that PINNs significantly outperform the traditional ode45 method in terms of efficiency, especially as the system size increases, showcasing a progressive speed advantage over ode45.

97 MATHEMATICS AND COMPUTING↗

A Comprehensive Analysis of PINNs for Power System Transient Stability

The integration of machine learning in power systems, particularly in stability and dynamics, addresses the challenges brought by the integration of renewable energies and distributed energy resources (DERs). Traditional methods for power system transient stability, involving solving differential equations with computational techniques, face limitations due to their time-consuming and computationally demanding nature. This paper introduces physics-informed Neural Networks (PINNs) as a promising solution for these challenges, especially in scenarios with limited data availability and the need for high computational speed. PINNs offer a novel approach for complex power systems by incorporating additional equations and adapting to various system scales, from a single bus to multi-bus networks. Our study presents the first comprehensive evaluation of physics-informed Neural Networks (PINNs) in the context of power system transient stability, addressing various grid complexities. Additionally, we introduce a novel approach for adjusting loss weights to improve the adaptability of PINNs to diverse systems. Our experimental findings reveal that PINNs can be efficiently scaled while maintaining high accuracy. Furthermore, these results suggest that PINNs significantly outperform the traditional ode45 method in terms of efficiency, especially as the system size increases, showcasing a progressive speed advantage over ode45.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Coarse Graining Discrete Element Method Information in Particle-in-Cell Length Scales Using a Machine Learning Approach

This report details the development of a machine learning (ML)-driven framework to coarse-grain inter-particle collision dynamics from high-fidelity Discrete Element Method (DEM) simulations to Particle-in-Cell (PIC) scales for gas-solid systems. Traditional PIC models, while computationally efficient, rely on empirical granular stress formulations that fail to capture the full complexity of collision physics, particularly the heterogeneity in particle dynamics. This study adopts a bottom-up approach, integrating insights from DEM simulations to improve the physical fidelity and interpretability of PIC-scale models.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Detecting depinning and nonequilibrium transitions with unsupervised machine learning

Using numerical simulations of a model disk system, we demonstrate that a machine learning generated order-parameter-like measure can detect depinning transitions and different dynamic flow phases in systems driven far from equilibrium. Furthermore, we specifically consider monodisperse passive disks with short range interactions undergoing a depinning phase transition when driven over quenched disorder. The machine learning derived order-parameter-like measure identifies the depinning transition as well as different dynamical regimes, such as the transition from a flowing liquid to a phase separated liquid-solid state that is not readily distinguished with traditional measures such as velocity-force curves or Voronoi tessellation. The order-parameter-like measure also shows markedly distinct behavior in the limit of high density where jamming effects occur. Our results should be general to the broad class of particle-based systems that exhibit depinning transitions and nonequilibrium phase transitions.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Multifidelity Ensemble Kalman Filtering Using Surrogate Models Defined by Theory-Guided Autoencoders

Data assimilation is a Bayesian inference process that obtains an enhanced understanding of a physical system of interest by fusing information from an inexact physics-based model, and from noisy sparse observations of reality. The multifidelity ensemble Kalman filter (MFEnKF) recently developed by the authors combines a full-order physical model and a hierarchy of reduced order surrogate models in order to increase the computational efficiency of data assimilation. The standard MFEnKF uses linear couplings between models, and is statistically optimal in case of Gaussian probability densities. This work extends the MFEnKF into to make use of a broader class of surrogate model such as those based on machine learning methods such as autoencoders non-linear couplings in between the model hierarchies. We identify the right-invertibility property for autoencoders as being a key predictor of success in the forecasting power of autoencoder-based reduced order models. We propose a methodology that allows us to construct reduced order surrogate models that are more accurate than the ones obtained via conventional linear methods. Numerical experiments with the canonical Lorenz'96 model illustrate that nonlinear surrogates perform better than linear projection-based ones in the context of multifidelity ensemble Kalman filtering. We additionality show a large-scale proof-of-concept result with the quasi-geostrophic equations, showing the competitiveness of the method with a traditional reduced order model-based MFEnKF.

97 MATHEMATICS AND COMPUTING↗

State predictive information bottleneck

We report the ability to make sense of the massive amounts of high-dimensional data generated from molecular dynamics simulations is heavily dependent on the knowledge of a low-dimensional manifold (parameterized by a reaction coordinate or RC) that typically distinguishes between relevant metastable states, and which captures the relevant slow dynamics of interest. Methods based on machine learning and artificial intelligence have been proposed over the years to deal with learning such low-dimensional manifolds, but they are often criticized for a disconnect from more traditional and physically interpretable approaches. To deal with such concerns, in this work we propose a deep learning based state predictive information bottleneck approach to learn the RC from high-dimensional molecular simulation trajectories. We demonstrate analytically and numerically how the RC learnt in this approach is connected to the committor in chemical physics and can be used to accurately identify transition states. A crucial hyperparameter in this approach is the time delay or how far into the future the algorithm should make predictions about. Through careful comparisons for benchmark systems, we demonstrate that this hyperparameter choice gives useful control over how coarse-grained we want the metastable state classification of the system to be. We thus believe that this work represents a step forward in systematic application of deep learning based ideas to molecular simulations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

SymbolFit: Automatic Parametric Modeling with Symbolic Regression

We introduce SymbolFit (API: https://github.com/hftsoi/symbolfit), a framework that automates parametric modeling by using symbolic regression to perform a machine-search for functions that fit the data while simultaneously providing uncertainty estimates in a single run. Traditionally, constructing a parametric model to accurately describe binned data has been a manual and iterative process, requiring an adequate functional form to be determined before the fit can be performed. The main challenge arises when the appropriate functional forms cannot be derived from first principles, especially when there is no underlying true closed-form function for the distribution. In this work, we develop a framework that automates and streamlines the process by utilizing symbolic regression, a machine learning technique that explores a vast space of candidate functions without requiring a predefined functional form because the functional form itself is treated as a trainable parameter, making the process far more efficient and effortless than traditional regression methods. We demonstrate the framework in high-energy physics experiments at the CERN Large Hadron Collider (LHC) using five real proton-proton collision datasets from new physics searches, including background modeling in resonance searches for high-mass dijet, trijet, paired-dijet, diphoton, and dimuon events. We show that our framework can flexibly and efficiently generate a wide range of candidate functions that fit a nontrivial distribution well using a simple fit configuration that varies only by random seed, and that the same fit configuration, which defines a vast function space, can also be applied to distributions of different shapes, whereas achieving a comparable result with traditional methods would have required extensive manual effort.

Tsoi, Ho Fung [Univ. of Pennsylvania, Philadelphia↗

Learning robust parameter inference and density reconstruction in flyer plate impact experiments

Estimating physical parameters or material properties from experimental observations is a common objective in many areas of physics and material science. In many experiments, especially in shock physics, radiography is the primary means of observing the system of interest. However, radiography does not provide direct access to key state variables, such as density, which prevents the application of traditional parameter estimation approaches. Here we focus on flyer plate impact experiments on porous materials, and resolving the underlying parameterized equation of state (EoS) and crush porosity model parameters given radiographic observation(s). We use machine learning as a tool to demonstrate with high confidence that using only high impact velocity data does not provide sufficient information to accurately infer both EoS and crush model parameters, even with fully resolved density fields or a dynamic sequence of images. We thus propose an observable data set consisting of low and high impact velocity experiments/simulations that capture different regimes of compaction and shock propagation, and proceed to introduce a generative machine learning approach which produces a posterior distribution of physical parameters directly from radiographs. We demonstrate the effectiveness of the approach in estimating parameters from simulated flyer plate impact experiments, and show that the obtained estimates of EoS and crush model parameters can then be used in hydrodynamic simulations to obtain accurate and physically admissible density reconstructions. Finally, we examine the robustness of the approach to model mismatches, and find that the learned approach can provide useful parameter estimates in the presence of out-of-distribution radiographic noise and previously unseen physics, thereby promoting a potential breakthrough in estimating material properties from experimental radiographic images.

97 MATHEMATICS AND COMPUTING↗

Sparse Cholesky factorization for solving nonlinear PDEs via Gaussian processes

In recent years, there has been widespread adoption of machine learning-based approaches to automate the solving of partial differential equations (PDEs). Among these approaches, Gaussian processes (GPs) and kernel methods have garnered considerable interest due to their flexibility, robust theoretical guarantees, and close ties to traditional methods. They can transform the solving of general nonlinear PDEs into solving quadratic optimization problems with nonlinear, PDE-induced constraints. However, the complexity bottleneck lies in computing with dense kernel matrices obtained from pointwise evaluations of the covariance kernel, and its partial derivatives, a result of the PDE constraint and for which fast algorithms are scarce. The primary goal of this paper is to provide a near-linear complexity algorithm for working with such kernel matrices. We present a sparse Cholesky factorization algorithm for these matrices based on the near-sparsity of the Cholesky factor under a novel ordering of pointwise and derivative measurements. The near-sparsity is rigorously justified by directly connecting the factor to GP regression and exponential decay of basis functions in numerical homogenization. We then employ the Vecchia approximation of GPs, which is optimal in the Kullback-Leibler divergence, to compute the approximate factor. This enables us to compute ϵ-approximate inverse Cholesky factors of the kernel matrices with complexity O(N log d (N/ϵ)) in space and O(N log 2d (N/ϵ)) in time. We integrate sparse Cholesky factorizations into optimization algorithms to obtain fast solvers of the nonlinear PDE. We numerically illustrate our algorithm’s near-linear space/time complexity for a broad class of nonlinear PDEs such as the nonlinear elliptic, Burgers, and Monge-Ampère equations. In summary, we provide a fast, scalable, and accurate method for solving general PDEs with GPs and kernel methods.

97 MATHEMATICS AND COMPUTING↗