Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 307 records · Page 17

Machine Learning Applied to Star–Galaxy–QSO Classification and Stellar Effective Temperature Regression

In modern astrophysics, machine learning has increasingly gained popularity with its incredibly powerful ability to make predictions or calculated suggestions for large amounts of data. We describe an application of the supervised machine-learning algorithm, random forests (RF), to the star/galaxy/QSO classification and the stellar effective temperature regression based on the combination of Large Sky Area Multi-Object Fiber Spectroscopic Telescope and Sloan Digital Sky Survey spectroscopic data. This combination enables us to obtain reliable predictions with one of the largest training samples ever used. The training samples are built with a nine-color data set of about three million objects for the classification and a seven-color data set of over one million stars for the regression. The performance of the classification and regression is examined with validation and blind tests on the objects in the RAdial Velocity Extension, 6dFGS, UV-bright Quasar Survey and Apache Point Observatory Galactic Evolution Experiment surveys. We demonstrate that RF is an effective algorithm, with classification accuracies higher than 99% for stars and galaxies, and higher than 94% for QSOs. These accuracies are higher than machine-learning results in former studies. The total standard deviations of the regression are smaller than 200 K, which is similar to those of some spectrum-based methods. The machine-learning algorithm with the broad-band photometry provides us with a more efficient approach for dealing with massive amounts of astrophysical data than do traditional color cuts and spectral energy distribution fits.

79 ASTRONOMY AND ASTROPHYSICS↗

Machine Learning for Identifying Relevance to Biosurveillance in Multilingual Text

Objective: The objective is to develop an ensemble of machine learning algorithms to identify multilingual, online articles that are relevant to biosurveillance. Language morphology varies widely across languages and must be accounted for when designing algorithms. Here, we compare the performance of a word embedding-based approach and a topic modeling approach with machine learning algorithms to determine the best method for Chinese, Arabic, and French languages. Introduction: Global biosurveillance is an extremely important, yet challenging task. One form of global biosurveillance comes from harvesting open source online data (e.g. news, blogs, reports, RSS feeds). The information derived from this data can be used for timely detection and identification of biological threats all over the world. However, the more inclusive the data harvesting procedure is to ensure that all potentially relevant articles are collected, the more data that is irrelevant also gets harvested. This issue can become even more complex when the online data is in a non-native language. Foreign language articles not only create language-specific issues for Natural Language Processing (NLP), but also add a significant amount of translation costs. Previous work shows success in the use of combinatory monolingual classifiers in specific applications, e.g., legal domain [1]. A critical component for a comprehensive, online harvesting biosurveillance system is the capability to identify relevant foreign language articles from irrelevant ones based on the initial article information collected, without the additional cost of full text retrieval and translation.

Machine learning↗

Operations on Graphical Models with Plates

This paper explains how graphical models, for instance Bayesian or Markov networks, can be extended to model problems in data analysis and learning. This provides a unified framework that combines lessons learned from the artificial intelligence, statistical and connectionist communities. This also offers a set of principles for developing a software generator for data analysis, whereby a learning or discovery system can be compiled from specifications. Many of the popular learning algorithms can be compiled in this way from graphical specifications. While in a sense this paper is a multidisciplinary review of learning, the main contribution here is the presentation of the material within the unifying framework of graphical models, and the observation that, as a result, the process of developing learning algorithms can be partly automated.

Buntine, Wray L.↗

Assessment of Cognitive Communications Interest Areas for NASA Needs and Benefits

This effort provides a survey and assessment of various cognitive communications interest areas, including node-to-node link optimization, intelligent routing/networking, and learning algorithms, and is conducted primarily from the perspective of NASA space communications needs and benefits. Areas of consideration include optimization methods, learning algorithms, and candidate implementations/technologies. Assessments of current research efforts are provided with mention of areas for further investment. Other considerations, such as antenna technologies and cognitive radio platforms, are briefly provided as well.

Knoblock, Eric J.↗

Convergence Analysis of a Cascade Architecture Neural Network

In this paper, we present a mathematical foundation, including a convergence analysis, for cascading architecture neural networks. From this, a mathematical foundation for the casade correlation learning algorithm can also be found. Furthermore, it becomes apparent that the cascade correlation scheme is a special case of an efficient hardware learning algorithm called Cascade Error Projection.

Neural Network↗

Hashed Binary Search Sampling for Convolutional Network Training with Large Overhead Image Patches

