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 19 records

SU-E-P-04: Transport Theory Learning Module in the Maple Environment

Purpose: The medical physics graduate program at the University of Miami is developing a computerized instructional module which provides an interactive mechanism for students to learn transport theory. While not essential in the medical physics curriculum, transport theory should be taught because the conceptual level of transport theory is fundamental, a substantial literature exists and ought to be accessible, and students should understand commercial software which solves the Boltzmann equation.But conventional teaching and learning of transport theory is challenging. Students may be under prepared to appreciate its methods, results, and relevance, and it is not substantially addressed in textbooks for the medical physicists. Other resources an instructor might reasonably use, while excellent, may be too briskly paced for beginning students. The purpose of this work is to render teaching of transport theory more tractable by making learning highly interactive. Methods: The module is being developed in the Maple mathematics environment by instructors and graduate students. It will refresh the students' knowledge of vector calculus and differential equations, and will develop users' intuition for phase space concepts. Scattering concepts will be developed with animated simulations using tunable parameters characterizing interactions, so that students may develop a “feel” for cross section. Transport equations for one and multiple types of radiation will be illustrated with phase space animations. Numerical methods of solution will be illustrated. Results: Attempts to teach rudiments of transport theory in radiation physics and dosimetry courses using conventional classroom techniques at the University of Miami have had small success, because classroom time is limited and the material has been hard for our students to appreciate intuitively. Conclusion: A joint effort of instructor and students to teach and learn transport theory by building an interactive description of it will lead to deeper appreciation of the transport theoretical underpinnings of dosimetry.

61 RADIATION PROTECTION AND DOSIMETRY↗

Deep learning: Extrapolation tool for ab initio nuclear theory

Ab initio approaches in nuclear theory, such as the no-core shell model (NCSM), have been developed for approximately solving finite nuclei with realistic strong interactions. The NCSM and other approaches require an extrapolation of the results obtained in a finite basis space to the infinite basis space limit and assessment of the uncertainty of those extrapolations. Each observable requires a separate extrapolation and many observables have no proven extrapolation method. Herein, we propose a feed-forward artificial neural network (ANN) method as an extrapolation tool to obtain the ground-state energy and the ground-state point-proton root-mean-square (rms) radius along with their extrapolation uncertainties. The designed ANNs are sufficient to produce results for these two very different observables in 6 Li from the ab initio NCSM results in small basis spaces that satisfy the following theoretical physics condition: independence of basis space parameters in the limit of extremely large matrices. Comparisons of the ANN findings with other extrapolation methods are also provided.

6Li↗

Maximizing efficiency of dataset compression for machine learning potentials with information theory

Machine learning interatomic potentials (MLIPs) balance high accuracy and lower costs compared to density functional theory calculations, but their performance often depends on the size and diversity of training datasets. Large datasets improve model accuracy and generalization but are computationally expensive to produce and train on, while smaller datasets risk discarding rare but important atomic environments and compromising MLIP accuracy/reliability. Here, we develop an information-theoretical framework to quantify the efficiency of dataset compression methods and propose an algorithm that maximizes this efficiency. By framing atomistic dataset compression as an instance of the minimum set cover (MSC) problem over atom-centered environments, our method identifies the smallest subset of structures that contains as much information as possible from the original dataset while pruning redundant information. The approach is extensively demonstrated on the GAP-20 and TM23 datasets and validated on 64 varied datasets from the ColabFit repository. Across all cases, MSC consistently retains outliers, preserves dataset diversity, and reproduces the long-tail distributions of forces even at high compression rates, outperforming other subsampling methods. Furthermore, MLIPs trained on MSC-compressed datasets exhibit reduced error for out-of-distribution data even in low-data regimes. We explain these results using an outlier analysis and show that such quantitative conclusions could not be achieved with conventional dimensionality reduction methods. The algorithm is implemented in the open-source QUESTS package and can be used for several tasks in atomistic modeling, from data subsampling, outlier detection, and training improved MLIPs at a lower cost.

36 MATERIALS SCIENCE↗

Predicting Metabolic Reaction Networks with Perturbation-Theory Machine Learning (PTML) Models

