Search NASA⌕ Search

SEARCH · Search NASA

Results for “Learning Algorithm”

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 1,081 records · Page 60

Quantum Machine Learning over Infinite Dimensions

Machine learning is a fascinating and exciting eld within computer science. Recently, this ex- citement has been transferred to the quantum information realm. Currently, all proposals for the quantum version of machine learning utilize the nite-dimensional substrate of discrete variables. Here we generalize quantum machine learning to the more complex, but still remarkably practi- cal, in nite-dimensional systems. We present the critical subroutines of quantum machine learning algorithms for an all-photonic continuous-variable quantum computer that achieve an exponential speedup compared to their equivalent classical counterparts. Finally, we also map out an experi- mental implementation which can be used as a blueprint for future photonic demonstrations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Neuroevolutionary Learning of Particles and Protocols for Self-Assembly

Within simulations of molecules deposited on a surface we show that neuroevolutionary learning can design particles and time-dependent protocols to promote self-assembly, without input from physical concepts such as thermal equilibrium or mechanical stability and without prior knowledge of candidate or competing structures. Furthermore, the learning algorithm is capable of both directed and exploratory design: it can assemble a material with a user-defined property, or search for novelty in the space of specified order parameters. In the latter mode it explores the space of what can be made, rather than the space of structures that are low in energy but not necessarily kinetically accessible.

74 ATOMIC AND MOLECULAR PHYSICS↗

Magnetism in metastable and annealed compositionally complex alloys

Compositionally complex materials (CCMs) present a potential paradigm shift in the design of magnetic materials. These alloys exhibit long-range structural order coupled with limited or no chemical order. As a result, extreme local environments exist with a large variations in the magnetic energy terms, which can manifest large changes in the magnetic behavior. In the current work, the magnetic properties of (Cr, Mn, Fe, Ni) alloys are presented. These materials were prepared by room-temperature combinatorial sputtering, resulting in a range of compositions with a single bcc structural phase and no chemical ordering. The combinatorial growth technique allows CCMs to be prepared outside of their thermodynamically stable phase, enabling the exploration of otherwise inaccessible order. The mixed ferromagnetic and antiferromagnetic interactions in these alloys causes frustrated magnetic behavior, which results in an extremely low coercivity (<1mT), which increases rapidly at 50 K. At low temperatures, the coercivity achieves values of nearly 500 mT, which is comparable to some high-anisotropy magnetic materials. Further, commensurate with the divergent coercivity is an atypical drop in the temperature dependent magnetization. These effects are explained by a mixed magnetic phase model, consisting of ferro-, antiferro-, and frustrated magnetic regions, and are rationalized by simulations. A machine-learning algorithm is employed to visualize the parameter space and inform the development of subsequent compositions. Annealing the samples at 600 °C orders the sample, more-than doubling the Curie temperature and increasing the saturation magnetization by as much as 5×. Simultaneously, the large coercivities are suppressed, resulting in magnetic behavior that is largely temperature independent over a range of 350 K. The ability to transform from a hard magnet to a soft magnet over a narrow temperature range makes these materials promising for heat-assisted recording technologies.

36 MATERIALS SCIENCE↗

Observation of 𝑡⁢𝑊⁢𝑍 Production at the CMS Experiment

The first observation of single top quark production in association with a 𝑊 and a 𝑍 boson in proton-proton collisions is reported. The analysis uses data at center-of-mass energies of 13 and 13.6 TeV recorded with the CMS detector at the CERN LHC, corresponding to a total integrated luminosity of 200 fb −1 . Events with three or four charged leptons, which can be electrons or muons, are selected. Advanced machine-learning algorithms and improved reconstruction methods, compared to an earlier analysis, result in an unprecedented sensitivity to 𝑡⁢𝑊⁢𝑍 production. The measured cross sections for 𝑡⁢𝑊⁢𝑍 production are 248 ± 52 fb and 242 ± 77 fb for $\sqrt{s}$ =13 and 13.6 TeV, respectively. The signal is established with a statistical significance of 5.8 standard deviations, with 3.5 expected, compared to the background-only hypothesis.

