Search NASA⌕ Search

SEARCH · Search NASA

Results for “kernel machine methods”

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

Prediction of Adsorption Energies for Chemical Species on Metal Catalyst Surfaces Using Machine Learning

Computational catalyst screening has the potential to significantly accelerate heterogeneous catalyst discovery. Typically, this involves developing microkinetic reactor models that are based on parameters obtained from density functional theory and transition-state theory. To reduce the large computational cost involved in computing various adsorption and transition-state energies of all possible surface states on a large number of catalyst models, linear scaling relations for surface intermediates and transition states have been developed that only depend on a few, typically one or two descriptors, such as the carbon atom adsorption energy. As a result, only the descriptor values have to be computed for various active site models to generate volcano curves in activity or selectivity. Unfortunately, for more complex chemistries the predictability of linear scaling relations is unknown. Also, the selection of descriptors is essentially a trial and error process. Here, using a database of adsorption energies of the surface species involved in the decarboxylation and decarbonylation of propionic acid over eight monometalic transition-metal catalyst surfaces (Ni, Pt, Pd, Ru, Rh, Re, Cu, Ag), we tested if nonlinear machine learning (ML) models can outperform the linear scaling relations in prediction accuracy when predicting the adsorption energy for various species on a metal surface based on data from the rest of the metal surfaces. We found linear scaling relations to hold well for predictions across metals with a mean-absolute error of 0.12 eV, and ML methods being unable to outperform linear scaling relations when the training dataset contains a complete set of energies for all of the species on various metal surfaces. Only when the training dataset is incomplete, namely, contains a random subset of species’ energies for each metal, a currently unlikely scenario for catalyst screening, do kernel-based ML models significantly outperform linear scaling relations. We also found that simple coordinate-free species descriptors, such as bond counts, achieve as good results as sophisticated coordinate-based descriptors. Finally, we propose an approach for automatic discovery of appropriate metal descriptors using principal component analysis.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2021

On the eigenvector bias of Fourier feature networks: From regression to solving multi-scale PDEs with physics-informed neural networks

Physics-informed neural networks (PINNs) are demonstrating remarkable promise in integrating physical models with gappy and noisy observational data, but they still struggle in cases where the target functions to be approximated exhibit high-frequency or multi-scale features. Here in this work we investigate this limitation through the lens of Neural Tangent Kernel (NTK) theory and elucidate how PINNs are biased towards learning functions along the dominant eigen-directions of their limiting NTK. Using this observation, we construct novel architectures that employ spatio-temporal and multi-scale random Fourier features, and justify how such coordinate embedding layers can lead to robust and accurate PINN models. Numerical examples are presented for several challenging cases where conventional PINN models fail, including wave propagation and reaction–diffusion dynamics, illustrating how the proposed methods can be used to effectively tackle both forward and inverse problems involving partial differential equations with multi-scale behavior.

42 ENGINEERING↗
NASA NTRSDate not supplied

Hyperspectral Sounder Spectral Fingerprinting: Using Machine Learning Techniques to Enhance Model-Based Physical Inversion

Different retrieval algorithms have been developed to process top-of-atmosphere (TOA) spectral radiance data provided by hyperspectral infrared sounder missions. Those algorithms are either optimal estimation method (OEM) based schemes with radiative transfer calculation involved in the retrieval process, or machine learning based methods that allow ultra-efficient data procession but lack of radiometric consistency validation based on the directly measured information. Combining both approaches leverages their respective technical advantages, leading to more accurate results. This study introduces a hyperspectral sounder fingerprinting algorithm to explore this hybrid approach. This approach involves the use of a spectral information-based classification method to identify an reference geophysical state and the corresponding radiative kernel. This enables the efficient retrieval of geophysical variables of interest through a radiative kernel-based linear inversion procedure. The fingerprinting method has been applied to analyze a decade-long hyperspectral sounder data record.

Wan Wu↗
DOE OSTI2025

Kernel methods for evolution of generalized parton distributions

Generalized parton distributions (GPDs) characterize the 3-dimensional structure of hadrons, combining information about their internal quark and gluon longitudinal momentum distributions and transverse position within the hadron. The dependence of GPDs on the factorization scale Q 2 allows one to connect hard exclusive processes involving GPDs at disparate energy and momentum scales, which is needed in global analyses of experimental data. Here, in this work, we explore how finite element methods can be used to construct fast and differentiable Q 2 evolution codes for GPDs in momentum space, which can be used in a machine learning framework. We show numerical benchmarks of the methods' accuracy, including a comparison to an existing evolution code from PARTONS/APFEL++, and provide a repository where the code can be accessed.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Weighted Composition Operators for Learning Nonlinear Dynamics