Background: Checking the connectivity (structure) of complex Metabolic Reaction Networks(MRNs) models proposed for new microorganisms with promising properties is an importantgoal for chemical biology. Objective: In principle, we can perform a hand-on checking (Manual Curation). However, this is achallenging task due to the high number of combinations of pairs of nodes (possible metabolic reactions). Results: The CPTML linear model obtained using the LDA algorithm is able to discriminate nodes(metabolites) with the correct assignation of reactions from incorrect nodes with values of accuracy,specificity, and sensitivity in the range of 85-100% in both training and external validation dataseries. Methods: In this work, we used Combinatorial Perturbation Theory and Machine Learning techniquesto seek a CPTML model for MRNs >40 organisms compiled by Barabasis’ group. First, wequantified the local structure of a very large set of nodes in each MRN using a new class of node indexcalled Markov linear indices fk. Next, we calculated CPT operators for 150000 combinationsof query and reference nodes of MRNs. Last, we used these CPT operators as inputs of differentML algorithms. Conclusion: Meanwhile, PTML models based on Bayesian network, J48-Decision Tree and RandomForest algorithms were identified as the three best non-linear models with accuracy greaterthan 97.5%. The present work opens the door to the study of MRNs of multiple organisms usingPTML models.

Pharmacology & Pharmacy↗

Predicting band gaps and band-edge positions of oxide perovskites using density functional theory and machine learning

Density functional theory (DFT) within the local or semilocal density approximations, i.e., the local density approximation (LDA) or generalized gradient approximation (GGA), has become a workhorse in the electronic structure theory of solids, being extremely fast and reliable for energetics and structural properties, yet remaining highly inaccurate for predicting band gaps of semiconductors and insulators. The accurate prediction of band gaps using first-principles methods is time consuming, requiring hybrid functionals, quasiparticle GW, or quantum Monte Carlo methods. Efficiently correcting DFT-LDA/GGA band gaps and unveiling the main chemical and structural factors involved in this correction is desirable for discovering novel materials in high-throughput calculations. In this direction, we, in this study, use DFT and machine learning techniques to correct band gaps and band-edge positions of a representative subset of ABO 3 perovskite oxides. Relying on the results of HSE06 hybrid functional calculations as target values of band gaps, we find a systematic band-gap correction of ~1.5 eV for this class of materials, where ~1 eV comes from downward shifting the valence band and ~0.5 eV from uplifting the conduction band. The main chemical and structural factors determining the band-gap correction are determined through a feature selection procedure.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Machine Learned Hückel Theory: Interfacing Physics and Deep Neural Networks

The Hückel Hamiltonian is an incredibly simple tight-binding model known for its ability to capture qualitative physics phenomena arising from electron interactions in molecules and materials. Part of its simplicity arises from using only two types of empirically fit physics-motivated parameters: the first describes the orbital energies on each atom and the second describes electronic interactions and bonding between atoms. By replacing these empirical parameters with machine-learned dynamic values, we vastly increase the accuracy of the extended Hückel model. The dynamic values are generated with a deep neural network, which is trained to reproduce orbital energies and densities derived from density functional theory. The resulting model retains interpretability, while the deep neural network parameterization is smooth and accurate and reproduces insightful features of the original empirical parameterization. Altogether, this work shows the promise of utilizing machine learning to formulate simple, accurate, and dynamically parameterized physics models.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Observable optimization for precision theory: machine learning energy correlators

The practice of collider physics typically involves the marginalization of multi-dimensional collider data to uni-dimensional observables relevant for some physics task. In many cases, such as classification or anomaly detection, the observable can be arbitrarily complicated, such as the output of a neural network. However, for precision measurements, the observable must correspond to something computable systematically beyond the level of current simulation tools. In this work, we demonstrate that precision-theory-compatible observable space exploration can be systematized by using neural simulation-based inference techniques from machine learning. We illustrate this approach by exploring the space of marginalizations of the energy 3-point correlator to optimize sensitivity to the top quark mass. We first learn the energy-weighted probability density from simulation, then search in the space of marginalizations for an optimal triangle shape. Although simulations and machine learning are used in the process of observable optimization, the output is an observable definition which can be then computed to high precision and compared directly to data without any memory of the computations which produced it. We find that the optimal marginalization is isosceles triangles on the sphere with a side ratio approximately $1 : 1 : \sqrt{2}$ (i.e. right triangles) within the set of marginalizations we consider.

Jets and Jet Substructure↗

Physics guided machine learning using simplified theories

Recent applications of machine learning, in particular deep learning, motivate the need to address the generalizability of the statistical inference approaches in physical sciences. In this Letter, we introduce a modular physics guided machine learning framework to improve the accuracy of such data-driven predictive engines. The chief idea in our approach is to augment the knowledge of the simplified theories with the underlying learning process. To emphasize their physical importance, our architecture consists of adding certain features at intermediate layers rather than in the input layer. To demonstrate our approach, we select a canonical airfoil aerodynamic problem with the enhancement of the potential flow theory. We include the features obtained by a panel method that can be computed efficiently for an unseen configuration in our training procedure. By addressing the generalizability concerns, our results suggest that the proposed feature enhancement approach can be effectively used in many scientific machine learning applications, especially for the systems where we can use a theoretical, empirical, or simplified model to guide the learning module.

