Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Machine Learning Algorithms”

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 757 records · Page 42

Simple and efficient algorithms for training machine learning potentials to force data

Machine learning models, trained on data from ab initio quantum simulations, are yielding molecular dynamics potentials with unprecedented accuracy. One limiting factor is the quantity of available training data, which can be expensive to obtain. A quantum simulation often provides all atomic forces, in addition to the total energy of the system. These forces provide much more information than the energy alone. It may appear that training a model to this large quantity of force data would introduce significant computational costs. Actually, training to all available force data should only be a few times more expensive than training to energies alone. Here, we present a new algorithm for efficient force training, and benchmark its accuracy by training to forces from real-world datasets for organic chemistry and bulk aluminum.

74 ATOMIC AND MOLECULAR PHYSICS↗

FY22 Progress Report: SRNL Analysis of ICCWR LCM and WAMS Data for Corrosion and Cracking

Algorithms for machine learning and data analysis for the 3013 Surveillance Program are being developed in an ongoing collaborative effort by the Savannah River National Laboratory (SRNL) and the University of South Carolina (USC). To detect the presence of corrosion and cracking, data is collected from large binary files generated by a Laser Confocal Microscope (LCM) or Wide Area 3D Measurement System (WAMS). Software is being developed to use the physical attributes in the data files (e.g., height, color, and grayscale values; all as functions of a location in a plane projection) to detect the presence of surface corrosion and cracking. A user-friendly Matlab Graphical User Interface (GUI) that reads data from either LCM or WAMS files was developed to integrate input data with software developed for processing and evaluation. The GUI can selectively download binary data, interrogate data attributes, label data for training ML algorithms, flag significant features, execute Machine Learning (ML) algorithms, output parameters from trained ML algorithms, report ML model accuracy with respect to labeled data, and generate graphical representations for various analyses. Surface defects can be called out by setting user-specified thresholds, feature based analysis or machine learning algorithms. Enhancements to data labeling capability have been developed to address this essential precursor to application of ML routines. Efficient labeling is particularly important in view of the very large volume of data required to train ML algorithms.

3013 Corrosion↗

Benchmarking for AI for Science

AI has been instrumental for recent developments in a number of domains of the sciences. With several hundred machine learning (ML) algorithms and models, and numerous AI-specific hardware platforms, a common quest for all scientists working on AI for Science is around the selection of machine learning algorithm(s) to solve their domain-specific scientific problems. A number of different initiatives around AI Benchmarking have been set up and have been useful in understanding the benefits of different ML algorithms for different tasks.However, with the majority of these AI Benchmarking initiatives focusing on the conventional notions of benchmarking, where the focus is purely runtime performance (such as training time or inference time), their suitability for benchmarking different ML algorithms for solving scientific problems has been viewed as a performance problem even though both are hardly the same. To make reasonable, explainable, and justifiable advancements in science using AI, it is critical to focus on the merits of these algorithms in handling different domain science problems. In other words, more emphasis must be given on Benchmarking for AI for Science than AI Benchmarking. The vision of the former is not only to assess the performance of ML algorithms, but also to assess, and understand the benefits and merits of different ML algorithms in handling scientific problems. Benchmarking for AI for Science, instead of pure performance focused AI Benchmarking, has several benefits: (i) it has the potential to offer advances in the sciences, much more rapidly than through pure performance-based AI methods, (ii) it will encourage the community to focus on developing better domain-specific AI techniques, particularly given the provision for being able to benchmark different techniques, and (iii) it will encourage hardware manufacturers to focus on developing science-specific hardware subsystems.

Thiyagalingam, Jeyan↗

Data-Driven Specification of Earth's Magnetic Field