Operator theoretic methods in dynamical system have been dominated by the use of Koopman operators and their continuous time counterparts, such as Koopman Generators and Liouville Operators. The advantage gained from their use primarily stems from the ability to extract subspaces and eigenfunctions within a space of observables that are invariant with respect to the Koopman operator over that space. When this occurs, a dynamic mode decomposition of the systems state provides a linear model for the dynamical system. Not all Koopman operators have eigenfunctions that may be exploited in this manner. However, the framework can still be leveraged for approximations using other operators. In this setting, we present a different operator for the study of dynamical systems, the weighted composition operator. These operators are compact for a wide range of dynamics and spaces, and through their interactions with occupation kernels and vector valued kernels, they admit an estimation of the underlying dynamics. Here, this manuscript presents a new algorithm for the data driven study of dynamical systems from data, and also provides two numerical experiments where convergence is achieved as a proof of concept.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Liquid–Vapor Phase Equilibrium in Molten Aluminum Chloride (AlCl 3 ) Enabled by Machine Learning Interatomic Potentials

Molten salts are promising candidates in numerous clean energy applications, where knowledge of thermophysical properties and vapor pressure across their operating temperature ranges is critical for safe operations. Due to challenges in evaluating these properties using experimental methods, fast and scalable molecular simulations are essential to complement the experimental data. In this study, we developed machine learning interatomic potentials (MLIP) to study the AlCl 3 molten salt across varied thermodynamic conditions (T = 473–613 K and P = 2.7–23.4 bar), which allowed us to predict temperature-surface tension correlations and liquid–vapor phase diagram from direct simulations of two-phase coexistence in this molten salt. Two MLIP architectures, a Kernel-based potential and neural network interatomic potential (NNIP), were considered to benchmark their performance for AlCl 3 molten salt using experimental structure and density values. The NNIP potential employed in two-phase equilibrium simulations yields the critical temperature and critical density of AlCl 3 that are within 10 K (∼3%) and 0.03 g/cm 3 (∼7%) of the reported experimental values. An accurate correlation between temperature and viscosities is obtained as well. In doing so, we report that the inclusion of low-density configurations in their training is critical to more accurately represent the AlCl 3 system across a wide phase-space. The MLIP trained using PBE-D3 functional in the ab initio molecular dynamics (AIMD) simulations (120 atoms) also showed close agreement with experimentally determined molten salt structure comprising Al 2 Cl 6 dimers, as validated using Raman spectra and neutron structure factor. Furthermore, the PBE-D3 as well as its trained MLIP showed better liquid density and temperature correlation for AlCl 3 system when compared to several other density functionals explored in this work. Overall, the demonstrated approach to predict temperature correlations for liquid and vapor densities in this study can be employed to screen nuclear reactors-relevant compositions, helping to mitigate safety concerns.

Ab initio molecular dynamics↗
DOE OSTI2022

Inferring safety critical events from vehicle kinematics in naturalistic driving environment: Application of deep learning Algorithms

Advances in sensing technology has enabled the collection of countless terabytes of second-by-second kinematics data. Such data provides opportunities for real-time monitoring of driving behavior and identification of safety critical events (SCEs) including crashes and near crashes. The concept of volatility is relevant in this context, which identifies instability and erratic variations in driving behavior prior to involvement in SCEs. This study utilized vehicle kinematics from a large-scale naturalistic driving data to develop a deep learning approach based on 1D convolutional neural networks (CNN) for inferring SCEs. The data are unique in the sense that such accurate pre-crash data at high fidelity are not available in traditional crash repositories. This study contributes to the literature by providing a first attempt at predicting responses to SCEs by developing deep learning-based CNN architectures using novel driving volatility based kinematic thresholds for a sample of 9553 events. The key contribution lies in developing a volatility-based CNN input layout that is acceptable to CNN schemes and represents the motion kinematics such as speed, acceleration and volatility measures. Several 1D-CNN architectures were developed using layers, numbers of convolutions, layer patterns, and kernels. Shallow and deep architectures were tested, revealing higher accuracy of shallow architectures in detecting SCEs. The optimal number of epochs were identified using an early stopping method while the CNN performance was improved by increasing the number of epochs. The ensemble CNN had the highest predictive accuracy of 95.6% for detection of crashes and near crashes, which was 2.5% higher than the optimal CNN using 20% hold out test data. The ensemble CNN also outperformed classical machine learning models and model performance reported in past studies on detection of SCEs. Finally, these results have implications for identification of safety hotspots and providing real-time alerts and warnings in connected and highly automated vehicle environment including society of automotive engineers levels 3–5.