Hayrapetyan, Aram [Yerevan Physics Institute]↗

Classification of AB O 3 perovskite solids: a machine learning study

Here we explored the use of machine learning methods for classifying whether a particular AB O 3 chemistry forms a perovskite or non-perovskite structured solid. Starting with three sets of feature pairs (the tolerance and octahedral factors, the A and B ionic radii relative to the radius of O, and the bond valence distances between the A and B ions from the O atoms), we used machine learning to create a hyper-dimensional partial dependency structure plot using all three feature pairs or any two of them. Doing so increased the accuracy of our predictions by 2–3 percentage points over using any one pair. We also included the Mendeleev numbers of the A and B atoms to this set of feature pairs. Moreover, doing this and using the capabilities of our machine learning algorithm, the gradient tree boosting classifier, enabled us to generate a new type of structure plot that has the simplicity of one based on using just the Mendeleev numbers, but with the added advantages of having a higher accuracy and providing a measure of likelihood of the predicted structure.

36 MATERIALS SCIENCE↗

Mini-apps for high performance data analysis

Scaling-up scientific data analysis and machine learning algorithms for data-driven discovery is a grand challenge that we face today. Despite the growing need for analysis from science domains that are generating `Big Data' from instruments and simulations, building high-performance analytical workflows of data-intensive algorithms have been daunting because: (i) the `Big Data' hardware and software architecture landscape is constantly evolving, (ii) newer architectures impose new programming models, and (iii) data-parallel kernels of analysis algorithms and their performance facets on different architectures are poorly understood. To address these problems, we have: (i) identified scalable data-parallel kernels of popular data analysis algorithms, (ii) implemented `Mini-Apps' of those kernels using different programming models (e.g. Map Reduce, MPI, etc.), (iii) benchmarked and validated the performance of the kernels in diverse architectures. In this paper, we discuss two of those Mini-Apps and show the execution of principal component analysis built as a workflow of the Mini-Apps. We show that Mini-Apps enable scientists to (i) write domain-specific data analysis code that scales on most HPC hardware and (ii) and offers the ability (most times with over a 10x speed-up) to analyze data sizes 100 times the size of what off-the-shelf desktop/workstations of today can handle.

Sukumar, Sreenivas R.↗

On-demand data analytics in HPC environments at leadership computing facilities: Challenges and experiences

Scaling-up scientific data analysis and machine learning algorithms for data-driven discovery is a grand challenge that we face today. Despite the growing need for analysis from science domains that are generating `Big Data' from instruments and simulations, building high-performance analytical workflows of data-intensive algorithms have been daunting because: (i) the `Big Data' hardware and software architecture landscape is constantly evolving, (ii) newer architectures impose new programming models, and (iii) data-parallel kernels of analysis algorithms and their performance facets on different architectures are poorly understood. To address these problems, we have: (i) identified scalable data-parallel kernels of popular data analysis algorithms, (ii) implemented `Mini-Apps' of those kernels using different programming models (e.g. Map Reduce, MPI, etc.), (iii) benchmarked and validated the performance of the kernels in diverse architectures. In this paper, we discuss two of those Mini-Apps and show the execution of principal component analysis built as a workflow of the Mini-Apps. We show that Mini-Apps enable scientists to (i) write domain-specific data analysis code that scales on most HPC hardware and (ii) and offers the ability (most times with over a 10x speed-up) to analyze data sizes 100 times the size of what off-the-shelf desktop/workstations of today can handle.

Harney, John↗

IL-Net: Using Expert Knowledge to Guide the Design of Furcated Neural Networks