As our society is increasingly dependent on technologies in space, predicting space weather becomes ever more important. We have come to rely on technologies such as cellphones, GPS, the Internet, and other commercial and military assets. In order to protect these systems a high priority is to develop better understanding of the harmful conditions of space weather encountered in the near-Earth radiation environment which are mostly dictated by the dynamics of energetic charged particles. The main objective of our proposal was to improve the specification and forecast of the particle distribution in the Earth’s inner magnetosphere using data assimilation together with machine learning (ML) algorithms in our ring current-atmosphere interactions model with self-consistent magnetic and electric fields (RAM-SCBE). Specifically, we explored the application of machine learning algorithms to emulate and improve, through infusion of observational data, the magnetic field (SCBE) of our ring current model. Our work advanced towards the characterization of the RAM-SCBE particle flux field and its potentially different simulation scenarios. We explored how the model behaves in a number of simulation scenarios in order to better understand how the model reacts to perturbations in the solar wind. We were able to capture this behavior through the simulation of an ensemble of RAM-SCB model solutions. The ensemble showed the important correlations between the particle fluxes and the magnetic field. We were able to start the training of a neural network (Autoencoder) to identify the dominant features of the magnetic field, and the main correlations (linear and non-linear) between the particle fluxes and the magnetic field. Our next steps consists of training a neural network to capture the time evolution of the dominant features and obtain a consistent surrogate model for the RAM-SCB.

42 ENGINEERING↗

ML-GA

ML-GA is a software that can be used to expedite design optimization process combining machine learning and genetic algorithm approaches. It employs a machine learning (ML) model (any ML algorithm can be incorporated) to predict the quality (merit) of a design from the input parameters. Then, a stochastic global optimization genetic algorithm (GA) is used, with the machine learning model as the objective function, to optimize the input parameters based on the merit function. ML-GA is scalable to higher computational platforms like supercomputers and clusters enabling optimization to be performed in significantly short time frames (e.g., in a day).

PAL, PINAKI↗

AI Meets Exascale Computing: Advancing Cancer Research With Large-Scale High Performance Computing

The application of data science in cancer research has been boosted by major advances in three primary areas: (1) Data: diversity, amount, and availability of biomedical data; (2) Advances in Artificial Intelligence (AI) and Machine Learning (ML) algorithms that enable learning from complex, large-scale data; and (3) Advances in computer architectures allowing unprecedented acceleration of simulation and machine learning algorithms. These advances help build in silico ML models that can provide transformative insights from data including: molecular dynamics simulations, next-generation sequencing, omics, imaging, and unstructured clinical text documents. Unique challenges persist, however, in building ML models related to cancer, including: (1) access, sharing, labeling, and integration of multimodal and multi-institutional data across different cancer types; (2) developing AI models for cancer research capable of scaling on next generation high performance computers; and (3) assessing robustness and reliability in the AI models. In this paper, we review the National Cancer Institute (NCI) -Department of Energy (DOE) collaboration, Joint Design of Advanced Computing Solutions for Cancer (JDACS4C), a multi-institution collaborative effort focused on advancing computing and data technologies to accelerate cancer research on three levels: molecular, cellular, and population. This collaboration integrates various types of generated data, pre-exascale compute resources, and advances in ML models to increase understanding of basic cancer biology, identify promising new treatment options, predict outcomes, and eventually prescribe specialized treatments for patients with cancer.

60 APPLIED LIFE SCIENCES↗

Dynamic machine learning-based optimization algorithm to improve boiler efficiency

With decreasing computational costs, improvement in algorithms, and the aggregation of large industrial and commercial datasets, machine learning is becoming a ubiquitous tool for process and business innovations. Machine learning is still lacking applications in the field of dynamic optimization for real-time control. This work presents a novel framework for performing constrained dynamic optimization using a recurrent neural network model combined with a metaheuristic optimizer. The framework is designed to augment an existing control system and is purely data-driven, like most industrial Model Predictive Control applications. Several recurrent neural network models are compared as well as several metaheuristic optimizers. Hyperparameters and optimizer parameters are tuned with parameter sweeps, and the resulting values are reported. Further, the best parameters for each optimizer and model combination are demonstrated in closed-loop control of a dynamic simulation, and several recommendations are made for generalizing this framework to other systems. Up to 0.953% improvement is realized over the non-optimized case for a simulated coal-fired boiler. While this is not a large improvement in percentage, the total economic impact is $991,000 per year, and this study builds a foundation for future machine learning with dynamic optimization.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Discriminating Quantum States with Quantum Machine Learning