42 ENGINEERING↗

Reformulation of the No-Free-Lunch Theorem for Entangled Datasets

The No-Free-Lunch (NFL) theorem is a celebrated result in learning theory that limits one’s ability to learn a function with a training data set. With the recent rise of quantum machine learning, it is natural to ask whether there is a quantum analog of the NFL theorem, which would restrict a quantum computer’s ability to learn a unitary process with quantum training data. However, in the quantum setting, the training data can possess entanglement, a strong correlation with no classical analog. In this work, we show that entangled data sets lead to an apparent violation of the (classical) NFL theorem. This motivates a reformulation that accounts for the degree of entanglement in the training set. As our main result, we prove a quantum NFL theorem whereby the fundamental limit on the learnability of a unitary is reduced by entanglement. We employ Rigetti's quantum computer to test both the classical and quantum NFL theorems. In conclusion, our work establishes that entanglement is a commodity in quantum machine learning.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Decoding {beta}-decay systematics: A global statistical model for {beta}{sup -} half-lives

Statistical modeling of nuclear data provides a novel approach to nuclear systematics complementary to established theoretical and phenomenological approaches based on quantum theory. Continuing previous studies in which global statistical modeling is pursued within the general framework of machine learning theory, we implement advances in training algorithms designed to improve generalization, in application to the problem of reproducing and predicting the half-lives of nuclear ground states that decay 100% by the {beta}{sup -} mode. More specifically, fully connected, multilayer feed-forward artificial neural network models are developed using the Levenberg-Marquardt optimization algorithm together with Bayesian regularization and cross-validation. The predictive performance of models emerging from extensive computer experiments is compared with that of traditional microscopic and phenomenological models as well as with the performance of other learning systems, including earlier neural network models as well as the support vector machines recently applied to the same problem. In discussing the results, emphasis is placed on predictions for nuclei that are far from the stability line, and especially those involved in r-process nucleosynthesis. It is found that the new statistical models can match or even surpass the predictive performance of conventional models for {beta}-decay systematics and accordingly should provide a valuable additional tool for exploring the expanding nuclear landscape.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Statistical Complexity of Quantum Learning

Abstract Learning problems involve settings in which an algorithm has to make decisions based on data, and possibly side information such as expert knowledge. This study has two main goals. First, it reviews and generalizes different results on the data and model complexity of quantum learning, where the data and/or the algorithm can be quantum, focusing on information‐theoretic techniques. Second, it introduces the notion of copy complexity, which quantifies the number of copies of a quantum state required to achieve a target accuracy level. Copy complexity arises from the destructive nature of quantum measurements, which irreversibly alter the state to be processed, limiting the information that can be extracted about quantum data. As a result, empirical risk minimization is generally inapplicable. The paper presents novel results on the copy complexity for both training and testing. To make the paper self‐contained and approachable by different research communities, an extensive background material is provided on classical results from statistical learning theory, as well as on the distinguishability of quantum states. Throughout, the differences between quantum and classical learning are highlighted by addressing both supervised and unsupervised learning, and extensive pointers are provided to the literature.

97 MATHEMATICS AND COMPUTING↗

Universal Compiling and (No-)Free-Lunch Theorems for Continuous-Variable Quantum Learning

Quantum compiling, where a parameterized quantum circuit is trained to learn a target unitary, is an important primitive for quantum computing that can be used as a subroutine to obtain optimal circuits or as a tomographic tool to study the dynamics of an experimental system. While much attention has been paid to quantum compiling on discrete-variable hardware, less has been paid to compiling in the continuous-variable paradigm. Here we motivate several, closely related, short-depth continuous-variable algorithms for quantum compilation. We analyze the trainability of our proposed cost functions and numerically demonstrate our algorithms by learning arbitrary Gaussian operations and Kerr nonlinearities. We further make connections between this framework and quantum learning theory in the continuous-variable setting by deriving no-free-lunch theorems. These generalization bounds demonstrate a linear resource reduction for learning Gaussian unitaries using entangled coherent-Fock states and an exponential resource reduction for learning arbitrary unitaries using two-mode-squeezed states.

97 MATHEMATICS AND COMPUTING↗

Satellite image analysis for surveillance, vegetation and climate change