Deep neural networks (DNN) excel at extracting patterns. Through representation learning and automated feature engineering on large datasets, such models have been highly successful in computer vision and natural language applications. Designing optimal network architectures from a principled or rational approach however has been less than successful, with the best successful approaches utilizing an additional machine learning algorithm to tune the network hyperparameters. However, in many technical fields, there exist established domain knowledge and understanding about the subject matter. In this work, we develop a novel furcated neural network architecture that utilizes domain knowledge as high-level design principles of the network. We demonstrate proof-of-concept by developing IL-Net, a furcated network for predicting the properties of ionic liquids, which is a class of complex multi-chemicals entities. Compared to existing state-of-the-art approaches, we show that furcated networks can improve model accuracy by approximately 20-35%, without using additional labeled data. Lastly, we distill two key design principles for furcated networks that can be adapted to other domains.

Sakloth, Khushmeen↗

Learning with Adaptive Conservativeness for Distributionally Robust Optimization: Incentive Design for Voltage Regulation

Information asymmetry between the Distribution System Operator (DSO) and Distributed Energy Resource Aggregators (DERAs) obstructs designing effective incentives for voltage regulation. To capture this effect, we employ a Stackelberg game-theoretic framework, where the DSO seeks to overcome the information asymmetry and refine its incentive strategies by learning from DERA behavior over multiple iterations. We introduce a model-based online learning algorithm for the DSO, aimed at inferring the relationship between incentives and DERA responses. Given the uncertain nature of these responses, we also propose a distributionally robust incentive design model to control the probability of voltage regulation failure and then reformulate it into a convex problem. This model allows the DSO to periodically revise distribution assumptions on uncertain parameters in the decision model of the DERA. Finally, we present a gradient-based method that permits the DSO to adaptively modify its conservativeness level, measured by the size of a Wasserstein metric-based ambiguity set, according to historical voltage regulation performance. The effectiveness of our proposed method is demonstrated through numerical experiments.

adaptation models↗

Semi-Supervised Disaggregation of Load Profiles at Transmission Buses with Significant Behind-the-Meter Solar Generations

It is of imperative interests for regional transmission organizations (RTOs) to effectively extract daily load profiles at transmission buses, which remains a gap in existing technology paradigm. This digest proposes an explicit yet efficient linear estimator, to disaggregate metered load profiles at buses with significant behind-the-meter (BTM) solar generations in a data driven manner. The proposed estimator is based on utility zonal load profiles and proxy solar irradiance profiles, which in reality is the aggregated waveform at each transmission bus and equivalent to the mix of summed load profiles minus actual BTM solar generation. To overcome technical challenges in the lack of “ground truth” and validate the performance of supervised learning algorithms, we propose semi-supervised mechanisms with parameter tuning, and leverage the unique characteristics of zero-crossing points in BTM solar peaking behaviors.

machine leaning, behind-the-meter, power grid anal↗

Fast Frequency Response using Reinforcement Learning-Controlled Wind Turbines

To fulfill the auxiliary grid services such as load regulation, spin and non-spin reserve, and frequency support during emergencies, power system operators often require certain wind farms to operate in de-loaded modes. By leveraging the fast response capability of wind farms, the reserved power in deloaded modes can significantly enhance the stability and reliability of power grids. This paper presents a novel methodology that incorporates wind turbines into reinforcement learning-based solutions for frequency response. The proposed approach employs the state-of-the-art reinforcement learning algorithm, surrogategradient- based evolution strategy (GSES), for continuous control of the wind farm output. Our methodology is tested on a modified IEEE-39 bus system, and simulation outcomes demonstrate that the proposed approach can reliably support the frequency of the power system and prevent unnecessary load shedding.

Gao, Wei↗

Anomaly detection for MPC forecast in Fleet of Water Heaters