Very large overhead imagery associated with ground truth maps has the potential to generate billions of training image patches for machine learning algorithms. However, random sampling selection criteria often leads to redundant and noisy-image patches for model training. With minimal research efforts behind this challenge, the current status spells missed opportunities to develop supervised learning algorithms that generalize over wide geographical scenes. In addition, much of the computational cycles for large scale machine learning are poorly spent crunching through noisy and redundant image patches. We demonstrate a potential framework to address these challenges specifically, while evaluating a human settlement detection task. A novel binary search tree sampling scheme is fused with a kernel based hashing procedure that maps image patches into hash-buckets using binary codes generated from image content. The framework exploits inherent redundancy within billions of image patches to promote mostly high variance preserving samples for accelerating algorithmic training and increasing model generalization.

Lunga, Dalton↗

Internal Variability Increased Arctic Amplification During 1980–2022

Abstract Since 1980, the Arctic surface has warmed four times faster than the global mean. Enhanced Arctic warming relative to the global average warming is referred to as Arctic Amplification (AA). While AA is a robust feature in climate change simulations, models rarely reproduce the observed magnitude of AA, leading to concerns that models may not accurately capture the response of the Arctic to greenhouse gas emissions. Here, we use CMIP6 data to train a machine learning algorithm to quantify the influence of internal variability in surface air temperature trends over both the Arctic and global domains. Application of this machine learning algorithm to observations reveals that internal variability increases the Arctic warming but slows global warming in recent decades, inflating AA since 1980 by 38% relative to the externally forced AA. Accounting for the role of internal variability reconciles the discrepancy between simulated and observed AA.

58 GEOSCIENCES↗

Frameworks, Algorithms, and Scalable Technologies for Mathematics (FASTMath) SciDAC Institute

As computational models scale to larger computers, the rate at which they produce data has far outstripped the same computers ability to write that data and further the file systems ability to store that data. Almost all of the SciDAC applications, but especially those related to fusion solve very large scale PDEs whose scientific output his impacted by this problem. To gain access to dynamics in an exascale simulation that are not identifiable a priori and to make that dynamical data available to machine learning requires fundamental research in the area of in situ data data analytics. Here data analytics includes compression, visualization, uncertainty quantification, and machine learning. This in situ data analytics will enable on-the-fly spatial and temporal compression of solution dynamics, expose that space-time compressed field to machine learning algorithms that have been specialized to work with dynamically evolving data (existing machine learning algorithms treat data sets as static), greatly improving the opportunity for machine learning to provide feedback to the compression, all within an ongoing simulation, without the need to write data to files. The same concepts are also being applied to uncertainty quantification and multi-fidelity modeling which have similar needs for spatial and temporal compression of the ongoing exascale simulation to perform either without the typical, unacceptable writing of data to files.

97 MATHEMATICS AND COMPUTING↗

NOvA Reconstruction using Deep Learning [Slides]

The NOvA experiment has made measurements of the disappearance of νμ and the appearance of νe in the NuMI beam at Fermilab. Key to these measurements is the identification of the neutrino flavor and measurement of the neutrino energy, for which NOvA has implemented deep learning algorithms utilizing tools from the field of computer vision. These algorithms, first applied to NOvA's 2016 results, showed significant improvement over previous reconstruction methods. I will present NOvA's implementation of deep learning algorithms using convolutional neural networks for identification of event neutrino flavor and single particles used in the 2018 analysis.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Using active learning to improve quasar identification for the DESI spectra processing pipeline

The Dark Energy Spectroscopic Instrument (DESI) survey uses an automatic spectral classification pipeline to classify spectra. QuasarNET is a convolutional neural network used as part of this pipeline originally trained using data from the Baryon Oscillation Spectroscopic Survey (BOSS). In this paper we implement an active learning algorithm to optimally select spectra to use for training a new version of the QuasarNET weights file using only DESI data, with the goal of improving classification accuracy. This active learning algorithm includes a novel outlier rejection step using a Self-Organizing Map to ensure we label spectra representative of the larger quasar sample observed in DESI. We perform two iterations of the active learning pipeline, assembling a final dataset of 5600 labeled spectra, a small subset of the approximately 1.3 million quasar targets in DESI's Data Release 1. When splitting the spectra into training and validation subsets we achieve similar performance to the previously trained weights file in completeness and purity calculated on the validation dataset but do so with less than one tenth of the amount of training data. The new weights also more consistently classify objects in the same way when used on unlabeled data compared to the old weights file. In the process of improving QuasarNET's classification accuracy we discovered a systemic error in QuasarNET's redshift estimation and used our findings to improve our understanding of QuasarNET's redshifts.

Machine learning↗

An Open, Cloud-Based Platform for Whole-Building Fault Detection and Diagnostics