Recently, many studies have provided abundant evidence to show the trend of tree mortality is increasing in many regions, and the cause of tree mortality is associated with drought, insect outbreak, or fire. Unfortunately, there is no current capability available to monitor vegetation changes, and correlate and predict tree mortality with CO{sub 2} change, and climate change on the global scale. Different survey platforms (methods) have been used for forest management. Typical ground-based forest surveys measure tree stem diameter, species, and alive or dead. The measurements are low-tech and time consuming, but the sample sizes are large, running into millions of trees, covering large areas, and spanning many years. These field surveys provide powerful ground validation for other survey methods such as photo survey, helicopter GPS survey, and aerial overview survey. The satellite imagery has much larger coverage. It is easier to tile the different images together, and more important, the spatial resolution has been improved such that close to or even higher than aerial survey platforms. Today, the remote sensing satellite data have reached sub-meter spatial resolution for panchromatic channels (IKONOS 2: 1 m; Quickbird-2: 0.61 m; Worldview-2: 0.5 m) and meter spatial resolution for multi-spectral channels (IKONOS 2: 4 meter; Quickbird-2: 2.44 m; Worldview-2: 2 m). Therefore, high resolution satellite imagery can allow foresters to discern individual trees. This vital information should allow us to quantify physiological states of trees, e.g. healthy or dead, shape and size of tree crowns, as well as species and functional compositions of trees. This is a powerful data resource, however, due to the vast amount of the data collected daily, it is impossible for human analysts to review the imagery in detail to identify the vital biodiversity information. Thus, in this talk, we will discuss the opportunities and challenges to use high resolution satellite imagery and machine learning theory to monitor tree mortality at the level of individual trees.

47 OTHER INSTRUMENTATION↗

Modeling behavioral considerations related to information security.

The authors present experimental and simulation results of an outcome-based learning model for the identification of threats to security systems. This model integrates judgment, decision-making, and learning theories to provide a unified framework for the behavioral study of upcoming threats.

99 GENERAL AND MISCELLANEOUS↗

Estimation of sensor measurement errors in reactor coolant systems using multi-sensor fusion

A nuclear power plant is typically instrumented with a variety of sensors to continually monitor its variables, and their sensor’s measurements may be used to assess the plant state and initiate safety actions, if needed. Errors in sensor measurements, due to factors such as calibration drifts, critically affect such state assessments. Here, we address a problem of estimating sensor errors using physics-informed machine learning methods that use measurements collected under known plant conditions. For a given sensor, we propose an information fusion method that uses measurements from other sensors to estimate its output assuming it is error-free and provides its difference from an actual measurement as an error estimate. We present the ensemble of trees and support vector machine fusers, and evaluate their performance using measurements collected over an emulated test loop of a pressurized water reactor. The plant variables are related to each other through the underlying physical laws under inertial constraints that place bounds on their derivatives, which analytically justify the applicability of machine learning methods for computing these fusers. Under twenty scenarios, we assess their sensor error estimates for pressure sensors of the heat exchanger of a reactor’s primary coolant system. Multiple types of errors are captured by both fusers under externally induced calibration drifts, blockages, minor leaks and air gaps in sensing lines, and electromagnetic interference; the root mean square error of the estimation of error is under 2.2% percent of the maximum measurement. We present generalization equations, in the framework of statistical learning theory, for these methods that characterize the confidence probability that the estimation error is bounded by a specified parameter in future test scenarios.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Adaptive sparse polynomial chaos expansion based on least angle regression

Polynomial chaos (PC) expansions are used in stochastic finite element analysis to represent the random model response by a set of coefficients in a suitable (so-called polynomial chaos) basis. The number of terms to be computed grows dramatically with the size of the input random vector, which makes the computational cost of classical solution schemes (may it be intrusive (i.e. of Galerkin type) or non intrusive) unaffordable when the deterministic finite element model is expensive to evaluate. To address such problems, the paper describes a non intrusive method that builds a sparse PC expansion. First, an original strategy for truncating the PC expansions, based on hyperbolic index sets, is proposed. Then an adaptive algorithm based on least angle regression (LAR) is devised for automatically detecting the significant coefficients of the PC expansion. Beside the sparsity of the basis, the experimental design used at each step of the algorithm is systematically complemented in order to avoid the overfitting phenomenon. The accuracy of the PC metamodel is checked using an estimate inspired by statistical learning theory, namely the corrected leave-one-out error. As a consequence, a rather small number of PC terms are eventually retained (sparse representation), which may be obtained at a reduced computational cost compared to the classical 'full' PC approximation. The convergence of the algorithm is shown on an analytical function. Then the method is illustrated on three stochastic finite element problems. The first model features 10 input random variables, whereas the two others involve an input random field, which is discretized into 38 and 30 - 500 random variables, respectively.

97 MATHEMATICS AND COMPUTING↗