Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Learning Theory”

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 577 records · Page 32

HfTa_BCC_SolidSolution_128atoms_VASP6

We performed density functional theory (DFT) calculations for body-centered-cubic (BCC) structures with 128 lattices sites of solid solution binary alloys hafnium-tantalum (Hf-Ta). The electronic structures of alloys have been calculated using Vienna Ab initio Simulation Package (VASP). Within this package the DFT approach is used to reduce many-body Schrodinger equation to set of single particle Kohn-Sham (KS) equations. The generalized electronic exchange-correlation functional is described by generalized gradient approximation with the Perdew-Burke-Ernzerhof parametrization. The electron-ion interactions is described by pseudopotentials developed within the plane-wave basis projector augmented-wave (PAW) approach. These pseudopotentials are available at the VASP portal (http://cms.mpi.univie.ac.at/vasp/). Our calculations have been run with the pseudopotentials treating s and p semi-core states as valence in case for the elements Hf and Ta. The electronic densities and potentials are expanded over plane-waves with energy cutoff of 350 eV. 2x2x2 k-mesh and normal precision were used. The alloys were modeled by supercell containing 128 randomly distributed atoms. At initial step the atoms occupy perfect BCC lattice sites. This initial structure was optimized until energy changes less than 1e-6 eV, while forces acting on atoms don't exceed 1e-2 eV/angstrom. The electron-ion interaction is described by PAW pseudopotentials. The calculations have been collected by sampling chemical compositions across the entire compositional range. The chemical compositions have been sampled by progressively changing the number of atoms per constituent by 4. For each chemical composition of binaries and ternaries, the first-principle calculations have been run for 100 randomized arrangements of the constituents on the BCC lattice sites. We collected data for a total of 3,040 randomized atomic structures over 31 chemical compositions. Further methodological and structural information is contained in the dataset README.txt file.

36 MATERIALS SCIENCE↗

Human-Constrained Indicators of Gatekeeping Behavior as a Role in Information Suppression: Finding Invisible Information and the Significant Unsaid

To date, disinformation research has focused largely on the production of false information ignoring the suppression of select information. We term this alternative form of disinformation information suppression. Information suppression occurs when facts are withheld with the intent to mislead. In order to detect information suppression, we focus on understanding the actors who withhold information. In this research, we use knowledge of human behavior to find signatures of different gatekeeping behaviors found in text. Specifically, we build a model to classify the different types of edits on Wikipedia using the added text alone and compare a human-informed feature engineering approach to a featureless algorithm. Being able to computationally distinguish gatekeeping behaviors is a first step towards identifying when information suppression is occurring.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

EFRC Accomplishments: Integrated Mesoscale Architectures for Sustainable Catalysis (IMASC)

The vision of IMASC is to advance the fundamental science necessary to alter fundamental aspects of the chemical industries sector and its carbon footprint. The IMASC mission is to develop design principles for increasing the efficiency of key chemical syntheses using dilute alloy catalysts by quantitatively scaling from model studies to catalytic operation using advanced experiment and theory. One of the major challenges in catalysis is predicting catalytic behavior—especially selectivity. The IMASC team developed a methodology for obtaining critical information for selected catalytic processes using dilute alloy catalysts, that is widely applicable to modeling catalytic processes.

36 MATERIALS SCIENCE↗

Toward a microscopic picture of hadronization and multi-parton processes

This project advanced the understanding of how quarks and gluons produced in high-energy collisions transform into the hadrons observed in particle detectors, a fundamental process known as quantum chromodynamics (QCD) hadronization. By combining theoretical calculations, quantum simulation methods, and modern AI techniques, the research developed new tools to study multi-parton dynamics and nonperturbative effects that are essential for interpreting data from current and future nuclear physics experiments. Key outcomes include new theoretical frameworks for jet and hadron measurements, pioneering quantum simulation algorithms for real-time dynamics in field theories, and the development of advanced machine-learning models, such as diffusion models and explainable classifiers, to simulate and analyze collider events. These results are directly relevant to experiments at Jefferson Lab, Brookhaven National Laboratory, and the future Electron-Ion Collider, and they also have a broader impact in areas such as quantum information science and data-driven modeling of complex systems. The project supported the training of graduate students and postdoctoral fellows and contributed to the broader scientific community through publications, workshops, and collaborative activities. Overall, this work provides new insights into the microscopic mechanisms of hadron formation and establishes a foundation for future studies at the intersection of nuclear physics, artificial intelligence, and quantum computing.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Learning classification trees

Algorithms for learning classification trees have had successes in artificial intelligence and statistics over many years. How a tree learning algorithm can be derived from Bayesian decision theory is outlined. This introduces Bayesian techniques for splitting, smoothing, and tree averaging. The splitting rule turns out to be similar to Quinlan's information gain splitting rule, while smoothing and averaging replace pruning. Comparative experiments with reimplementations of a minimum encoding approach, Quinlan's C4 and Breiman et al. Cart show the full Bayesian algorithm is consistently as good, or more accurate than these other approaches though at a computational price.

Buntine, Wray↗

A materials-informatics based study of solid electrolytes and protective coatings for Li batteries

All-solid-state batteries with Li metal anode can address the safety issues surrounding traditional Li-ion batteries as well as the demand for higher energy densities. However, the development of solid electrolytes and protective coatings simultaneously possessing high ionic conductivity and wide electrochemical stability has proven to be a challenge. Here, we present a data-driven approach to explore the Li compound space for promising solid electrolytes and coatings. This is accomplished through the generation of a large database of battery-related materials properties of Li compounds by computing Li+ migration barriers using bond-valence-based pair potentials, and stability windows using density functional theory energies. Using this database, we implement machine learning models that can accurately predict migration barriers and electrochemical stability windows for any new Li compound. Through feature engineering, we ensure that our models are both accurate and interpretable. We perform feature importance analysis on our models to highlight materials properties that can be tuned for future design of coatings/electrolytes. Our database and informatics approach provide a valuable tool for the rapid discovery of new solid-state battery chemistries.

Solid state batteries↗

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗

Machine Learning the COSMO Model for Predicting Thermodynamics of Electrolyte Mixtures

Bottom-up design of electrolyte mixtures for battery systems requires predicting macro thermodynamic properties from molecular constituents. For instance, molten salt electrolyte batteries require conditions far above room temperature to operate. Therefore, discovering mixtures with increasingly lower eutectic melting points is desirable. A model that can approximate chemical activity is a valuable tool to search through the vast compositional design space. Machine learning can predict properties of materials such as vibrational free energies, electronic energy gaps, and thermal conductivities. Moreover, they can learn physical models such as interatomic potentials. The COSMO-SAC model uses theory and empirical parameterization to predict liquid-vapor and liquid-solid properties using first-principles calculations. However, obtaining activity coefficients required for parameterizing the COSMO-SAC model is costly and limited to a select chemical space. In this work, we explored if machine learning methods could improve the COSMO-SAC model and bridge density functional theory calculations to liquid phase thermodynamic properties. Our data-driven approach uses existing databases for sigma-profiles of organic solvents and reconciles their methodological differences via ensemble averaging. First, an optimal machine learning model is constructed for each dataset. Our machine learning algorithms use the sigma-profile as an input feature to predict binary mixtures' activity coefficients using multi-output regression. Each dataset uses different choices of functionals, methods, and basis sets. Therefore, our ensemble model attempts to predict corrected activity coefficients given the combination of all the model outputs. The activity coefficients used for training are generated using the COSMO-SAC model. This approach enables the extraction of meaningful information from the existing datasets to improve the COSMO-SAC model for obtaining thermodynamic properties of electrolyte mixtures. With the liquid phase activities, we can identify electrolyte mixtures that meet desired phase equilibria conditions.

Thermodynamics↗

Machine learning BPS spectra and the gap conjecture

We explore statistical properties of Bogomol’nyi-Prasad-Sommerfield q-series for strongly coupled supersymmetric theories that correspond to a particular family of three-manifolds. We discover that gaps between exponents in the -series are statistically more significant at the beginning of the -series compared to gaps that appear in higher powers of. Our observations are obtained by calculating saliencies of -series features used as input data for principal component analysis, which is a standard example of an explainable machine learning technique that allows for a direct calculation and a better analysis of feature saliencies.

97 MATHEMATICS AND COMPUTING↗

OrbNet Denali: A machine learning potential for biological and organic chemistry with semi-empirical cost and DFT accuracy

We present OrbNet Denali, a machine learning model for an electronic structure that is designed as a drop-in replacement for groundstate density functional theory (DFT) energy calculations. The model is a message-passing graph neural network that uses symmetryadapted atomic orbital features from a low-cost quantum calculation to predict the energy of a molecule. OrbNet Denali is trained on a vast dataset of 2.3 × 10 6 DFT calculations on molecules and geometries. This dataset covers the most common elements in biochemistry and organic chemistry (H, Li, B, C, N, O, F, Na, Mg, Si, P, S, Cl, K, Ca, Br, and I) and charged molecules. OrbNet Denali is demonstrated on several well-established benchmark datasets, and we find that it provides accuracy that is on par with modern DFT methods while offering a speedup of up to three orders of magnitude. For the GMTKN55 benchmark set, OrbNet Denali achieves WTMAD-1 and WTMAD-2 scores of 7.19 and 9.84, on par with modern DFT functionals. For several GMTKN55 subsets, which contain chemical problems that are not present in the training set, OrbNet Denali produces a mean absolute error comparable to those of DFT methods. For the Hutchison conformer benchmark set, OrbNet Denali has a median correlation coefficient of R 2 = 0.90 compared to the reference DLPNO-CCSD(T) calculation and R 2 = 0.97 compared to the method used to generate the training data (ωB97X-D3/def2- TZVP), exceeding the performance of any other method with a similar cost. Similarly, the model reaches chemical accuracy for noncovalent interactions in the S66x10 dataset. For torsional profiles, OrbNet Denali reproduces the torsion profiles of ωB97X-D3/def2-TZVP with an average mean absolute error of 0.12 kcal/mol for the potential energy surfaces of the diverse fragments in the TorsionNet500 dataset.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Machine learning nonequilibrium electron forces for spin dynamics of itinerant magnets

Abstract We present a generalized potential theory for conservative as well as nonconservative forces for the Landau-Lifshitz magnetization dynamics. Importantly, this formulation makes possible an elegant generalization of the Behler-Parrinello machine learning (ML) approach, which is a cornerstone of ML-based quantum molecular dynamics methods, to the modeling of force fields in adiabatic spin dynamics of out-of-equilibrium itinerant magnetic systems. We demonstrate our approach by developing a deep-learning neural network that successfully learns the electron-mediated exchange fields in a driven s-d model computed from the nonequilibrium Green’s function method. We show that dynamical simulations with forces predicted from the neural network accurately reproduce the voltage-driven domain-wall propagation. Our work also lays the foundation for ML modeling of spin transfer torques and opens a avenue for ML-based multi-scale modeling of nonequilibrium dynamical phenomena in itinerant magnets and spintronics.

36 MATERIALS SCIENCE↗

High temperature stability and transport characteristics of hydrogen in alumina via multiscale computation

Here, the impact of hydrogen charge states on the stability and transport characteristics of hydrogen interstitials in alumina polymorphs is evaluated by multiscale computational methods including density functional theory (DFT), ab initio molecular dynamics (AIMD) and machine learned force fields. Thermodynamic calculations show that the protonic H i +1 interstitial is the most stable defect species for most values of the electronic bandgap in both and amorphous alumina (Al 2 O 3 ). Further, active learned Gaussian approximation potentials (GAP) were developed using AIMD data to study temperature dependent long time proton diffusion in alumina. Diffusivity calculations from GAP-MD simulations are found to be comparable with of the AIMD data, while being ~340 times faster and scalable to larger systems. Comparisons with diffusivity values for other interstitial charge states (H i 0 and H i -1 ) and published experimental literature indicate that H i +1 diffusion is the likely mechanism of hydrogen transport. A good agreement is obtained between H i +1 diffusivity calculated in α-Al 2 O 3 from DFT: 5.05 10 -3 exp(-0.81 eV/k B /T) cm 2 /s and reported experiment: 9.7X10 -4 exp(-0.83 eV/k B /T) cm 2 /s. Computationally and experimentally calculated energy barriers (0.81 and 0.83 eV respectively) only differ by 2.5%. Similarly, the pre-exponential diffusion coefficients only differ by 0.5 orders of magnitude. Moreover, the diffusivity of H i +1 in amorphous Al 2 O 3 in the 1000–2000 K range is calculated to be 2.53X10 -2 exp(-0.89 eV/k B /T), just one order of magnitude higher than the corresponding value in α-Al 2 O 3 . This suggests that local structural disorder does not significantly affect the energy landscape and diffusion behavior of H i +1 in Al 2 O 3 . Overall, these results show promise for the application of alumina polymorphs as hydrogen permeation barriers.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Machine learning defect properties in Cd-based chalcogenides

Impurity energy levels in the band gap can have serious consequences for a semiconductor's performance as a photovoltaic absorber. Data-driven approaches can help accelerate the prediction of point defect properties in common semiconductors, and thus lead to the identification of potential deep lying impurity states. In this work, we use density functional theory (DFT) to compute defect formation energies and charge transition levels of hundreds of impurities in CdX chalcogenide compounds, where X = Te, Se or S. We apply machine learning techniques on the DFT data and develop on-demand predictive models for the formation energy and relevant transition levels of any impurity atom in any site. The trained ML models are general and accurate enough to predict the properties of any possible point defects in any Cd-based chalcogenide, as we prove by testing on a few selected defects in mixed chalcogen compounds CdTe 0.5 Se 0.5 and CdSe 0.5 S 0.5 . The ML framework used in this work can be extended to any class of semiconductors.

density functional theory↗

High-Performance Iridium–Molybdenum Oxide Electrocatalysts for Water Oxidation in Acid: Bayesian Optimization Discovery and Experimental Testing

Ir oxides are costly and scarce catalysts for oxygen evolution reaction (OER) in acid. There has been extensive interest in developing alternatives that are either Ir-free or require smaller amounts of Ir to drive the reactions at acceptable rates. One design strategy is to identify Ir-based mixed oxides that achieve similar performance while requiring smaller amounts of Ir. The obstacle to this strategy has been a very large phase space of the Ir-based mixed metal oxides, in terms of the metals combined with Ir and the different crystallographic structures of the mixed oxides, which prevents a thorough exploration of possible materials. In this work, we developed a workflow that uses machine-learning-aided Bayesian optimization in combination with density functional theory to make the exploration of this phase space plausible. This screening identified Mo as a promising dopant for forming acid-tolerant Ir-based oxides for the OER. We synthesized and characterized the Ir–Mo mixed oxides in the form of thin-film electrocatalysts with a known surface area. We show that these mixed oxides exhibited overpotentials ~30 mV lower than a pure Ir control while maintaining 24% lower Ir dissolution rates than the Ir control. Furthermore, these findings suggest that Mo is a promising dopant and highlight the promise of machine learning to guide the experimental exploration and optimization of catalytic materials.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Machine learning for collective variable discovery and enhanced sampling in biomolecular simulation

Classical molecular dynamics simulates the time evolution of molecular systems through the phase space spanned by the positions and velocities of the constituent atoms. Molecular-level thermodynamic, kinetic, and structural data extracted from the resulting trajectories provide valuable information for the understanding, engineering, and design of biological and molecular materials. The cost of simulating many-body atomic systems makes simulations of large molecules prohibitively expensive, and the high-dimensionality of the resulting trajectories presents a challenge for analysis. Driven by advances in algorithms, hardware, and data availability, there has been a flare of interest in recent years in the applications of machine learning – especially deep learning – to molecular simulation. Furthermore, these techniques have demonstrated great power and flexibility in both extracting mechanistic understanding of the important nonlinear collective variables governing the dynamics of a molecular system, and in furnishing good low-dimensional system representations with which to perform enhanced sampling or develop long-timescale dynamical models. It is the purpose of this article to introduce the key machine learning approaches, describe how they are married with statistical mechanical theory into domain-specific tools, and detail applications of these approaches in understanding and accelerating biomolecular simulation.

74 ATOMIC AND MOLECULAR PHYSICS↗

Machine learning the Hubbard U parameter in DFT+U using Bayesian optimization

Abstract Within density functional theory (DFT), adding a Hubbard U correction can mitigate some of the deficiencies of local and semi-local exchange-correlation functionals, while maintaining computational efficiency. However, the accuracy of DFT+U largely depends on the chosen Hubbard U values. We propose an approach to determining the optimal U parameters for a given material by machine learning. The Bayesian optimization (BO) algorithm is used with an objective function formulated to reproduce the band structures produced by more accurate hybrid functionals. This approach is demonstrated for transition metal oxides, europium chalcogenides, and narrow-gap semiconductors. The band structures obtained using the BO U values are in agreement with hybrid functional results. Additionally, comparison to the linear response (LR) approach to determining U demonstrates that the BO method is superior.

Chemistry↗