Quantum machine learning (QML) algorithms have obtained great relevance in the machine learning (ML) field due to the promise of quantum speedups when performing basic linear algebra subroutines (BLAS), a fundamental element in most ML algorithms. By making use of BLAS operations, we propose, implement and analyze a quantum k-means (qk-means) algorithm with a low time complexity of O(NKlog(D)I/C) to apply it to the fundamental problem of discriminating quantum states at readout. Discriminating quantum states allows the identification of quantum states |0⟩ and |1⟩ from low-level in-phase and quadrature signal (IQ) data, and can be done using custom ML models. In order to reduce dependency on a classical computer, we use the qk-means to perform state discrimination on the IBMQ Bogota device and managed to find assignment fidelities of up to 98.7% that were only marginally lower than that of the k-means algorithm. We also performed a cross-talk benchmark on the quantum device by applying both algorithms to perform state discrimination on a combination of quantum states and using Pearson Correlation coefficients and assignment fidelities of discrimination results to conclude on the presence of cross-talk on qubits. Evidence shows cross-talk in the (1, 2) and (2, 3) neighboring qubit couples for the analyzed device.

Quiroga, David↗

What does fault tolerant Deep Learning need from MPI?

Deep Learning (DL) algorithms have become the {\em de facto} Machine Learning (ML) algorithm for large scale data analysis. DL algorithms are computationally expensive -- even distributed DL implementations which use MPI require days of training (model learning) time on commonly studied datasets. Long running DL applications become susceptible to faults -- requiring development of a fault tolerant system infrastructure, in addition to fault tolerant DL algorithms. This raises an important question: {\em What is needed from MPI for designing fault tolerant DL implementations?} In this paper, we address this problem for permanent faults. We motivate the need for a fault tolerant MPI specification by an in-depth consideration of recent innovations in DL algorithms and their properties, which drive the need for specific fault tolerance features. We present an in-depth discussion on the suitability of different parallelism types (model, data and hybrid); a need (or lack thereof) for check-pointing of any critical data structures; and most importantly, consideration for several fault tolerance proposals (user-level fault mitigation (ULFM), Reinit) in MPI and their applicability to fault tolerant DL implementations. We leverage a distributed memory implementation of Caffe, currently available under the Machine Learning Toolkit for Extreme Scale (MaTEx). We implement our approaches by extending MaTEx-Caffe for using ULFM-based implementation. Our evaluation using the ImageNet dataset and AlexNet neural network topology demonstrates the effectiveness of the proposed fault tolerant DL implementation using OpenMPI based ULFM.

Amatya, Vinay C.↗

AutoEMX v1.

The invention consists in the full automation of compositional analysis of inorganic powder samples by scanning electron microscopy (SEM) with energy-dispersive X-ray spectroscopy (EDS). The measurements and analysis are controlled via python-based software, Auto-SEMEDS. Auto-SEMEDS fully automates the SEM-EDS measurements, and analyses the collected data via the use of machine-learning (ML) algorithms, which have never been used before for such scope. Auto-SEMEDS enables the identification in fully-automated fashion of the individual material phases present in a powder sample. Similar technologies, such as commercial SEM-EDS software, can automatically classify particles based on their composition, but they have significant limitations. These solutions typically provide inaccurate composition measurements and struggle to identify single phases in lab samples, where phases are often closely intermixed. In contrast, Auto-SEMEDS achieves unprecedented accuracy in composition measurements of powder samples, and furthermore leverages machine learning algorithms to effectively discern intermixed phases. Notably, while previous studies have demonstrated accurate measurements on individual particles, Auto-SEMEDS stands out by successfully analyzing mixture of different phases, a capability that has not been reported in the literature until now.