Small commercial buildings in the U.S. waste an estimated 300 Trillion BTU (approximately $6 billion in energy costs) annually due to faults, but lack cost-effective automated fault detection and diagnosis (AFDD) tools. NREL and GE Global Research are partnering to develop hybrid AFDD algorithms tailored to the unique needs of small commercial buildings (</=10,000 sq. ft.). The approach combines physics-based energy modeling tools with state-of-the-art machine learning algorithms to enable diagnostics using modeled input data. NREL, in partnership with Purdue University, has adapted DOE's physics-based modeling software EnergyPlus and OpenStudio to simulate common building faults. Cloud-based implementations of these physics-based models were used to generate data for multiple climate zones. The data were then used to train machine learning algorithms, such as those available in GE's Predix platform, to detect and diagnose building faults. Key features of the system including the automated, cloud-implementation of EnergyPlus, genetic algorithms for automated model feature selection, multiclass detection and diagnosis models, and anomaly detection algorithms will be presented.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

A Novel Spatial-Temporal Variational Quantum Circuit to Enable Deep Learning on NISQ Devices

Quantum computing presents a promising approach for machine learning with its capability for extremely parallel computation in high-dimension through superposition and entanglement. Despite its potential, existing quantum learning algorithms, such as Variational Quantum Circuits (VQCs), face challenges in handling more complex datasets, particularly those that are not linearly separable. What’s more, it encounters the deployability issue, making the learning models suffer a drastic accuracy drop after deploying them to the actual quantum devices. To overcome these limitations, this paper proposes a novel spatial-temporal design, namely “ST-VQC”, to integrate nonlinearity in quantum learning and improve the robustness of the learning model to noise. Specifically, ST-VQC can extract spatial features via a novel block-based encoding quantum sub-circuit coupled with a layer-wise computation quantum sub-circuit to enable temporal-wise deep learning. Additionally, a SWAP-Free physical circuit design is devised to improve robustness. These designs bring a number of hyperparameters. After a systematic analysis of the design space for each design component, an automated optimization framework is proposed to generate the ST-VQC quantum circuit. The proposed ST-VQC has been evaluated on two IBM quantum processors, ibm-cairo with 27 qubits and ibmq-lima with 7 qubits to assess its effectiveness. The results of the evaluation on the standard dataset for binary classification show that ST-VQC can achieve over 30% accuracy improvement compared with existing VQCs on actual quantum computers. Moreover, on a non-linear synthetic dataset, the STVQC outperforms a linear classifier by 27.9%, while the linear classifier using classical computing outperforms the existing VQC by 15.58%.

Li, Jinyang↗

Exploring End-to-end Deep Learning Applications for Event Classification at CMS

An essential part of new physics searches at the Large Hadron Collider (LHC) at CERN involves event classification, or distinguishing potential signal events from those coming from background processes. Current machine learning techniques accomplish this using traditional hand-engineered features like particle 4-momenta, motivated by our understanding of particle decay phenomenology. While such techniques have proven useful for simple decays, they are highly dependent on our ability to model all aspects of the phenomenology and detector response. Meanwhile, powerful deep learning algorithms are capable of not only training on high-level features, but of performing feature extraction. In computer vision, convolutional neural networks have become the state-of-the-art for many applications. Motivated by their success, we apply deep learning algorithms to low-level detector data from the 2012 CMS Simulated Open Data to directly learn useful features, in what we call, end-to-end event classification. We demonstrate the power of this approach in the context of a physics search and offer solutions to some of the inherent challenges, such as image construction, image sparsity, combining multiple sub-detectors, and de-correlating the classifier from the search observable, among others.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Short-term electricity load forecasting: Application-driven evaluation of machine learning models across spatial and temporal scales

As we transition towards a decarbonized economy, the integration of variable renewable energy resources and new demands (e.g., electric vehicles, heat pumps) into the electricity grid places unprecedented pressure on grid operators to effectively anticipate and manage peak load. In this context, machine learning algorithms are proving to be indispensable for accurate short-term load forecasting, a crucial task to address these challenges. This study benchmarks 6 machine learning algorithms, including three neural networks and three tree-based algorithms, across various levels of spatial aggregation and time horizons (1, 4, 8, 24, and 48 h). The central contribution of this work is the comparison and analysis of load forecasting models not only based on statistical metrics, but also based on a novel error metric, which evaluates the cost implications of forecast errors for power system stakeholders. Results show that tree-based models outperform neural networks, based on statistical metrics, and yield less skewed error distributions for most spatial scales. However, through the lens of the novel error metric, neural networks are the more competitive choice, especially for forecast horizons that exceed 8 h. The study concludes with actionable recommendations to grid operators and highlights the need for the development of error metrics that link forecasting accuracy to operational costs. To promote transparency and open science, the datasets and Python code are open-sourced via a supplementary repository.