42 ENGINEERING↗
NASA NTRS2002

Protein Kinase Classification with 2866 Hidden Markov Models and One Support Vector Machine

The main application considered in this paper is predicting true kinases from randomly permuted kinases that share the same length and amino acid distributions as the true kinases. Numerous methods already exist for this classification task, such as HMMs, motif-matchers, and sequence comparison algorithms. We build on some of these efforts by creating a vector from the output of thousands of structurally based HMMs, created offline with Pfam-A seed alignments using SAM-T99, which then must be combined into an overall classification for the protein. Then we use a Support Vector Machine for classifying this large ensemble Pfam-Vector, with a polynomial and chisquared kernel. In particular, the chi-squared kernel SVM performs better than the HMMs and better than the BLAST pairwise comparisons, when predicting true from false kinases in some respects, but no one algorithm is best for all purposes or in all instances so we consider the particular strengths and weaknesses of each.

Weber, Ryan↗
DOE OSTI2022

An Efficient Bayesian Approach to Learning Droplet Collision Kernels: Proof of Concept Using “Cloudy,” a New n -Moment Bulk Microphysics Scheme

The small-scale microphysical processes governing the formation of precipitation particles cannot be resolved explicitly by cloud resolving and climate models. Instead, they are represented by microphysics schemes that are based on a combination of theoretical knowledge, statistical assumptions, and fitting to data (“tuning”). Historically, tuning was done in an ad hoc fashion, leading to parameter choices that are not explainable or repeatable. Recent work has treated it as an inverse problem that can be solved by Bayesian inference. The posterior distribution of the parameters given the data—the solution of Bayesian inference—is found through computationally expensive sampling methods, which require over $\mathcal{O}$(10 5 ) evaluations of the forward model; this is prohibitive for many models. We present a proof of concept of Bayesian learning applied to a new bulk microphysics scheme named “Cloudy,” using the recently developed Calibrate-Emulate-Sample (CES) algorithm. Cloudy models collision-coalescence and collisional breakup of cloud droplets with an adjustable number of prognostic moments and with easily modifiable assumptions for the cloud droplet mass distribution and the collision kernel. The CES algorithm uses machine learning tools to accelerate Bayesian inference by reducing the number of forward evaluations needed to $\mathcal{O}$(10 2 ). It also exhibits a smoothing effect when forward evaluations are polluted by noise. In a suite of perfect-model experiments, we show that CES enables computationally efficient Bayesian inference of parameters in Cloudy from noisy observations of moments of the droplet mass distribution. In an additional imperfect-model experiment, a collision kernel parameter is successfully learned from output generated by a Lagrangian particle-based microphysics model.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

Automated Defect Identification for Tri-structural Isotropic Fuels (AUDIT)

During the manufacture of tri-structural isotropic (TRISO)-coated nuclear fuel particles, the potential exists for the formation of internal fissure defects in the uranium oxycarbide (UCO) kernels. These fissures result in a defective fuel particle that can fracture during subsequent fuel processing. Therefore, it is necessary to detect the presence of fissured kernels in a batch to determine if the batch meets specification prior to blending with other batches and upgrading processes. Previous attempts at identifying fissures involved manual inspection of micrographs of UCO fuel kernel cross-sections. This process is tedious, time-consuming and may introduce counting errors making it a good candidate for automation. This work presents a method for the automated detection of fissures in UCO kernels. Image segmentation is used for the extraction of relevant features in the micrographs which then serve as the input to a convolutional neural network used to automatically distinguish between fissured and non-fissured kernels.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2026

Unsupervised atomic data mining via multi-kernel graph autoencoders for machine learning force fields

Constructing a chemically diverse dataset while avoiding sampling bias is critical to training efficient and generalizable force fields. However, in computational chemistry and materials science, many common dataset generation techniques are prone to oversampling regions of the potential energy surface. Furthermore, these regions can be difficult to identify and isolate from each other or may not align well with human intuition, making it challenging to systematically remove bias in the dataset. While traditional clustering and pruning (down-sampling) approaches can be useful for this, they can often lead to information loss or a failure to properly identify distinct regions of the potential energy surface due to difficulties associated with the high dimensionality of atomic descriptors. In this work, we introduce the Multi-kernel Edge Attention-based Graph Autoencoder (MEAGraph) model, an unsupervised approach for analyzing atomic datasets. MEAGraph combines multiple linear kernel transformations with attention-based message passing to capture geometric sensitivity and enable effective dataset pruning without relying on labels or extensive training. Demonstrated applications on niobium, tantalum, and iron datasets show that MEAGraph efficiently groups similar atomic environments, allowing for the use of basic pruning techniques for removing sampling bias. This approach provides an effective method for representation learning and clustering that can be used for data analysis, outlier detection, and dataset optimization.