Giunto, Andrea [Lawrence Berkeley National Laborat↗

Learning to Branch with Interpretable Machine Learning Models

This presentation describes an algorithm for applying machine learning to branching to speed up the solution of integer optimization problems. These problems are challenging and solved multiple times a day by power systems operators. We show that our approach speeds up a widely used open-source optimization solver.

Bayramoglu, Selin↗

SU-C-BRA-04: Automated Segmentation of Head-And-Neck CT Images for Radiotherapy Treatment Planning Via Multi-Atlas Machine Learning (MAML)

Purpose: Accurate image segmentation is a crucial step during image guided radiation therapy. This work proposes multi-atlas machine learning (MAML) algorithm for automated segmentation of head-and-neck CT images. Methods: As the first step, the algorithm utilizes normalized mutual information as similarity metric, affine registration combined with multiresolution B-Spline registration, and then fuses together using the label fusion strategy via Plastimatch. As the second step, the following feature selection strategy is proposed to extract five feature components from reference or atlas images: intensity (I), distance map (D), box (B), center of gravity (C) and stable point (S). The box feature B is novel. It describes a relative position from each point to minimum inscribed rectangle of ROI. The center-of-gravity feature C is the 3D Euclidean distance from a sample point to the ROI center of gravity, and then S is the distance of the sample point to the landmarks. Then, we adopt random forest (RF) in Scikit-learn, a Python module integrating a wide range of state-of-the-art machine learning algorithms as classifier. Different feature and atlas strategies are used for different ROIs for improved performance, such as multi-atlas strategy with reference box for brainstem, and single-atlas strategy with reference landmark for optic chiasm. Results: The algorithm was validated on a set of 33 CT images with manual contours using a leave-one-out cross-validation strategy. Dice similarity coefficients between manual contours and automated contours were calculated: the proposed MAML method had an improvement from 0.79 to 0.83 for brainstem and 0.11 to 0.52 for optic chiasm with respect to multi-atlas segmentation method (MA). Conclusion: A MAML method has been proposed for automated segmentation of head-and-neck CT images with improved performance. It provides the comparable result in brainstem and the improved result in optic chiasm compared with MA. Xuhua Ren and Hao Gao were partially supported by the NSFC (#11405105), the 973 Program (#2015CB856000), and the Shanghai Pujiang Talent Program (#14PJ1404500).

60 APPLIED LIFE SCIENCES↗

Machine learning materials physics: Surrogate optimization and multi-fidelity algorithms predict precipitate morphology in an alternative to phase field dynamics

Machine learning has been effective at detecting patterns and predicting the response of systems that behave free of natural laws. Examples include learning crowd dynamics, recommender systems and autonomous mobility. There also have been applications to the search for new materials that draw upon big-data classification problems. Though, when it comes to physical systems governed by conservation laws, the role of machine learning has been more limited. Here, we present our recent work in exploring the role of machine learning methods in discovering, or aiding, the search for physics. Specifically, we focus on using machine learning algorithms to represent high-dimensional free energy surfaces with the goal of identifying precipitate morphologies in alloy systems. Traditionally, this problem has been approached by combining phase field models, which impose first-order dynamics, with elasticity, to traverse a free energy landscape in search of minima. Equilibrium precipitate morphologies occur at these minima. Here, we exploit the machine learning methods to represent high-dimensional data, combined with surrogate optimization, sensitivity analysis and multifidelity modeling as an alternate framework to explore phenomena controlled by energy extremization. This combination of data-driven methods offers an alternative to the imposition of first-order dynamics via phase field methods, and represents one aspect of applying machine learning to materials physics.

42 ENGINEERING↗

Sampling-based Sublinear Low-rank Matrix Arithmetic Framework for Dequantizing Quantum Machine Learning

We present an algorithmic framework for quantum-inspired classical algorithms on close-to-low-rank matrices, generalizing the series of results started by Tang’s breakthrough quantum-inspired algorithm for recommendation systems [STOC’19]. Motivated by quantum linear algebra algorithms and the quantum singular value transformation (SVT) framework of Gilyén et al. [STOC’19], we develop classical algorithms for SVT that run in time independent of input dimension, under suitable quantum-inspired sampling assumptions. Our results give compelling evidence that in the corresponding QRAM data structure input model, quantum SVT does not yield exponential quantum speedups. Since the quantum SVT framework generalizes essentially all known techniques for quantum linear algebra, our results, combined with sampling lemmas from previous work, suffice to generalize all prior results about dequantizing quantum machine learning algorithms. In particular, our classical SVT framework recovers and often improves the dequantization results on recommendation systems, principal component analysis, supervised clustering, support vector machines, low-rank regression, and semidefinite program solving. We also give additional dequantization results on low-rank Hamiltonian simulation and discriminant analysis. Our improvements come from identifying the key feature of the quantum-inspired input model that is at the core of all prior quantum-inspired results: ℓ 2 -norm sampling can approximate matrix products in time independent of their dimension. We reduce all our main results to this fact, making our exposition concise, self-contained, and intuitive.

Computer Science↗