Among residential devices, water heaters consume 20% of home energy use in the United States. Water heaters possess the capability to store energy within their reservoirs, enabling the ability to decouple energy use from hot water use. This capability can be used to reduce energy usage and costs while also supporting grid services. This requires accurate forecasting of the parameters of the water heater such as upper and lower temperatures. In this study, we analyzed the performance and behavior of a water heater model used in the real-world to predict a control mechanism that is implemented in a smart residential neighborhood. The model forecasts are accurate in most cases but not all. In such scenarios, error correction of the model is necessary to further improve model predictive control accuracy. Anomaly detection is the first step of error correction. This study complements existing research by grouping time series data into two clusters one with anomalies and another without anomalies. To achieve this task, we explored and compared multiple unsupervised machine learning algorithms to perform clustering. Among these algorithms, Ward clustering has the lowest running time and identified the highest number of anomalies for the upper temperature limit. The proposed approach is tested based on the data collected in a neighborhood with 46 townhomes located in Atlanta, GA.

Lebakula, Viswadeep↗

Communication-Avoiding and Memory-Constrained Sparse Matrix-Matrix Multiplication at Extreme Scale

Sparse matrix-matrix multiplication (SpGEMM) is a widely used kernel in various graph, scientific computing and machine learning algorithms. In this paper, we consider SpGEMMs performed on hundreds of thousands of processors generating trillions of nonzeros in the output matrix. Distributed SpGEMM at this extreme scale faces two key challenges: (1) high communication cost and (2) inadequate memory to generate the output. Furthermore, we address these challenges with an integrated communication-avoiding and memory-constrained SpGEMM algorithm that scales to 262,144 cores (more than 1 million hardware threads) and can multiply sparse matrices of any size as long as inputs and a fraction of output fit in the aggregated memory. As we go from 16,384 cores to 262,144 cores on a Cray XC40 supercomputer, the new SpGEMM algorithm runs 10x faster when multiplying large-scale protein-similarity matrices.

97 MATHEMATICS AND COMPUTING↗

Autonomous Anomaly Detection for MPC Forecasts of HVAC Systems in Residential Communities

The use of residential heating, ventilation, and air conditioning (HVAC) to shift peak demand or provide ancillary services is a potential solution in the presence of older grids and distributed renewables. However, to ensure the efficient use of devices, utilities need to accurately forecast the load and adopt error correction schemes when necessary. While significant theoretical research exists in the area of predictive control of HVAC, little experimental evidence exists. The lack of experimental data in turn causes researchers to be unprepared for unsystematic errors which emerge due to the higher complexity of the data generating process. This study offers an anomaly detection methodology that uses unsupervised machine learning algorithms to detect and isolate these errors with different forecast error ranges. The results of anomaly detection procedure can then be used for error correction and would eventually help develop better predictive controllers. The methodology is tested using real world data from a smart neighborhood that currently operates in Atlanta. GA.

Lebakula, Viswadeep↗

A Data-Driven Framework for Residential Electric Vehicle Charging Load Profile Generation

Residential electric vehicle charging load profile is indispensable to achieve reliable control strategies for mitigating negative effects on power distribution system due to emerging electrified transportation. This paper introduces a data-driven framework of charging load profile generation for residential plug-in electric vehicles. Real world historical residential charging behavior data is utilized to construct empirical charging decision making model by using machine learning algorithm. A multiple channels method with kernel density estimation is proposed to construct probability density functions for estimating charging duration based on parking duration. A generation algorithm considering parking time and travel demand dependency is introduced to generate residential charging behaviors. This framework is extensible to generate various charging load profiles and simulate varied residential charging scenarios under different number of households and charging rates. This will be crucial for designing and validating residential charging control strategies.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Modular Spiking Neural Circuits for Mapping Long Short-Term Memory on a Neurosynaptic Processor