Materials science↗
DOE OSTI2021

Predicting impurity spectral functions using machine learning

The Anderson Impurity Model (AIM) is a canonical model of quantum many-body physics. Here we investigate whether machine learning models, both neural networks (NN) and kernel ridge regression (KRR), can accurately predict the AIM spectral function in all of its regimes, from empty orbital, to mixed valence, to Kondo. To tackle this question, we construct two large spectral databases containing approximately 410 000 and 600 000 spectral functions of the single-channel impurity problem. We show that the NN models can accurately predict the AIM spectral function in all of its regimes, with pointwise mean absolute errors down to 0.003 in normalized units. We find that the trained NN models outperform models based on KRR and enjoy a speedup on the order of 10 5 over traditional AIM solvers. Finally, the required size of the training set of our model can be significantly reduced using farthest point sampling in the AIM parameter space, which is important for generalizing our method to more complicated multichannel impurity problems of relevance to predicting the properties of real materials.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
NASA NTRS2012

Optimization of Support Vector Machine (SVM) for Object Classification

The Support Vector Machine (SVM) is a powerful algorithm, useful in classifying data into species. The SVMs implemented in this research were used as classifiers for the final stage in a Multistage Automatic Target Recognition (ATR) system. A single kernel SVM known as SVMlight, and a modified version known as a SVM with K-Means Clustering were used. These SVM algorithms were tested as classifiers under varying conditions. Image noise levels varied, and the orientation of the targets changed. The classifiers were then optimized to demonstrate their maximum potential as classifiers. Results demonstrate the reliability of SVM as a method for classification. From trial to trial, SVM produces consistent results.

support vector machice (SVM)↗
DOE OSTI2019

Recovering missing CFD data for high-order discretizations using deep neural networks and dynamics learning

Data I/O poses a significant bottleneck in large-scale CFD simulations; thus, practitioners would like to significantly reduce the number of times the solution is saved to disk, yet retain the ability to recover any field quantity (at any time instance) a posteriori . The objective of this work is therefore to accurately recover missing CFD data a posteriori at any time instance, given that the solution has been written to disk at only a relatively small number of time instances. We consider in particular high-order discretizations (e.g., discontinuous Galerkin), as such techniques are becoming increasingly popular for the simulation of highly separated flows. To satisfy this objective, this work proposes a methodology consisting of two stages: 1) dimensionality reduction and 2) dynamics learning. For dimensionality reduction, we propose a novel hierarchical approach. First, the method reduces the number of degrees of freedom within each element of the high-order discretization by applying autoencoders from deep learning. Second, the methodology applies principal component analysis to compress the global vector of encodings. This leads to a low-dimensional state, which associates with a nonlinear embedding of the original CFD data. For dynamics learning, we propose to apply regression techniques (e.g., kernel methods) to learn the discrete-time velocity characterizing the time evolution of this low-dimensional state. In conclusion, a numerical example on a large-scale CFD example characterized by nearly 13 million degrees of freedom illustrates the suitability of the proposed method in an industrial setting.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Machine learning materials properties with accurate predictions, uncertainty estimates, domain guidance, and persistent online accessibility

One compelling vision of the future of materials discovery and design involves the use of machine learning (ML) models to predict materials properties and then rapidly find materials tailored for specific applications. However, realizing this vision requires both providing detailed uncertainty quantification (model prediction errors and domain of applicability) and making models readily usable. At present, it is common practice in the community to assess ML model performance only in terms of prediction accuracy (e.g. mean absolute error), while neglecting detailed uncertainty quantification and robust model accessibility and usability. Here, we demonstrate a practical method for realizing both uncertainty and accessibility features with a large set of models. We develop random forest ML models for 33 materials properties spanning an array of data sources (computational and experimental) and property types (electrical, mechanical, thermodynamic, etc). All models have calibrated ensemble error bars to quantify prediction uncertainty and domain of applicability guidance enabled by kernel-density-estimate-based feature distance measures. All data and models are publicly hosted on the Garden-AI infrastructure, which provides an easy-to-use, persistent interface for model dissemination that permits models to be invoked with only a few lines of Python code. We demonstrate the power of this approach by using our models to conduct a fully ML-based materials discovery exercise to search for new stable, highly active perovskite oxide catalyst materials.