Houben, Nikolaus↗

Active learning in the presence of unlabelable examples

We propose a new active learning framework where the expert labeler is allowed to decline to label any example. This may be necessary because the true label is unknown or because the example belongs to a class that is not part of the real training problem. We show that within this framework, popular active learning algorithms (such as Simple) may perform worse than random selection because they make so many queries to the unlabelable class. We present a method by which any active learning algorithm can be modified to avoid unlabelable examples by training a second classifier to distinguish between the labelable and unlabelable classes. We also demonstrate the effectiveness of the method on two benchmark data sets and a real-world problem.

active learning↗

TU-C-12A-12: Differentiating Bone Lesions and Degenerative Joint Disease in NaF PET/CT Scans Using Machine Learning

Purpose: [F-18]NaF PET can be used to image bone metastases; however, tracer uptake in degenerative joint disease (DJD) often appears similar to metastases. This study aims to develop and compare different machine learning algorithms to automatically identify regions of [F-18]NaF scans that correspond to DJD. Methods: 10 metastatic prostate cancer patients received whole body [F-18]NaF PET/CT scans prior to treatment. Image segmentation resulted in 852 ROIs, 69 of which were identified by a nuclear medicine physician as DJD. For all ROIs, various PET and CT textural features were computed. ROIs were divided into training and testing sets used to train eight different machine learning classifiers. Classifiers were evaluated based on receiver operating characteristics area under the curve (AUC), sensitivity, specificity, and positive predictive value (PPV). We also assessed the added value of including CT features in addition to PET features for training classifiers. Results: The training set consisted of 37 DJD ROIs with 475 non-DJD ROIs, and the testing set consisted of 32 DJD ROIs with 308 non-DJD ROIs. Of all classifiers, generalized linear models (GLM), decision forests (DF), and support vector machines (SVM) had the best performance. AUCs of GLM (0.929), DF (0.921), and SVM (0.889) were significantly higher than the other models (p<0.001). GLM and DF, overall, had the best sensitivity, specificity, and PPV, and gave a significantly better performance (p<0.01) than all other models. PET/CT GLM classifiers had higher AUC than just PET or just CT. GLMs built using PET/CT information had superior or comparable sensitivities, specificities and PPVs to just PET or just CT. Conclusion: Machine learning algorithms trained with PET/CT features were able to identify some cases of DJD. GLM outperformed the other classification algorithms. Using PET and CT information together was shown to be superior to using PET or CT features alone. Research supported by the Prostate Cancer Foundation.

60 APPLIED LIFE SCIENCES↗

An estimation algorithm with learning feature for an adaptive bit synchronizer.

Description of an on-line optimal (in the sense of linear minimum mean square error) sequential bit synchronizer assuming minimal a priori knowledge of the incoming data. The adaptive synchronization algorithms, implemented on a small computer, are capable of accurately estimating pulse transition time, pulse amplitude, and pulse width by invoking the powerful Gauss-Markov theorem. Numerous simulations indicate that the performance of the synchronizer is satisfactory from the point of view of the amount of data required and the speed of convergence.

Chow, L. R.↗

Chapter 7: Predictive Analytics in Future Power Systems: A Panorama and State-of-the-Art of Deep Learning Applications

The challenges surrounding the optimal operation of power systems are growing in various dimensions, due in part to increasingly distributed energy resources and a progression towards large-scale transportation electrification. Currently, the increasing uncertainties associated with both renewable energy generation and demand are largely being managed by increasing operational reserves - potentially at the cost of suboptimal economic conditions - in order to maintain the reliability of the system. This chapter looks at the big picture role of forecasting in power systems from generation to consumption and provides a comprehensive review of traditional approaches for forecasting generation and load in various contexts. This chapter then takes a deep dive into the state-of-the-art machine learning and deep learning approaches for power systems forecasting. Furthermore, a case study of multi-time-horizon solar irradiance forecasting using deep learning is discussed in detail. Smart grids form the backbone of the future interdependent networks. For addressing the challenges associated with the operations of smart grid, development and wide adoption of machine learning and deep learning algorithms capable of producing better forecasting accuracies is urgently needed. Along with exploring the implementation and benefits of these approaches, this chapter also considers the strengths and limitations of deep learning algorithms for power systems forecasting applications. This chapter, thus, provides a panoramic view of state-of-the-art of predictive analytics in power systems in the context of future smart grid operations.

24 POWER TRANSMISSION AND DISTRIBUTION↗