Due to the distributed and asynchronous nature of neural computation through low-energy spikes, brain-inspired hardware systems offer high energy efficiency and massive parallelism. One such platform is the IBM TrueNorth neurosynaptic system. Recently, TrueNorth compatible representation learning algorithms have emerged, achieving close to the state-of-the-art performance in various data sets. However, its application in temporal sequence processing models, such as recurrent neural networks (RNNs), is still only at the proof of concept level. There is an inherent difficulty in capturing temporal dynamics of an RNN using spiking neurons, which is only exasperated by the hardware constraints in connectivity and synaptic weight resolution. This paper presents a design flow that overcomes these difficulties and maps a special case of recurrent networks called long short-term memory (LSTM) onto a spike-based platform. The framework utilizes various approximation techniques, such as activation discretization, weight quantization, and scaling and rounding, spiking neural circuits that implement the complex gating mechanisms, and a store-and-release technique to enable neuron synchronization and faithful storage. While the presented techniques can be applied to map LSTM to any spiking neural network (SNN) simulator/emulator, here we choose the TrueNorth chip as the target platform by adhering to its hardware constraints. Three LSTM applications, parity check, extended Reber grammar, and question classification, are evaluated. The tradeoffs among accuracy, performance, and energy tradeoffs achieved on TrueNorth are demonstrated. Finally, this is compared with the performance on an SNN platform without hardware constraints, which represents the upper bound of the achievable accuracy.

97 MATHEMATICS AND COMPUTING↗

Marine Animal Classification With Correntropy-Loss-Based Multiview Learning

To analyze marine animals' behavior, seasonal distribution, and abundance, digital imagery can be acquired by a camera or a Lidar. Depending on the quantity and properties of acquired imagery, the animals are characterized as either features (shape, color, texture, etc.) or dissimilarity matrices derived from different shape analysis methods (shape context, internal distance shape context, etc.). For both cases, multiview learning is critical in integrating more than one set of feature/dissimilarity matrix for higher classification accuracy. This paper adopts correntropy loss as the cost function in multiview learning, which has favorable statistical properties for rejecting noise. For the case of features, the correntropy-loss-based multiview learning and its “entrywise” variation are developed based on the multiview intact space learning algorithm. For the case of dissimilarity matrices, the robust Euclidean embedding algorithm is extended to its multiview form with the correntropy loss function. Results from simulated data and real-world marine animal imagery show that the proposed algorithms can effectively enhance classification rate as well as suppress noise under different noise conditions.

59 BASIC BIOLOGICAL SCIENCES↗

Intelligent Electrochemical Sensors for Precise Identification of Volatile Organic Compounds Enabled by Neural Network Analysis

The volatile organic compounds (VOCs) in a wide spectrum of categories were identified as biomarkers in aquatic environments, playing an important role in marine and freshwater ecology and global atmospheric chemistry. VOCs released from biofuel have also attracted increasing attention. Although the importance has been recognized, the portable detection and analysis methods of VOC in aquatic systems have not yet been well developed and understood. Here, in this work, we innovatively proposed an intelligent electrochemical sensing approach to classify and quantify VOCs in solution. Utilizing the cyclic voltammetry (CV) method with an ionic liquid (IL)-based electrolyte, we analyzed 50 μL samples of various VOC analytes, including acetic acid (AC), acetone, dimethylformamide (DMF), dimethyl sulfoxide (DMSO), ethanol, formaldehyde, formic acid, methanol, methyl formate (MF), toluene, and a formaldehyde-methanol mixture, along with deionized water (DI water). The generated voltammograms were subsequently analyzed using our uniquely designed and optimized 1-D convolutional neural network (1D-CNN). This deep-learning algorithm achieved a 99.09% accuracy in VOC classification validated through fivefold cross-validation and demonstrated an impressive 94.4% test accuracy for methanol detection within a 10 μL error range. For quantification, the system accurately categorized methanol volumes ranging from 0 to 50 μL in 10 μL increments, achieving a 98.18% accuracy. A notable linear correlation (R2 = 95.56%) was found between max current density at the oxidation peak and methanol volume, with the limit of detection (LOD) at 9.3 μL. Such a sensing method exhibits potential for portability, high accuracy, and generalization in the classification and quantification, ultimately reshaping the realm of VOC analysis in solution.

42 ENGINEERING↗