domain of applicability↗
DOE OSTI2023

Performance Analysis and Optimal Node-aware Communication for Enlarged Conjugate Gradient Methods

Krylov methods are a key way of solving large sparse linear systems of equations but suffer from poor strong scalability on distributed memory machines. Furthermore, this is due to high synchronization costs from large numbers of collective communication calls alongside a low computational workload. Enlarged Krylov methods address this issue by decreasing the total iterations to convergence, an artifact of splitting the initial residual and resulting in operations on block vectors. In this article, we present a performance study of an enlarged Krylov method, Enlarged Conjugate Gradients (ECG), noting the impact of block vectors on parallel performance at scale. Most notably, we observe the increased overhead of point-to-point communication as a result of denser messages in the sparse matrix-block vector multiplication kernel. Additionally, we present models to analyze expected performance of ECG, as well as motivate design decisions. Most importantly, we introduce a new point-to-point communication approach based on node-aware communication techniques that increases efficiency of the method at scale.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

MFANS 2024 - Formally Proving Characteristics of Cyber-Physical Systems

Cyber-physical systems (CPS) are engineered systems that rely on the smooth integration of computational algorithms and physical elements. This integration presents new challenges for verifying that systems will behave as expected. The goal of this presentation is to present current challenges and potential solutions for the formal verification of cyber-physical systems. For cyber systems, formal methods refer to systematically rigorous mathematical techniques employed in the specification, development, analysis, and verification of both software and hardware systems. Recent advancements in computer science have yielded sophisticated tools specifically designed to address challenges associated with formal methods in complex systems. These tools leverage various foundational concepts such as logic, formal languages, program semantics, type systems, type theory, and automata theory. A notable achievement in the application of formal methods is the seL4 microkernel, claimed to be the first general-purpose operating-system kernel to be verified. Its proof implies the absence of bugs and guarantees that the kernel meets specifications. For physical systems, dynamic and control theory has a history of using rigorous analytic techniques to prove functional correctness. Lyapunov, optimal, classical, modern, and robust control theories all provide rigorous mathematical methods both to analyze system performance and to design controller that can be guaranteed to meet certain objectives. Recent computational techniques like level set theory and reachability analysis provide assertions that a system's state will avoid unsafe regions. Even though success has been independently achieved for cyber systems and physical systems, the integration of such systems creates new challenges. In particular, there is an obvious discrepancy between finite-state machines and infinite-state systems, resulting in different approaches for modeling and analyzing these system. While it is possible to simulate hybrid systems, this provides only a demonstration of a performance and not proof. For hybrid systems, current formal methods and system analysis approaches typically require a workarounds to work on hybrid systems like CPS. This paper will outline the state of the art and limits of current practice for formally verifying CPS and will identify possible research directions that require attention.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

TuckerMPI: A Parallel C++/MPI Software Package for Large-scale Data Compression via the Tucker Tensor Decomposition

With this study, our goal is compression of massive-scale grid-structured data, such as the multi-terabyte output of a high-fidelity computational simulation. For such data sets, we have developed a new software package called TuckerMPI, a parallel C++/MPI software package for compressing distributed data. The approach is based on treating the data as a tensor, i.e., a multidimensional array, and computing its truncated Tucker decomposition, a higher-order analogue to the truncated singular value decomposition of a matrix. The result is a low-rank approximation of the original tensor-structured data. Compression efficiency is achieved by detecting latent global structure within the data, which we contrast to most compression methods that are focused on local structure. In this work, we describe TuckerMPI, our implementation of the truncated Tucker decomposition, including details of the data distribution and in-memory layouts, the parallel and serial implementations of the key kernels, and analysis of the storage, communication, and computational costs. We test the software on 4.5 and 6.7 terabyte data sets distributed across 100 s of nodes (1,000 s of MPI processes), achieving compression ratios between 100 and 200,000×, which equates to 99--99.999% compression (depending on the desired accuracy) in substantially less time than it would take to even read the same dataset from a parallel file system. Moreover, we show that our method also allows for reconstruction of partial or down-sampled data on a single node, without a parallel computer so long as the reconstructed portion is small enough to fit on a single machine, e.g., in the instance of reconstructing/visualizing a single down-sampled time step or computing summary statistics. The code is available at https://gitlab.com/tensors/TuckerMPI.

97 MATHEMATICS AND COMPUTING↗