Search NASA⌕ Search

SEARCH · Search NASA

Results for “Learning Theories”

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 37 records · Page 2

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↗

The organization of an autonomous learning system

The organization of systems that learn from experience is examined, human beings and animals being prime examples of such systems. How is their information processing organized. They build an internal model of the world and base their actions on the model. The model is dynamic and predictive, and it includes the systems' own actions and their effects. In modeling such systems, a large pattern of features represents a moment of the system's experience. Some of the features are provided by the system's senses, some control the system's motors, and the rest have no immediate external significance. A sequence of such patterns then represents the system's experience over time. By storing such sequences appropriately in memory, the system builds a world model based on experience. In addition to the essential function of memory, fundamental roles are played by a sensory system that makes raw information about the world suitable for memory storage and by a motor system that affects the world. The relation of sensory and motor systems to the memory is discussed, together with how favorable actions can be learned and unfavorable actions can be avoided. Results in classical learning theory are explained in terms of the model, more advanced forms of learning are discussed, and the relevance of the model to the frame problem of robotics is examined.

Kanerva, Pentti↗

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↗

Making Games Not Work: Paradoxes Embedded in Game-Based Training and Concepts for Overcoming Them

An interest in game-based training solutions is natural. All one has to do is watch someone fully engaged in a modern game to see the potential of harnessing that attention for training. However, the reality of game-based training has not fully satisfied these expectations. This paper explains two paradoxes that must be overcome for games to support training. These paradoxes are a result of the realities of the basic human condition clashing with the requirements of learning theory. 80th paradoxes arise from the concept of "engagement" that is central to games. The first comes from a more robust definition of engagement, which is the condition of Flow or Optimal Experience. Flow is the state game developers want to see in users. One aspect of Flow is loss of sense of self as the individual becomes immersed in the experience. The paradox arises because this loss of self directly contradicts the learning requirement of self-reflection. The second paradox comes from theories of play, which state in part that play requires a level of individual freedom. The contradiction arises when game-based play must be harnessed to an organizational training program or regimen. The paper will discuss these paradoxes in the context of an effort to design a game-based training modality to train combat medics and will close with a review of compensating strategies identified by the designers. The paper will provide information important to anyone interested in conceptualizing and designing game-based training.

Jones, Phillip N.↗

Learnability of Red-Green Opponency

Lennie, Haake, and Williams found that in the lateral geniculate nucleus (LGN), parvocellular unit responses are consistent with the hypothesis that their input connectivity is blind to the difference between middle-wavelength-sensitive (MWS) and long-wavelength-sensitive (LWS) cones. Most of their cells have a total MWS input weight opposite in sign and similar in magnitude to their total LWS input weight. If these weights are exactly balanced, the construction of a red-green opponent system from such units is simple: such units need only be aligned so the signs of their outputs agree. Ahumada and Mulligan described an associative learning process which can accomplish this alignment. If the units are not balanced (carry some luminance information), the strong overlap between the MWS and LWS spectral responses can cause units to agree more on the basis of luminance, and the associative process fails to produce red-green opponency. The learning theory requires that the LGN units be nearly balanced (more strongly encode chromaticity than luminance) and quantitatively expresses the requirement: the principal component of the LGN outputs must be in the red-green rather than the luminance direction. We show that the cone weights of the monkey LGN cells measured by Derrington, Krauskopf, and Lennie can satisfy this learnability criterion even if the MWS spectral response is close to the LWS spectral response, simulating anomalous trichromacy. The learnability theory provides a source of visual system variation for explaining why different anomalous trichromats may make the same average anomaloscope match (same pigments), but have either narrow (good opponent learning) or wide (poor learning) ranges of acceptable matches.

Ahumada, Albert J., Jr.↗

Learning-based position control of a closed-kinematic chain robot end-effector

A trajectory control scheme whose design is based on learning theory, for a six-degree-of-freedom (DOF) robot end-effector built to study robotic assembly of NASA hardwares in space is presented. The control scheme consists of two control systems: the feedback control system and the learning control system. The feedback control system is designed using the concept of linearization about a selected operating point, and the method of pole placement so that the closed-loop linearized system is stabilized. The learning control scheme consisting of PD-type learning controllers, provides additional inputs to improve the end-effector performance after each trial. Experimental studies performed on a 2 DOF end-effector built at CUA, for three tracking cases show that actual trajectories approach desired trajectories as the number of trials increases. The tracking errors are substantially reduced after only five trials.

Nguyen, Charles C.↗

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↗

Hybrid PSO-ASVR-based method for data fitting in the calibration of infrared radiometer

The present paper describes a hybrid particle swarm optimization-adaptive support vector regression (PSO-ASVR)-based method for data fitting in the calibration of infrared radiometer. The proposed hybrid PSO-ASVR-based method is based on PSO in combination with Adaptive Processing and Support Vector Regression (SVR). The optimization technique involves setting parameters in the ASVR fitting procedure, which significantly improves the fitting accuracy. However, its use in the calibration of infrared radiometer has not yet been widely explored. Bearing this in mind, the PSO-ASVR-based method, which is based on the statistical learning theory, is successfully used here to get the relationship between the radiation of a standard source and the response of an infrared radiometer. Main advantages of this method are the flexible adjustment mechanism in data processing and the optimization mechanism in a kernel parameter setting of SVR. Numerical examples and applications to the calibration of infrared radiometer are performed to verify the performance of PSO-ASVR-based method compared to conventional data fitting methods.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Space Station Freedom - A resource for aerospace education

The role of the International Space Station in future U.S. aerospace education efforts is discussed from a NASA perspective. The overall design concept and scientific and technological goals of the Space Station are reviewed, and particular attention is given to education projects such as the Davis Planetarium Student Space Station, the Starship McCullough, the Space Habitat, the working Space Station model in Austin, TX, the Challenger Center for Space Life Education, Space M+A+X, and the Space Science Student Involvement Program. Also examined are learning-theory aspects of aerospace education: child vs adult learners, educational objectives, teaching methods, and instructional materials.

Brown, Robert W.↗

Two papers on feed-forward networks

Connectionist feed-forward networks, trained with back-propagation, can be used both for nonlinear regression and for (discrete one-of-C) classification, depending on the form of training. This report contains two papers on feed-forward networks. The papers can be read independently. They are intended for the theoretically-aware practitioner or algorithm-designer; however, they also contain a review and comparison of several learning theories so they provide a perspective for the theoretician. The first paper works through Bayesian methods to complement back-propagation in the training of feed-forward networks. The second paper addresses a problem raised by the first: how to efficiently calculate second derivatives on feed-forward networks.

Buntine, Wray L.↗